{
  "annotation_id": "30a80dd7-d172-48e6-b764-d5be3b0cb90a",
  "date_created": "2026-03-02T18:01:55.728000Z",
  "date_modified": "2026-03-02T18:01:55.728000Z",
  "file_hash": "7a21c2c1e2a1a56b1aff64a12abb6668b1796ea816dcbcc34c478af1d14be6a2",
  "private": false,
  "record": {
    "abstract": "Imagine that Alice and Bob, unable to communicate, are both given a 16-bit\nstring such that the strings are either equal, or they differ in exactly 8\npositions. Both parties are then supposed to output a 4-bit string in such a\nway that these short strings are equal if and only if the original longer\nstrings given to them were equal as well. It is known that this task can be\nfulfilled without failure and without communication if Alice and Bob share 4\nmaximally entangled quantum bits. We show that, on the other hand, they CANNOT\nwin the same game with certainty if they only share classical bits, even if it\nis an unlimited number. This means that for fulfilling this particular\ndistributed task, quantum entanglement can completely replace communication.\nThis phenomenon has been called pseudo-telepathy. The results of this paper\ncomplete the analysis of the first proposed game of this type between two\nplayers.",
    "arxiv_id": "quant-ph/0211011",
    "authors": [
      "Viktor Galliard",
      "Stefan Wolf",
      "Alain Tapp"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "The Impossibility of Pseudo-Telepathy Without Quantum Entanglement",
    "url": "https://arxiv.org/abs/quant-ph/0211011"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "0173470b-bd19-4242-88d2-502ccd5f0d83",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}