A simple protocol for fault tolerant verification of quantum computation

With experimental quantum computing technologies now in their infancy, the search for efficient means of testing the correctness of these quantum computations is becoming more pressing. An approach to the verification of quantum computation within the framework of interactive proofs has been fruitful for addressing this problem. Specifically, an untrusted agent (prover) alleging to perform quantum computations can have his claims verified by another agent (verifier) who only has access to classical computation and a small quantum device for preparing or measuring single qubits. However, when this quantum device is prone to errors, verification becomes challenging and often existing protocols address this by adding extra assumptions, such as requiring the noise in the device to be uncorrelated with the noise on the prover's devices. In this paper, we present a simple protocol for verifying quantum computations, in the presence of noisy devices, with no extra assumptions. This protocol is based on post hoc techniques for verification, which allow for the prover to know the desired quantum computation and its input. We also perform a simulation of the protocol, for a one-qubit computation, and find the error thresholds when using the qubit repetition code as well as the Steane code.

[1]  A. Kitaev.  Quantum computations: algorithms and error correction , 1997 .

[2]  Tomoyuki Morimae,et al.  Quantum Arthur-Merlin with single-qubit measurements , 2016, ArXiv.

[3]  Joseph Fitzsimons,et al.  Post hoc verification of quantum computation , 2015, Physical review letters.

[4]  Steane,et al.  Error Correcting Codes in Quantum Theory. , 1996, Physical review letters.

[5]  E. Knill,et al.  Resilient quantum computation: error models and thresholds , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[6]  T. Morimae.  Blind quantum computing can always be made verifiable , 2018, 1803.06624.

[7]  Julia Kempe,et al.  The Complexity of the Local Hamiltonian Problem , 2004, FSTTCS.

[8]  Oded Regev,et al.  On lattices, learning with errors, random linear codes, and cryptography , 2005, STOC '05.

[9]  Julia Kempe,et al.  3-local Hamitonian is QMA-complete , 2003 .

[10]  Mikhail N. Vyalyi,et al.  Classical and Quantum Computation , 2002, Graduate studies in mathematics.

[11]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[12]  M. Hayashi,et al.  Verifiable fault tolerance in measurement-based quantum computation , 2016, 1610.05216.

[13]  Elad Eban,et al.  Interactive Proofs For Quantum Computations , 2017, 1704.04487.

[14]  Animesh Datta,et al.  Nonadaptive fault-tolerant verification of quantum supremacy with noise , 2017, Quantum.

[15]  Tomoyuki Morimae,et al.  Fault-tolerant verifiable blind quantum computing with logical state remote preparation , 2016, 1607.01568.

[16]  Elham Kashefi,et al.  Robustness and device independence of verifiable blind quantum computing , 2015, 1502.02571.

[17]  Elham Kashefi,et al.  Verification of Quantum Computation: An Overview of Existing Approaches , 2017, Theory of Computing Systems.

[18]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[19]  R. Schoelkopf,et al.  Superconducting Circuits for Quantum Information: An Outlook , 2013, Science.

[20]  J. Biamonte,et al.  Realizable Hamiltonians for Universal Adiabatic Quantum Computers , 2007, 0704.1287.

[21]  M. Mariantoni,et al.  Surface codes: Towards practical large-scale quantum computation , 2012, 1208.0928.

[22]  Oron Shagrir,et al.  Is Quantum Mechanics Falsifiable? A Computational Perspective on the Foundations of Quantum Mechanics , 2013 .

[23]  Tomoyuki Morimae,et al.  Post hoc verification with a single prover , 2016 .

[24]  Dorit Aharonov,et al.  Fault-tolerant Quantum Computation with Constant Error Rate * , 1999 .

[25]  Urmila Mahadev,et al.  Classical Verification of Quantum Computations , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[26]  Andrew W. Cross,et al.  Experimental Demonstration of Fault-Tolerant State Preparation with Superconducting Qubits. , 2017, Physical review letters.

[27]  Umesh Vazirani,et al.  Is Quantum Mechanics Falsifiable? A computational perspective on the foundations of Quantum Mechanics , 2012, 1206.3686.

[28]  Keisuke Fujii,et al.  Quantum Merlin-Arthur with noisy channel , 2016, ArXiv.

[29]  Dorit Aharonov,et al.  Guest column: the quantum PCP conjecture , 2013, SIGA.