{
  "annotation_id": "6803a722-1695-429e-9374-f9414ca66692",
  "date_created": "2026-03-02T18:02:15.898000Z",
  "date_modified": "2026-03-02T18:02:15.898000Z",
  "file_hash": "5814a576803fea7ee0a1aa3a9366165636dd0be9509b2c30d41844ab070b1898",
  "private": false,
  "record": {
    "abstract": "We consider the problem of fault tolerance in the graph-state model of\nquantum computation. Using the notion of composable simulations, we provide a\nsimple proof for the existence of an accuracy threshold for graph-state\ncomputation by invoking the threshold theorem derived for quantum circuit\ncomputation. Lower bounds for the threshold in the graph-state model are then\nobtained from known bounds in the circuit model under the same noise process.",
    "arxiv_id": "quant-ph/0503130",
    "authors": [
      "Panos Aliferis",
      "Debbie W. Leung"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.73.032308",
    "journal_ref": "Phys. Rev. A 73, 032308 (2006)",
    "title": "Simple proof of fault tolerance in the graph-state model",
    "url": "https://arxiv.org/abs/quant-ph/0503130"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "c8b5b039-2ec4-43e4-aaae-531fdfad3172",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}