{
  "annotation_id": "c8d90988-967a-468c-9646-aff712601377",
  "date_created": "2026-03-02T18:02:41.535000Z",
  "date_modified": "2026-03-02T18:02:41.535000Z",
  "file_hash": "8f876242ed9597f7a1439336d36218214556289ebc11e62db381766d87a6c0da",
  "private": false,
  "record": {
    "abstract": "Quantum error-correcting codes are analyzed from an information-theoretic\nperspective centered on quantum conditional and mutual entropies. This approach\nparallels the description of classical error correction in Shannon theory,\nwhile clarifying the differences between classical and quantum codes. More\nspecifically, it is shown how quantum information theory accounts for the fact\nthat \"redundant\" information can be distributed over quantum bits even though\nthis does not violate the quantum \"no-cloning\" theorem. Such a remarkable\nfeature, which has no counterpart for classical codes, is related to the\nproperty that the ternary mutual entropy vanishes for a tripartite system in a\npure state. This information-theoretic description of quantum coding is used to\nderive the quantum analogue of the Singleton bound on the number of logical\nbits that can be preserved by a code of fixed length which can recover a given\nnumber of errors.",
    "arxiv_id": "quant-ph/9702031",
    "authors": [
      "Nicolas J. Cerf",
      "Richard Cleve"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.56.1721",
    "journal_ref": "Phys.Rev.A56:1721,1997",
    "title": "Information-theoretic interpretation of quantum error-correcting codes",
    "url": "https://arxiv.org/abs/quant-ph/9702031"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "707c24f3-c212-4c8b-a6e8-8d5e32c37b9b",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}