Entanglement in Interactive Proof Systems with Binary Answers

Abstract

If two classical provers share an entangled state, the resulting interactive proof system is significantly weakened [quant-ph/0404076]. We show that for the case where the verifier computes the XOR of two binary answers, the resulting proof system is in fact no more powerful than a system based on a single quantum prover: +MIP*[2] is contained in QIP(2). This also implies that +MIP*[2] is contained in EXP which was previously shown using a different method [Presentation of Cleve et al. at CCC'04]. This contrasts with an interactive proof system where the two provers do not share entanglement. In that case, +MIP[2] = NEXP for certain soundness and completeness parameters [quant-ph/0404076].

10 pages, LaTeX, To appear at STACS 2006

References in corpus (2)

• Nonlocality as an axiom for quantum theory
• Causality and Nonlocality as Axioms for Quantum Mechanics

Cited by in corpus (7)

• Quantum Proofs
• Coherent state exchange in multi-prover quantum interactive proof systems
• Quantum Strategies and Local Operations
• Quantum interactive proofs with weak error bounds
• Generalized Quantum Arthur-Merlin Games
• A Lower Bound on the Value of Entangled Binary Games
• Properties of Local Quantum Operations with Shared Entanglement