{
  "annotation_id": "b4c6626d-ab63-4a2b-8bf5-1cf9d594f9b4",
  "date_created": "2026-03-02T18:02:34.375000Z",
  "date_modified": "2026-03-02T18:02:34.375000Z",
  "file_hash": "8ca81dbba8e9b79de2e43847eec76e291693301b5da0340e79d948c1e810e871",
  "private": false,
  "record": {
    "abstract": "We describe a fault-tolerant version of the one-way quantum computer using a\ncluster state in three spatial dimensions. Topologically protected quantum\ngates are realized by choosing appropriate boundary conditions on the cluster.\nWe provide equivalence transformations for these boundary conditions that can\nbe used to simplify fault-tolerant circuits and to derive circuit identities in\na topological manner. The spatial dimensionality of the scheme can be reduced\nto two by converting one spatial axis of the cluster into time. The error\nthreshold is 0.75% for each source in an error model with preparation, gate,\nstorage and measurement errors. The operational overhead is poly-logarithmic in\nthe circuit size.",
    "arxiv_id": "quant-ph/0703143",
    "authors": [
      "Robert Raussendorf",
      "Jim Harrington",
      "Kovid Goyal"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1088/1367-2630/9/6/199",
    "journal_ref": "New Journal of Physics 9, 199 (2007)",
    "title": "Topological fault-tolerance in cluster state quantum computation",
    "url": "https://arxiv.org/abs/quant-ph/0703143"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "b23f9cbb-2cc5-4fa9-8ad9-83206b519ded",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}