{
  "annotation_id": "cd60035e-c0e3-4dad-817d-d0e395f06531",
  "date_created": "2026-03-02T18:02:31.250000Z",
  "date_modified": "2026-03-02T18:02:31.250000Z",
  "file_hash": "96d7a3d4250d66b3f462d8df343314f830debabd4de08c6d826639c5cc870804",
  "private": false,
  "record": {
    "abstract": "We show how entanglement shared between encoder and decoder can simplify the\ntheory of quantum error correction. The entanglement-assisted quantum codes we\ndescribe do not require the dual-containing constraint necessary for standard\nquantum error correcting codes, thus allowing us to ``quantize\u0027\u0027 all of\nclassical linear coding theory. In particular, efficient modern classical codes\nthat attain the Shannon capacity can be made into entanglement-assisted quantum\ncodes attaining the hashing bound (closely related to the quantum capacity).\nFor systems without large amounts of shared entanglement, these codes can also\nbe used as catalytic codes, in which a small amount of initial entanglement\nenables quantum communication.",
    "arxiv_id": "quant-ph/0610092",
    "authors": [
      "Todd Brun",
      "Igor Devetak",
      "Min-Hsiu Hsieh"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1126/science.1131563",
    "journal_ref": "Science 314, 436-439 (2006).",
    "title": "Correcting Quantum Errors with Entanglement",
    "url": "https://arxiv.org/abs/quant-ph/0610092"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "f98495a1-001d-409d-94e2-e2354c9d3168",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}