{
  "annotation_id": "518decfd-09e0-4bdc-8e9e-9f08d51029f6",
  "date_created": "2026-03-02T18:02:03.190000Z",
  "date_modified": "2026-03-02T18:02:03.190000Z",
  "file_hash": "d2555151019ecb671844a1340222af169c2c66b2f85454cdd5bbcb2cde59bf1a",
  "private": false,
  "record": {
    "abstract": "Quantum game theory offers a lot of interesting questions, and it is relevant\nto use the quantum information theory to resolve or improve games with lack of\ninformation : how to use the power of quantum entanglement to show the\nsuperiority of a quantum player that is allowed to use quantum mechanics versus\na classical player, how to use quantum communication properties in cooperative\ngames ... But games are also useful to make notions easier to understand, and\npermit to apprehend easier new ways of reasoning. The objective of this work is\nto formalize and to study a simple game with qubits using quantum notions of\nmeasurement and superposition but keeping a simple formalism so that knowing\nquantum mechanics is not necessary to play the game. We solve a quantum\ncombinatorial game by giving a winning strategy for it. We also propose a\nquantisation of a family of combinatorial games.",
    "arxiv_id": "quant-ph/0311018",
    "authors": [
      "Sylvain Gravier",
      "Philippe Jorrand",
      "Mehdi Mhalla",
      "Charles Payan"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Let us play with qubits",
    "url": "https://arxiv.org/abs/quant-ph/0311018"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "e3c6dc9a-a46e-42ae-a76f-d586d7951ce3",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}