{
  "annotation_id": "899b3522-9cb7-47a5-a426-1d5298e50f9a",
  "date_created": "2026-03-02T18:02:37.235000Z",
  "date_modified": "2026-03-02T18:02:37.235000Z",
  "file_hash": "f1f5e1447120b80a63329de0048d59efa0380a67457a5d7b997abf1eb53658c0",
  "private": false,
  "record": {
    "abstract": "We show that within any quantum stabilizer code there lurks a classical\nbinary linear code with similar error-correcting capabilities, thereby\ndemonstrating new connections between quantum codes and classical codes. Using\nthis result -- which applies to degenerate as well as nondegenerate codes --\npreviously established necessary conditions for classical linear codes can be\neasily translated into necessary conditions for quantum stabilizer codes.\nExamples of specific consequences are: for a quantum channel subject to a\ndelta-fraction of errors, the best asymptotic capacity attainable by any\nstabilizer code cannot exceed H(1/2 + sqrt(2*delta*(1-2*delta))); and, for the\ndepolarizing channel with fidelity parameter delta, the best asymptotic\ncapacity attainable by any stabilizer code cannot exceed 1-H(delta).",
    "arxiv_id": "quant-ph/9612048",
    "authors": [
      "Richard Cleve"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.55.4054",
    "title": "Quantum Stabilizer Codes and Classical Linear Codes",
    "url": "https://arxiv.org/abs/quant-ph/9612048"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "ad56aa82-733a-4ed9-b075-0b0c2f2672ee",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}