{
  "annotation_id": "73bb5546-8a93-418c-b5f6-60f2a901d283",
  "date_created": "2026-03-02T18:02:24.029000Z",
  "date_modified": "2026-03-02T18:02:24.029000Z",
  "file_hash": "c6ee8774d559d3b072ec28345f0547f15fe602e94ae1b44eb434f1fb1231a113",
  "private": false,
  "record": {
    "abstract": "We present an algorithm to construct quantum circuits for encoding and\ninverse encoding of quantum convolutional codes. We show that any quantum\nconvolutional code contains a subcode of finite index which has a\nnon-catastrophic encoding circuit. Our work generalizes the conditions for\nnon-catastrophic encoders derived in a paper by Ollivier and Tillich\n(quant-ph/0401134) which are applicable only for a restricted class of quantum\nconvolutional codes. We also show that the encoders and their inverses\nconstructed by our method naturally can be applied online, i.e., qubits can be\nsent and received with constant delay.",
    "arxiv_id": "quant-ph/0602129",
    "authors": [
      "Markus Grassl",
      "Martin Roetteler"
    ],
    "categories": [
      "quant-ph",
      "cs.IT",
      "math.IT"
    ],
    "doi": "10.1109/ISIT.2006.261956",
    "journal_ref": "Proceedings 2006 IEEE International Symposium on Information\n  Theory, pp. 1109-1113",
    "title": "Non-catastrophic Encoders and Encoder Inverses for Quantum Convolutional   Codes",
    "url": "https://arxiv.org/abs/quant-ph/0602129"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "acfb7e55-b3e7-494a-9172-96c2fa5bd423",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}