Entanglement in Interactive Proof Systems with Binary Answers
<|reference_start|>Entanglement in Interactive Proof Systems with Binary Answers: 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].<|reference_end|>
@article{wehner2005entanglement,
    title={Entanglement in Interactive Proof Systems with Binary Answers},
    author={Stephanie Wehner (CWI, Amsterdam)},
    journal={Proc. of 23rd STACS, 2006, LNCS 3884, pages 162-171.},
    year={2005},
    doi={10.1007/11672142_12},
    archivePrefix={arXiv},
    eprint={quant-ph/0508201},
    primaryClass={quant-ph cs.CC}
}