Abstract
We explore quantum-inspired interactive proof systems where the prover is limited. Namely, we improve on a result by [6] showing a quantum-inspired interactive protocol (IP) for PreciseBQP where the prover is only assumed to be a PreciseBQP machine, and show that the result can be strengthened to show an IP for NPPP with a prover which is only assumed to be an NPPP machine-which was not known before. We also show how the protocol can be used to directly verify QMA computations, thus connect-ing the sum-check protocol by [2] with the result of [6, 29]. Our results shed light on a quantum-inspired proof for IP = PSPACE, as PreciseQMA captures the full PSPACE power.
| Original language | American English |
|---|---|
| Pages (from-to) | 377-386 |
| Number of pages | 10 |
| Journal | Quantum Information and Computation |
| Volume | 21 |
| Issue number | 5-6 |
| DOIs | |
| State | Published - 2021 |
Bibliographical note
Funding Information:We thank Dorit Aharonov for helpful discussions. GK was supported by ISF Grant No. 1692/13 and ISF Grant No. 2635/19. AG and YL were supported by ISF Grant No. 1721/17. AG was also partially supported by CYBER grant.
Publisher Copyright:
© Rinton Press.
Keywords
- Delegating quantum computation
- Interactive proofs