{
  "annotation_id": "00aef54e-a8d8-460e-919d-61012f77d80f",
  "date_created": "2026-03-02T18:02:03.634000Z",
  "date_modified": "2026-03-02T18:02:03.634000Z",
  "file_hash": "98b8818f7c8441f9c2381bbaa6507360ddd1cd845cb4ede6ea43f2e9222f7c48",
  "private": false,
  "record": {
    "abstract": "Channel capacity describes the size of the nearly ideal channels, which can\nbe obtained from many uses of a given channel, using an optimal error\ncorrecting code. In this paper we collect and compare minor and major\nvariations in the mathematically precise statements of this idea which have\nbeen put forward in the literature. We show that all the variations considered\nlead to equivalent capacity definitions. In particular, it makes no difference\nwhether one requires mean or maximal errors to go to zero, and it makes no\ndifference whether errors are required to vanish for any sequence of block\nsizes compatible with the rate, or only for one infinite sequence.",
    "arxiv_id": "quant-ph/0311037",
    "authors": [
      "Dennis Kretschmann",
      "Reinhard F Werner"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1088/1367-2630/6/1/026",
    "title": "Tema Con Variazioni: Quantum Channel Capacity",
    "url": "https://arxiv.org/abs/quant-ph/0311037"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "385ecded-ccae-42ab-a49a-0d9c680e5d66",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}