{
  "annotation_id": "79db773b-e8a5-437a-a094-2504335c7bf1",
  "date_created": "2026-03-02T18:02:34.651000Z",
  "date_modified": "2026-03-02T18:02:34.651000Z",
  "file_hash": "eafe38cf19aff1da0d895a4f15f67b999c5ae334300a4005dd9728bb008cca29",
  "private": false,
  "record": {
    "abstract": "Quantum convolutional codes can be used to protect a sequence of qubits of\narbitrary length against decoherence. We introduce two new families of quantum\nconvolutional codes. Our construction is based on an algebraic method which\nallows to construct classical convolutional codes from block codes, in\nparticular BCH codes. These codes have the property that they contain their\nEuclidean, respectively Hermitian, dual codes. Hence, they can be used to\ndefine quantum convolutional codes by the stabilizer code construction. We\ncompute BCH-like bounds on the free distances which can be controlled as in the\ncase of block codes, and establish that the codes have non-catastrophic\nencoders.",
    "arxiv_id": "quant-ph/0703113",
    "authors": [
      "Salah A. Aly",
      "Markus Grassl",
      "Andreas Klappenecker",
      "Martin Roetteler",
      "Pradeep Kiran Sarvepalli"
    ],
    "categories": [
      "quant-ph",
      "cs.IT",
      "math.IT"
    ],
    "doi": "10.1109/CWIT.2007.375730",
    "journal_ref": "Proceedings 2007 Canadian Workshop on Information Theory (CWIT\n  2007), Edmonton, Canada, June 2007, pp. 180-183",
    "title": "Quantum Convolutional BCH Codes",
    "url": "https://arxiv.org/abs/quant-ph/0703113"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "469485cf-989e-4849-a85c-318f5598236d",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}