Classical Verification of Quantum Computation Beyond the Polynomial Hierarchy
This paper demonstrates that, relative to a classical oracle, a classical polynomial-time verifier can efficiently verify a language beyond the polynomial hierarchy decided by a quantum polynomial-time prover using a public-coin interactive proof system, achieved through a novel recursive Fourier sampling variant and a new switching theorem that overcomes limitations of Håstad's switching lemma.
Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer
Drowning in papers in your field?
Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.