{
  "annotation_id": "04aa5f41-82ee-4360-8b6a-80330e0229dd",
  "date_created": "2026-03-02T18:02:20.688000Z",
  "date_modified": "2026-03-02T18:02:20.688000Z",
  "file_hash": "c001239676f477a08a947c90370235e26f617a0ad2ab3c9315e1e48674785344",
  "private": false,
  "record": {
    "abstract": "If two classical provers share an entangled state, the resulting interactive\nproof system is significantly weakened [quant-ph/0404076]. We show that for the\ncase where the verifier computes the XOR of two binary answers, the resulting\nproof system is in fact no more powerful than a system based on a single\nquantum prover: +MIP*[2] is contained in QIP(2). This also implies that\n+MIP*[2] is contained in EXP which was previously shown using a different\nmethod [Presentation of Cleve et al. at CCC\u002704]. This contrasts with an\ninteractive proof system where the two provers do not share entanglement. In\nthat case, +MIP[2] = NEXP for certain soundness and completeness parameters\n[quant-ph/0404076].",
    "arxiv_id": "quant-ph/0508201",
    "authors": [
      "Stephanie Wehner"
    ],
    "categories": [
      "quant-ph",
      "cs.CC"
    ],
    "doi": "10.1007/11672142_12",
    "journal_ref": "Proc. of 23rd STACS, 2006, LNCS 3884, pages 162-171.",
    "title": "Entanglement in Interactive Proof Systems with Binary Answers",
    "url": "https://arxiv.org/abs/quant-ph/0508201"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "e176a3f8-cfbc-4916-a559-b537353b4716",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}