{
  "annotation_id": "23fdcc6d-b28e-45b3-83c8-f3031d22929f",
  "date_created": "2026-03-02T18:02:09.390000Z",
  "date_modified": "2026-03-02T18:02:09.390000Z",
  "file_hash": "b99257f5a6b627740b04bafe61bacf87368e643e752985a76ea7f82aecfe355d",
  "private": false,
  "record": {
    "abstract": "Quantum key distribution protocols based on equiangular spherical codes are\nintroduced and their behavior under the intercept/resend attack investigated.\nSuch protocols offer a greater range of secure noise tolerance and speed\noptions than protocols based on their cousins, the mutually-unbiased bases,\nwhile also enabling the determination of the channel noise rate without the\nneed to sacrifice key bits. For fixed number of signal states in a given\ndimension, the spherical code protocols offer Alice and Bob more noise\ntolerance at the price of slower key generation rates.",
    "arxiv_id": "quant-ph/0409043",
    "authors": [
      "Joseph M. Renes"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.26421/QIC5.1-8",
    "journal_ref": "Quant. Inf. Comput. 5(1), 080-091 (2005)",
    "title": "Equiangular Spherical Codes in Quantum Cryptography",
    "url": "https://arxiv.org/abs/quant-ph/0409043"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "bb2d0ea6-36d0-4b9c-ac27-0ddf6664cae1",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}