Multi-Prover Interactive Proof Systems with Leakage

arXiv:2605.09872 · quant-ph, cs.CC · Submitted 2026-05-11 · Read on arXiv

quant-ph, cs.CC

Submitted: 2026-05-11

Updated: 2026-07-05

Terminology

• Verifier — 36× in this paper · explained in 2 episodes
• Entanglement — 12× in this paper · explained in 4 episodes
• Verification — 6× in this paper · explained in 2 episodes
• Query Complexity — 4× in this paper · explained in 2 episodes
• Consistency — 2× in this paper · explained in 3 episodes
• Robustness — 2× in this paper · explained in 5 episodes
• BQP — 1× in this paper · explained in 2 episodes
• Core — 1× in this paper · explained in 2 episodes
• Hilbert Space — 1× in this paper · explained in 2 episodes
• Quantum Circuits — 1× in this paper · explained in 2 episodes

Sources

• A simple demonstration of Bell's theorem involving two observers and no probabilities or inequalities
• Quantum Computing: Lecture Notes
• Maximum Separation of Quantum Communication Complexity With and Without Shared Entanglement
• MIP*=RE

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