Tight Post-Quantum Parallel Repetition for Private-Coin Arguments

arXiv:2609.38941 · quant-ph, cs.CR · Submitted 2026-09-30 · Read on arXiv

quant-ph, cs.CR

Submitted: 2026-09-30

Updated: 2026-10-01

Terminology

• Verifier — 78× in this paper · explained in 2 episodes
• Trace — 10× in this paper · explained in 2 episodes
• Trace Distance — 10× in this paper · explained in 3 episodes
• Post-Selection — 5× in this paper · explained in 2 episodes
• Quantum Circuits — 5× in this paper · explained in 2 episodes
• Annual Symposium on Foundations of Computer Science — 3× in this paper
• Hilbert Space — 3× in this paper · explained in 2 episodes
• Quantum Singular Value Transformation — 3× in this paper
• Quantum Singular Value Transformation (QSVT) — 3× in this paper · explained in 4 episodes
• Quantum Homomorphic Encryption — 2× in this paper
• Verification — 2× in this paper · explained in 2 episodes
• Entanglement — 1× in this paper · explained in 4 episodes
• Quantization — 1× in this paper · explained in 12 episodes

Sources

• Compiling Any $\mathsf{MIP}^{*}$ into a (Succinct) Classical Interactive Argument

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