{
  "annotation_id": "9df92e6e-803b-48e1-a1be-e358de964389",
  "date_created": "2026-03-02T18:02:40.451000Z",
  "date_modified": "2026-03-02T18:02:40.451000Z",
  "file_hash": "a08df3d06f9fd944bb01f3c154a65735c01321227483f759b7dce881370a755b",
  "private": false,
  "record": {
    "abstract": "In order to use quantum error-correcting codes to actually improve the\nperformance of a quantum computer, it is necessary to be able to perform\noperations fault-tolerantly on encoded states. I present a general theory of\nfault-tolerant operations based on symmetries of the code stabilizer. This\nallows a straightforward determination of which operations can be performed\nfault-tolerantly on a given code. I demonstrate that fault-tolerant universal\ncomputation is possible for any stabilizer code. I discuss a number of examples\nin more detail, including the five-qubit code.",
    "arxiv_id": "quant-ph/9702029",
    "authors": [
      "Daniel Gottesman"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.57.127",
    "journal_ref": "Phys.Rev.A57:127,1998",
    "title": "A Theory of Fault-Tolerant Quantum Computation",
    "url": "https://arxiv.org/abs/quant-ph/9702029"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "815bde28-573f-437d-8ead-6541abc63075",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}