Entanglement in Interactive Proof Systems with Binary Answers

Details Entanglement in Interactive Proof Systems with Binary Answers Entanglement in Interactive Proof Systems with Binary Answers

2005-08-26

arxiv.org/abs/quant-ph/0508201v2

Proc. of 23rd STACS, 2006, LNCS 3884, pages 162-171.

Physics

Quantum Physics

10 pages, LaTeX, To appear at STACS 2006

Scientific paper

10.1007/11672142_12

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].

Affiliated with

Also associated with

No associations

Rating

Entanglement in Interactive Proof Systems with Binary Answers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Entanglement in Interactive Proof Systems with Binary Answers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Entanglement in Interactive Proof Systems with Binary Answers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-24814