A Relativizing MIP for BQP
Scott Aaronson, Anand Natarajan, Avishay Tal, Agi Villanyi

TL;DR
This paper demonstrates that BQP is contained in MIP relative to any classical oracle by constructing a classical-query PCP system for BQP, advancing understanding of quantum-classical proof systems.
Contribution
It constructs a classical-query PCP proof system for BQP relative to any oracle, showing BQP is contained in MIP in the relativized setting, and introduces relativization as a proxy for prover efficiency.
Findings
BQP is contained in MIP relative to any classical oracle.
Constructs a PCP system with polynomial classical queries for BQP.
Relativization may lead to non-cryptographic protocols for quantum computation verification.
Abstract
Complexity class containments involving interactive proof classes are famously nonrelativizing: although , Fortnow and Sipser showed that that there exists an oracle relative to which . In contrast, the question of whether the containment is relativizing remains wide open. In this work we make progress towards resolving this question by showing that the containment holds with respect to any classical oracle. We obtain this result by constructing, for any classical oracle , a proof system for where the verifier makes polynomially many classical queries to an exponentially-long proof, and to the oracle . Our construction is inspired by the state synthesis algorithm of Grover and Rudolph, and serves as a…
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.
