{
  "annotation_id": "6c539e27-2a3a-4d66-8071-05b7148d7516",
  "date_created": "2026-03-02T18:02:30.845000Z",
  "date_modified": "2026-03-02T18:02:30.845000Z",
  "file_hash": "ffe56c07affd6adb4543c73826927a7220e17d5ec58700e0fd6c30e38476600b",
  "private": false,
  "record": {
    "abstract": "We investigate the problem of \"nonlocal\" computation, in which separated\nparties must compute a function with nonlocally encoded inputs and output, such\nthat each party individually learns nothing, yet together they compute the\ncorrect function output. We show that the best that can be done classically is\na trivial linear approximation. Surprisingly, we also show that quantum\nentanglement provides no advantage over the classical case. On the other hand,\ngeneralized (i.e. super-quantum) nonlocal correlations allow perfect nonlocal\ncomputation. This gives new insights into the nature of quantum nonlocality and\nits relationship to generalised nonlocal correlations.",
    "arxiv_id": "quant-ph/0610097",
    "authors": [
      "Noah Linden",
      "Sandu Popescu",
      "Anthony J. Short",
      "Andreas Winter"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.99.180502",
    "journal_ref": "Phys. Rev. Lett. 99:180502, 2007",
    "title": "No quantum advantage for nonlocal computation",
    "url": "https://arxiv.org/abs/quant-ph/0610097"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "bb559ba1-8278-45b3-b2a0-04e9ba4ff3de",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}