{
  "annotation_id": "798e50e0-d100-475b-9325-e6eb91c64929",
  "date_created": "2026-03-02T18:02:06.808000Z",
  "date_modified": "2026-03-02T18:02:06.808000Z",
  "file_hash": "184a1884e789239c1e46af899cb05fb1d6e6b454f7ca05de50e62a65f8c8cd88",
  "private": false,
  "record": {
    "abstract": "The schemes for fault-tolerant postselected quantum computation given in\n[Knill, Fault-Tolerant Postselected Quantum Computation: Schemes,\nhttp://arxiv.org/abs/quant-ph/0402171] are analyzed to determine their\nerror-tolerance. The analysis is based on computer-assisted heuristics. It\nindicates that if classical and quantum communication delays are negligible,\nthen scalable qubit-based quantum computation is possible with errors above 1%\nper elementary quantum gate.",
    "arxiv_id": "quant-ph/0404104",
    "authors": [
      "E. Knill"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Fault-Tolerant Postselected Quantum Computation: Threshold Analysis",
    "url": "https://arxiv.org/abs/quant-ph/0404104"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "2fc8483c-267e-4beb-b86a-59cee265b25c",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}