{
  "annotation_id": "b7d11958-23a8-45a0-8006-47589487317b",
  "date_created": "2026-03-02T18:02:41.157000Z",
  "date_modified": "2026-03-02T18:02:41.157000Z",
  "file_hash": "83cc0467eb322f74d9f271a2755a1ef757358312b03feeb269097bc15d906fec",
  "private": false,
  "record": {
    "abstract": "The new field of quantum error correction has developed spectacularly since\nits origin less than two years ago. Encoded quantum information can be\nprotected from errors that arise due to uncontrolled interactions with the\nenvironment. Recovery from errors can work effectively even if occasional\nmistakes occur during the recovery procedure. Furthermore, encoded quantum\ninformation can be processed without serious propagation of errors. Hence, an\narbitrarily long quantum computation can be performed reliably, provided that\nthe average probability of error per quantum gate is less than a certain\ncritical value, the accuracy threshold. A quantum computer storing about 10^6\nqubits, with a probability of error per quantum gate of order 10^{-6}, would be\na formidable factoring engine. Even a smaller, less accurate quantum computer\nwould be able to perform many useful tasks. (This paper is based on a talk\npresented at the ITP Conference on Quantum Coherence and Decoherence, 15-18\nDecember 1996.)",
    "arxiv_id": "quant-ph/9705031",
    "authors": [
      "John Preskill"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1098/rspa.1998.0167",
    "journal_ref": "Proc.Roy.Soc.Lond. A454 (1998) 385-410",
    "title": "Reliable Quantum Computers",
    "url": "https://arxiv.org/abs/quant-ph/9705031"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "c1d76018-9636-4c28-8bfa-0682784a24a5",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}