Advertisement
Published in:
2006 | OriginalPaper | Chapter
Entanglement in Interactive Proof Systems with Binary Answers
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
If two classical provers share an entangled state, the resulting interactive proof system is significantly weakened [6]. 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:
$\rm \bigoplus MIP^*[2] \subseteq QIP(2)$
. This also implies that
$\rm \bigoplus MIP^*[2] \subseteq EXP$
which was previously shown using a different method [7]. This contrasts with an interactive proof system where the two provers do not share entanglement. In that case,
$\rm \bigoplus MIP[2] = NEXP$
for certain soundness and completeness parameters[6].