{
  "annotation_id": "6802de12-e5ea-4646-897e-12b19b5987d9",
  "date_created": "2026-03-02T18:01:59.541000Z",
  "date_modified": "2026-03-02T18:01:59.541000Z",
  "file_hash": "0c1d25992e257bc8367e56a1dfee654a67a25cadb7fa15ea5c61b93ede7bf2f3",
  "private": false,
  "record": {
    "abstract": "We introduce a convergent iterative algorithm for finding the optimal coding\nand decoding operations for an arbitrary noisy quantum channel. This algorithm\ndoes not require any error syndrome to be corrected completely, and hence also\nfinds codes outside the usual Knill-Laflamme definition of error correcting\ncodes. The iteration is shown to improve the figure of merit \"channel fidelity\"\nin every step.",
    "arxiv_id": "quant-ph/0307138",
    "authors": [
      "M. Reimpell",
      "R. F. Werner"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.94.080501",
    "journal_ref": "Phys. Rev. Lett. 94, 080501 (2005)",
    "title": "Iterative Optimization of Quantum Error Correcting Codes",
    "url": "https://arxiv.org/abs/quant-ph/0307138"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "b5738377-b3e3-410c-8fa9-84f27da409ca",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}