Classical Verification of Quantum Computation Beyond the Polynomial Hierarchy
quant-ph, cs.CC, cs.CR
Submitted: 2026-10-27
Updated: 2026-10-27
Terminology
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Pure states are optimal for total energy-constrained quantum channel discrimination
- Polynomial-time classical and quantum simulation of quantum impurity models
- Incoherent Imaging with Spatially Structured Quantum Probes
- A quasiparticle-protected superconducting qubit