{
  "annotation_id": "5c91e64a-6d79-4fe7-aa95-5e9111d3445b",
  "date_created": "2026-03-02T18:02:37.941000Z",
  "date_modified": "2026-03-02T18:02:37.941000Z",
  "file_hash": "a3b3c30e5acd8f69e4f2a60a81a9e930c703edadf6e7691c0e5552e500bec461",
  "private": false,
  "record": {
    "abstract": "We show how, given any set of generators of the stabilizer of a quantum code,\nan efficient gate array that computes the codewords can be constructed. For an\nn-qubit code whose stabilizer has d generators, the resulting gate array\nconsists of O(n d) operations, and converts k-qubit data (where k = n - d) into\nn-qubit codewords.",
    "arxiv_id": "quant-ph/9607030",
    "authors": [
      "Richard Cleve",
      "Daniel Gottesman"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.56.76",
    "title": "Efficient Computations of Encodings for Quantum Error Correction",
    "url": "https://arxiv.org/abs/quant-ph/9607030"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "c8b13c15-a7d7-4428-9944-df778d1642d6",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}