Published October 2018
| Submitted
Book Section - Chapter
Open
Classical Verification of Quantum Computations
- Creators
- Mahadev, Urmila
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.
Additional Information
© 2018 IEEE. Thanks to Dorit Aharonov, Zvika Brakerski, Zeph Landau, Umesh Vazirani and Thomas Vidick for many useful discussions. The author is supported by Templeton Foundation Grant 52536, ARO Grant W911NF-12-1-0541, NSF Grant CCF-1410022 and MURI Grant FA9550-18-1-0161.Attached Files
Submitted - 1804.01082.pdf
Files
1804.01082.pdf
Files
(617.9 kB)
Name | Size | Download all |
---|---|---|
md5:ff17f99a2b7df184a72fd105d56821ec
|
617.9 kB | Preview Download |
Additional details
- Eprint ID
- 104765
- DOI
- 10.1109/focs.2018.00033
- Resolver ID
- CaltechAUTHORS:20200805-144416533
- 52536
- John Templeton Foundation
- W911NF-12-1-0541
- Army Research Office (ARO)
- CCF-1410022
- NSF
- FA9550-18-1-0161
- Air Force Office of Scientific Research (AFOSR)
- Created
-
2020-08-05Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field