Published by arXiv Quantum Physics · On GETSECURE.ai ·
Classical Verification of Quantum Computation Beyond the Polynomial Hierarchy
It is not known whether a classical polynomial-time verifier can verify arbitrary polynomial-time quantum computations with an efficient quantum honest prover without com
Excerpt from arXiv Quantum Physics
GETSECURE.ai hasn't published its own summary of this story yet. The complete report is at arXiv Quantum Physics: