{
  "annotation_id": "797a6a06-4af3-4ee8-b35d-adec6121f70d",
  "date_created": "2026-03-02T18:01:46.030000Z",
  "date_modified": "2026-03-02T18:01:46.030000Z",
  "file_hash": "f400476b871810e1a1b4511587d0b45f460ee6d536e6524a6bc0f01fca172025",
  "private": false,
  "record": {
    "abstract": "We study the fault tolerance of quantum computation by adiabatic evolution, a\nquantum algorithm for solving various combinatorial search problems. We\ndescribe an inherent robustness of adiabatic computation against two kinds of\nerrors, unitary control errors and decoherence, and we study this robustness\nusing numerical simulations of the algorithm.",
    "arxiv_id": "quant-ph/0108048",
    "authors": [
      "Andrew M. Childs",
      "Edward Farhi",
      "John Preskill"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.65.012322",
    "journal_ref": "Phys.Rev. A65 (2002) 012322",
    "title": "Robustness of adiabatic quantum computation",
    "url": "https://arxiv.org/abs/quant-ph/0108048"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "df05ee86-4c31-436b-bc7a-287eda4b51c0",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}