Quantitative Quantum Soundness for Bipartite Compiled Bell Games via the Sequential NPA Hierarchy

arXiv:2507.17006 · quant-ph, cs.CR, math-ph, math.MP · Submitted 2025-07-22 · Read on arXiv

quant-ph, cs.CR, math-ph, math.MP

Submitted: 2025-07-22

Updated: 2026-10-16

Comments: 41 pages, 1 figure; comments welcome. v3: corrected proofs of the main results and the robust self-testing remark; removed incorrect NPA comparison claims; added an explicit flat optimal sequential NPA solution for CHSH; removed former Sec. 4 (see v2 for its discussion of the necessity of the NPA convergence rate). Independent parallel work by Cui, Falor, Natarajan and Zhang

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• NPA Hierarchy — 2× in this paper · explained in 2 episodes
• Core — 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
• A quasiparticle-protected superconducting qubit
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians