Limits to black-box amplification in QMA

arXiv:2509.21131 · quant-ph · Submitted 2025-09-25 · Read on arXiv

quant-ph

Submitted: 2025-09-25

Updated: 2026-10-01

Terminology

• Verifier — 14× in this paper · explained in 2 episodes
• Verification — 4× in this paper · explained in 2 episodes
• Hilbert Space — 2× in this paper · explained in 2 episodes
• BQP — 1× in this paper · explained in 2 episodes
• Chebyshev Polynomials — 1× in this paper · explained in 2 episodes

Sources

• On Perfect Completeness for QMA
• Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy
• A Complete Characterization of Unitary Quantum Space
• Achieving perfect completeness in classical-witness quantum Merlin-Arthur proof systems
• ${\sf QMA}={\sf QMA}_1$ with an infinite counter
• Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?
• Quantum Arthur-Merlin Games

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