Succinct Arguments for QMA in the Quantum Random Oracle Model

arXiv:2609.37429 · quant-ph, cs.CR · Submitted 2026-09-29 · Read on arXiv

quant-ph, cs.CR

Submitted: 2026-09-29

Updated: 2026-10-05

Code: https://github.com/hash-based-snargs-book/hash-based-snargs-book

Terminology

• Verifier — 93× in this paper · explained in 2 episodes
• Query Complexity — 9× in this paper · explained in 2 episodes
• Ancilla Qubits — 8× in this paper · explained in 1 episode
• Hilbert Space — 5× in this paper · explained in 2 episodes
• Verification — 4× in this paper · explained in 2 episodes
• Consistency — 1× in this paper · explained in 3 episodes
• Entanglement — 1× in this paper · explained in 3 episodes
• Generalization — 1× in this paper · explained in 13 episodes
• Quantum Circuits — 1× in this paper · explained in 2 episodes

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
• Polynomial-time classical and quantum simulation of quantum impurity models
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity