Robustness and device independence of verifiable blind quantum computing

Alexandru Gheorghiu, Elham Kashefi, Petros Wallden

Research output: Contribution to journalArticlepeer-review

Abstract / Description of output

Recent advances in theoretical and experimental quantum computing brings us closer to scalable quantum computing devices. This lead researchers to develop protocols for verifying the correct functionality of quantum operations. In this paper we address key challenges to make quantum verification protocols applicable to experimental implementations. We prove the robustness of the single server verification protocol of Fitzsimons and Kashefi (2012) which is based on universal blind quantum computing. The robustness of this protocol makes possible its composition with the device-independent protocol of Reichardt, Unger and Vazirani (2013). The new composite protocol inherits the device independence from Reichardt, Unger and Vazirani protocol while it leads to a lower round complexity for the verification of entangled quantum servers scenario. Finally, we give a fault tolerant version of the Fitzsimons and Kashefi protocol which suggests that the composite protocol can also be made fault tolerant.
Original languageEnglish
Article number083040
Number of pages22
JournalNew Journal of Physics
Issue number8
Publication statusPublished - 19 Aug 2015

Keywords / Materials (for Non-textual outputs)

  • quant-ph


Dive into the research topics of 'Robustness and device independence of verifiable blind quantum computing'. Together they form a unique fingerprint.

Cite this