Entanglement-Resistant Two-Prover Interactive Proof Systems and Non-Adaptive Private Information Retrieval Systems

Abstract

We show that, for any language in NP, there is an entanglement-resistant constant-bit two-prover interactive proof system with a constant completeness vs. soundness gap. The previously proposed classical two-prover constant-bit interactive proof systems are known not to be entanglement-resistant. This is currently the strongest expressive power of any known constant-bit answer multi-prover interactive proof system that achieves a constant gap. Our result is based on an "oracularizing" property of certain private information retrieval systems, which may be of independent interest.

8 pages

References in corpus (2)

• No quantum advantage for nonlocal computation
• On the Power of Entangled Quantum Provers

Cited by in corpus (10)

• Large violation of Bell inequalities with low entanglement
• Coherent state exchange in multi-prover quantum interactive proof systems
• Quantum Strategies and Local Operations
• Entangled games are hard to approximate
• Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-Prover Interactive Proof Systems
• Using Entanglement in Quantum Multi-Prover Interactive Proofs
• Interactive proofs with competing teams of no-signaling provers
• Entangled games do not require much entanglement (withdrawn)
• A Lower Bound on the Value of Entangled Binary Games
• Properties of Local Quantum Operations with Shared Entanglement