Entanglement in Interactive Proof Systems with Binary Answers
| dc.creator | Wehner, Stephanie | |
| dc.date | 2005-08-26 | |
| dc.date | 2006-01-14 | |
| dc.date.accessioned | 2026-07-07T06:43:41Z | |
| dc.date.available | 2026-07-07T06:43:41Z | |
| dc.description | 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]. | |
| dc.description | 10 pages, LaTeX, To appear at STACS 2006 | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0508201 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0508201 | |
| dc.identifier | Proc. of 23rd STACS, 2006, LNCS 3884, pages 162-171. | |
| dc.identifier | doi:10.1007/11672142_12 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/102507 | |
| dc.subject | Quantum Physics | |
| dc.subject | Computational Complexity | |
| dc.title | Entanglement in Interactive Proof Systems with Binary Answers | |
| dc.type | text |