{
  "annotation_id": "742320f6-d721-4d6e-8c82-155489e37176",
  "date_created": "2026-03-02T18:01:59.658000Z",
  "date_modified": "2026-03-02T18:01:59.658000Z",
  "file_hash": "6894c7477c70461b38c66248b8901505123fed46f9767ca84c3c39e48e25ed13",
  "private": false,
  "record": {
    "abstract": "Quantum entanglement, perhaps the most non-classical manifestation of quantum\ninformation theory, cannot be used to transmit information between remote\nparties. Yet, it can be used to reduce the amount of communication required to\nprocess a variety of distributed computational tasks. We speak of\npseudo-telepathy when quantum entanglement serves to eliminate the classical\nneed to communicate. In earlier examples of pseudo-telepathy, classical\nprotocols could succeed with high probability unless the inputs were very\nlarge. Here we present a simple multi-party distributed problem for which the\ninputs and outputs consist of a single bit per player, and we present a perfect\nquantum protocol for it. We prove that no classical protocol can succeed with a\nprobability that differs from 1/2 by more than a fraction that is exponentially\nsmall in the number of players. This could be used to circumvent the detection\nloophole in experimental tests of nonlocality.",
    "arxiv_id": "quant-ph/0306042",
    "authors": [
      "Gilles Brassard",
      "Anne Broadbent",
      "Alain Tapp"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1007/978-3-540-45078-8_1",
    "title": "Multi-Party Pseudo-Telepathy",
    "url": "https://arxiv.org/abs/quant-ph/0306042"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "6ba530b7-c700-4d1d-b6a4-d6f83f566c18",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}