{
  "annotation_id": "9c7e73b1-668d-4422-90d7-012db1c5a1b4",
  "date_created": "2026-03-02T18:02:41.607000Z",
  "date_modified": "2026-03-02T18:02:41.607000Z",
  "file_hash": "bfd89334f5992ff31c3c6adc262730978f8eab337a482de5617486c6754dcb9e",
  "private": false,
  "record": {
    "abstract": "The more than thirty years old issue of the information capacity of quantum\ncommunication channels was dramatically clarified during the last period, when\na number of direct quantum coding theorems was discovered. To considerable\nextent this progress is due to an interplay between the quantum communication\ntheory and quantum information ideas related to more recent development in\nquantum computing. It is remarkable, however, that many probabilistic tools\nunderlying the treatment of quantum case have their roots, and in some cases\ndirect prototypes, in classical Shannon\u0027s theory. This paper presents an\noutline of some basic ideas and results in that direction.",
    "arxiv_id": "quant-ph/9708046",
    "authors": [
      "A. S. Holevo"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Coding Theorems for Quantum Communication Channels",
    "url": "https://arxiv.org/abs/quant-ph/9708046"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "4332ff31-59b3-4241-a3e5-c9b955a3f710",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}