{
  "annotation_id": "753a4c0e-885b-40b0-85a6-92de8170a8d2",
  "date_created": "2026-03-02T18:02:34.488000Z",
  "date_modified": "2026-03-02T18:02:34.488000Z",
  "file_hash": "2f0680ad55b58de8e7d390b694e5159975abb210eae03e2448d73185dcbb573b",
  "private": false,
  "record": {
    "abstract": "A quantum computer -- i.e., a computer capable of manipulating data in\nquantum superposition -- would find applications including factoring, quantum\nsimulation and tests of basic quantum theory. Since quantum superpositions are\nfragile, the major hurdle in building such a computer is overcoming noise.\n  Developed over the last couple of years, new schemes for achieving fault\ntolerance based on error detection, rather than error correction, appear to\ntolerate as much as 3-6% noise per gate -- an order of magnitude better than\nprevious procedures. But proof techniques could not show that these promising\nfault-tolerance schemes tolerated any noise at all.\n  With an analysis based on decomposing complicated probability distributions\ninto mixtures of simpler ones, we rigorously prove the existence of constant\ntolerable noise rates (\"noise thresholds\") for error-detection-based schemes.\nNumerical calculations indicate that the actual noise threshold this method\nyields is lower-bounded by 0.1% noise per gate.",
    "arxiv_id": "quant-ph/0612004",
    "authors": [
      "Ben W. Reichardt"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Error-detection-based quantum fault tolerance against discrete Pauli   noise",
    "url": "https://arxiv.org/abs/quant-ph/0612004"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "55029240-825f-4d54-8134-53f2ea47c0c7",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}