{
  "annotation_id": "1fd5c229-2fc1-42db-8c69-67f7a2e5ce07",
  "date_created": "2026-03-02T18:02:37.244000Z",
  "date_modified": "2026-03-02T18:02:37.244000Z",
  "file_hash": "6e8cad38539d13c301f62780252c0ab8c44b3ba14b732d998d0318b254c85f8e",
  "private": false,
  "record": {
    "abstract": "The quantum threshold theorem shows that a noisy quantum computer can\naccurately and efficiently simulate any ideal quantum computation provided that\nnoise is weakly correlated and its strength is below a critical value known as\nthe quantum accuracy threshold. This thesis provides a simpler and more\ntransparent non-inductive proof of this theorem based on the concept of level\nreduction. This concept is also used in proving the quantum threshold theorem\nfor coherent and leakage noise and for quantum computation by measurements. In\naddition, the proof provides a methodology which allows us to establish\nimproved rigorous lower bounds on the value of the quantum accuracy threshold.",
    "arxiv_id": "quant-ph/0703230",
    "authors": [
      "Panos Aliferis"
    ],
    "categories": [
      "quant-ph"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "Level Reduction and the Quantum Threshold Theorem",
    "url": "https://arxiv.org/abs/quant-ph/0703230"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "2ce4cc87-1d08-49f9-8c99-9bba9618453c",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}