{
  "annotation_id": "bc9a32ce-1b99-46a3-aa5c-8f75a722a3cc",
  "date_created": "2026-03-02T18:02:41.657000Z",
  "date_modified": "2026-03-02T18:02:41.657000Z",
  "file_hash": "eb5c2cb0565f92e4964851891d74818477f45f3500ac114360f88907dfb690f6",
  "private": false,
  "record": {
    "abstract": "We consider game theory from the perspective of quantum algorithms.\nStrategies in classical game theory are either pure (deterministic) or mixed\n(probabilistic). We introduce these basic ideas in the context of a simple\nexample, closely related to the traditional Matching Pennies game. While not\nevery two-person zero-sum finite game has an equilibrium in the set of pure\nstrategies, von Neumann showed that there is always an equilibrium at which\neach player follows a mixed strategy. A mixed strategy deviating from the\nequilibrium strategy cannot increase a player\u0027s expected payoff. We show,\nhowever, that in our example a player who implements a quantum strategy can\nincrease his expected payoff, and explain the relation to efficient quantum\nalgorithms. We prove that in general a quantum strategy is always at least as\ngood as a classical one, and furthermore that when both players use quantum\nstrategies there need not be any equilibrium, but if both are allowed mixed\nquantum strategies there must be.",
    "arxiv_id": "quant-ph/9804010",
    "authors": [
      "David A. Meyer"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.82.1052",
    "journal_ref": "Phys.Rev.Lett. 82 (1999) 1052-1055",
    "title": "Quantum strategies",
    "url": "https://arxiv.org/abs/quant-ph/9804010"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "86c7d3a3-bc15-4d3b-b4d7-b70a12730bc1",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}