{
  "annotation_id": "a0ec05e1-6ee3-44c3-a22d-96e962485a7e",
  "date_created": "2026-03-02T18:02:06.397000Z",
  "date_modified": "2026-03-02T18:02:06.397000Z",
  "file_hash": "a26e78a43f080accfc2338e551ff0610d5b2c4421c6998ea81bb002f86b4f665",
  "private": false,
  "record": {
    "abstract": "We describe a quantum scheme to ``color-code\u0027\u0027 a set of objects in order to\nrecord which one is which. In the classical case, N distinct colors are\nrequired to color-code N objects. We show that in the quantum case, only N/e\ndistinct ``colors\u0027\u0027 are required, where e = 2.71828 . . . If the number of\ncolors is less than optimal, the objects may still be correctly distinguished\nwith some success probability less than 1. We show that the success probability\nof the quantum scheme is better than the corresponding classical one and is\ninformation-theoretically optimal.",
    "arxiv_id": "quant-ph/0405086",
    "authors": [
      "Joshua Von Korff",
      "Julia Kempe"
    ],
    "categories": [
      "quant-ph"
    ],
    "journal_ref": "Phys. Rev. Lett., Vol. 93 (26), 260502 (2004); new title \"Quantum\n  Advantage in Transmitting a Permutation\"",
    "title": "Quantum Color-Coding Is Better",
    "url": "https://arxiv.org/abs/quant-ph/0405086"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "fe0760a6-2d14-43d4-b365-07ae63830c21",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}