{
  "annotation_id": "b40c5539-c6d1-4205-a0db-9dc22313724c",
  "date_created": "2026-03-02T18:01:38.495000Z",
  "date_modified": "2026-03-02T18:01:38.495000Z",
  "file_hash": "03327c549c25c51bdc4a259e5bd5e98ef35547a72bcf4fb7a276090eea759f8e",
  "private": false,
  "record": {
    "abstract": "A quantum algorithm for an oracle problem can be understood as a quantum\nstrategy for a player in a two-player zero-sum game in which the other player\nis constrained to play classically. I formalize this correspondence and give\nexamples of games (and hence oracle problems) for which the quantum player can\ndo better than would be possible classically. The most remarkable example is\nthe Bernstein-Vazirani quantum search algorithm which I show creates no\nentanglement at any timestep.",
    "arxiv_id": "quant-ph/0004092",
    "authors": [
      "David A. Meyer"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Quantum games and quantum algorithms",
    "url": "https://arxiv.org/abs/quant-ph/0004092"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "c3b1e018-df32-4626-8823-9a7ada07d52c",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}