{
  "annotation_id": "1b9d658d-dfde-4adb-b25b-05d56d1c680c",
  "date_created": "2026-03-02T18:02:27.409000Z",
  "date_modified": "2026-03-02T18:02:27.409000Z",
  "file_hash": "eb34472d26c7dc2378bf17bb219456dfad5c4c2265110156ea0c2c9eacf3dba3",
  "private": false,
  "record": {
    "abstract": "How important is fast measurement for fault-tolerant quantum computation?\nUsing a combination of existing and new ideas, we argue that measurement times\nas long as even 1,000 gate times or more have a very minimal effect on the\nquantum accuracy threshold. This shows that slow measurement, which appears to\nbe unavoidable in many implementations of quantum computing, poses no essential\nobstacle to scalability.",
    "arxiv_id": "quant-ph/0607047",
    "authors": [
      "David P. DiVincenzo",
      "Panos Aliferis"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.98.020501",
    "journal_ref": "Phys. Rev. Lett. 98 (2007) 220501",
    "title": "Effective fault-tolerant quantum computation with slow measurements",
    "url": "https://arxiv.org/abs/quant-ph/0607047"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "b526b897-8bbf-4aff-a04d-19cc74ffbe80",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}