{
  "annotation_id": "458c0da1-7b28-4098-9678-666dfa349680",
  "date_created": "2026-03-02T18:02:33.982000Z",
  "date_modified": "2026-03-02T18:02:33.982000Z",
  "file_hash": "e403a9f853bc8d51773509db5b93d68c4ea9b928dc2a8961be5f5cf597672019",
  "private": false,
  "record": {
    "abstract": "We work out a theory of approximate quantum error correction that allows us\nto derive a general lower bound for the entanglement fidelity of a quantum\ncode. The lower bound is given in terms of Kraus operators of the quantum\nnoise. This result is then used to analyze the average error correcting\nperformance of codes that are randomly drawn from unitarily invariant code\nensembles. Our results confirm that random codes of sufficiently large block\nsize are highly suitable for quantum error correction. Moreover, employing a\nlemma of Bennett, Shor, Smolin, and Thapliyal, we prove that random coding\nattains information rates of the regularized coherent information.",
    "arxiv_id": "quant-ph/0701102",
    "authors": [
      "Rochus Klesse"
    ],
    "categories": [
      "quant-ph",
      "cond-mat.other"
    ],
    "doi": "10.1103/PhysRevA.75.062315",
    "journal_ref": "Phys. Rev. A 75, 062315 (2007)",
    "title": "Approximate quantum error correction, random codes, and quantum channel   capacity",
    "url": "https://arxiv.org/abs/quant-ph/0701102"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "5cc9142b-d656-43ed-9708-8ea5e73fcf7e",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}