Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
Entanglement in Interactive Proof Systems with Binary Answers
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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].