{
  "annotation_id": "9a55eae0-6a8f-4659-8797-4fbfd3d237c2",
  "date_created": "2026-03-02T18:02:06.145000Z",
  "date_modified": "2026-03-02T18:02:06.145000Z",
  "file_hash": "84c870cda83390cb90766954174f0144946f3c1ea5a184227ccb3688cf2b4d2e",
  "private": false,
  "record": {
    "abstract": "Using an error models motivated by the Knill, Laflamme, Milburn proposal for\nefficient linear optics quantum computing [Nature 409,46--52, 2001], error rate\nthresholds for erasure errors caused by imperfect photon detectors using a 7\nqubit code are derived and verified through simulation. A novel method -- based\non a Markov chain description of the erasure correction procedure -- is\ndeveloped and used to calculate the recursion relation describing the error\nrate at different encoding levels from which the threshold is derived, matching\nthreshold predictions by Knill, Laflamme and Milburn [quant-ph/0006120, 2000].\nIn particular, the erasure threshold for gate failure rate in the same order as\nthe measurement failure rate is found to be above 1.78%.",
    "arxiv_id": "quant-ph/0405112",
    "authors": [
      "Marcus Silva"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Erasure Thresholds for Efficient Linear Optics Quantum Computation",
    "url": "https://arxiv.org/abs/quant-ph/0405112"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "0ab8c385-6f0e-4bc7-a09b-d68b5002c593",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}