Classical Verification of Quantum Computations
Urmila Mahadev
Abstract
We present the first protocol allowing a classical computer to interactively verify the result of an efficient quantum computation. We achieve this by constructing a measurement protocol, which enables a classical verifier to use a quantum prover as a trusted measurement device. The protocol forces the prover to behave as follows: the prover must construct an $n$ qubit state of his choice, measure each qubit in the Hadamard or standard basis as directed by the verifier, and report the measurement results to the verifier. The soundness of this protocol is enforced based on the assumption that the learning with errors problem is computationally intractable for efficient quantum machines.
Topics & Concepts
Gas meter proverSoundnessComputer scienceQubitQuantum computerTheoretical computer scienceProtocol (science)Construct (python library)ComputationHadamard transformLearning with errorsQuantumQuantum algorithmAlgorithmCryptographyMathematicsMathematical proofProgramming languageQuantum mechanicsPhysicsGeometryAlternative medicineMathematical analysisMedicinePathologyCryptography and Data SecurityQuantum Computing Algorithms and ArchitectureQuantum Information and Cryptography