Succinct Arguments for QMA from Collapsing Hash Functions

arXiv:2609.35633 · quant-ph, cs.CR · Submitted 2026-09-28 · Read on arXiv

quant-ph, cs.CR

Submitted: 2026-09-28

Updated: 2026-09-28

Terminology

• Verifier — 38× in this paper · explained in 2 episodes
• Verification — 12× in this paper · explained in 2 episodes
• Annual Symposium on Foundations of Computer Science — 3× in this paper
• Annual ACM Symposium on Theory of Computing — 2× in this paper
• Hilbert Space — 2× in this paper · explained in 2 episodes
• Trace — 2× in this paper · explained in 2 episodes
• Accuracy — 1× in this paper · explained in 1 episode
• BQP — 1× in this paper · explained in 2 episodes
• Quantum Circuits — 1× in this paper · explained in 2 episodes
• Trace Distance — 1× in this paper · explained in 3 episodes

Sources

• A Modular Approach to Succinct Arguments for QMA
• Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier
• Commitments to Quantum States
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• Classical Commitments to Quantum States
• Quantum Advantage from Any Non-Local Game
• Succinct arguments for QMA from standard assumptions via compiled nonlocal games
• Bounding the quantum value of compiled nonlocal games: from CHSH to BQP verification
• Succinct Blind Quantum Computation Using a Random Oracle

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