{
  "annotation_id": "51a0cc10-2b78-4666-a5e0-0f4675e559c2",
  "date_created": "2026-03-02T18:02:23.727000Z",
  "date_modified": "2026-03-02T18:02:23.727000Z",
  "file_hash": "98f242a443363e6f24131cc5ef7353a4a474cc404be93aeafd338589c22321a2",
  "private": false,
  "record": {
    "abstract": "Trellises play an important theoretical and practical role for classical\ncodes. Their main utility is to devise complexity-efficient error estimation\nalgorithms. Here, we describe trellis representations for quantum stabilizer\ncodes. We show that they share the same properties as their classical analogs.\nIn particular, for any stabilizer code it is possible to find a minimal trellis\nrepresentation. Our construction is illustrated by two fundamental error\nestimation algorithms.",
    "arxiv_id": "quant-ph/0512041",
    "authors": [
      "Harold Ollivier",
      "Jean-Pierre Tillich"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.74.032304",
    "title": "Trellises for stabilizer codes: definition and uses",
    "url": "https://arxiv.org/abs/quant-ph/0512041"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "adc41d4b-64a4-4bd2-b040-e882bd01b558",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}