Post hoc verification with a single prover
Tomoyuki Morimae, Joseph F. Fitzsimons

TL;DR
This paper introduces a simple post hoc quantum verification protocol using a single prover restricted to X/Z basis measurements, requiring only one-way communication, and discusses the classical verifier limitations related to complexity classes.
Contribution
It presents a novel single-prover quantum verification protocol with minimal measurement restrictions and one-way communication, improving upon previous multi-prover methods.
Findings
Single-prover protocol with measurement restrictions
One-way communication from prover to verifier
Classical verifier protocols are unlikely unless BQP is in the third level of the polynomial hierarchy
Abstract
We propose a simple protocol for the verification of quantum computation after the computation has been performed. Our construction can be seen as an improvement on previous results in that it requires only a single prover, who is restricted to measuring qubits in the or basis, while requiring only one way communication, from the prover to the verifier. We also show similar constant round protocols with purely classical verifiers are not possible, unless BQP is contained in the third level of the polynomial hierarchy.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
