{
  "annotation_id": "96122f3c-c6b9-4ab7-a6fa-aa807446f512",
  "date_created": "2026-03-02T18:02:37.847000Z",
  "date_modified": "2026-03-02T18:02:37.847000Z",
  "file_hash": "bedf84fed1a6b9b650c870f126f9a0b0c031ef0144d3a6c59ab19d989cd38ffe",
  "private": false,
  "record": {
    "abstract": "We prove an accuracy threshold theorem for fault-tolerant quantum computation\nbased on error detection and postselection. Our proof provides a rigorous\nfoundation for the scheme suggested by Knill, in which preparation circuits for\nancilla states are protected by a concatenated error-detecting code and the\npreparation is aborted if an error is detected. The proof applies to\nindependent stochastic noise but (in contrast to proofs of the quantum accuracy\nthreshold theorem based on concatenated error-correcting codes) not to\nstrongly-correlated adversarial noise. Our rigorously established lower bound\non the accuracy threshold, 1.04 \\times 10^{-3}, is well below Knill\u0027s numerical\nestimates.",
    "arxiv_id": "quant-ph/0703264",
    "authors": [
      "Panos Aliferis",
      "Daniel Gottesman",
      "John Preskill"
    ],
    "categories": [
      "quant-ph"
    ],
    "journal_ref": "Quant. Inf. Comput. 8 (2008) 181-244",
    "title": "Accuracy threshold for postselected quantum computation",
    "url": "https://arxiv.org/abs/quant-ph/0703264"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "d7671f69-3d37-42d3-b158-34c822f19378",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}