{
  "annotation_id": "b5dfc06d-f567-4898-a54e-7d22a50555a5",
  "date_created": "2026-03-02T18:02:06.802000Z",
  "date_modified": "2026-03-02T18:02:06.802000Z",
  "file_hash": "97e8b1d353cdebd92c80a19005156b22ea9457343f87c8d4c1db2047fcd089dd",
  "private": false,
  "record": {
    "abstract": "This paper investigates the powers and limitations of quantum entanglement in\nthe context of cooperative games of incomplete information. We give several\nexamples of such nonlocal games where strategies that make use of entanglement\noutperform all possible classical strategies. One implication of these examples\nis that entanglement can profoundly affect the soundness property of two-prover\ninteractive proof systems. We then establish limits on the probability with\nwhich strategies making use of entanglement can win restricted types of\nnonlocal games. These upper bounds may be regarded as generalizations of\nTsirelson-type inequalities, which place bounds on the extent to which quantum\ninformation can allow for the violation of Bell inequalities. We also\ninvestigate the amount of entanglement required by optimal and nearly optimal\nquantum strategies for some games.",
    "arxiv_id": "quant-ph/0404076",
    "authors": [
      "Richard Cleve",
      "Peter Hoyer",
      "Ben Toner",
      "John Watrous"
    ],
    "categories": [
      "quant-ph"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "Consequences and Limits of Nonlocal Strategies",
    "url": "https://arxiv.org/abs/quant-ph/0404076"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "8715889d-d4f9-44e8-9095-1d68c64dc617",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}