{
  "annotation_id": "bd782d52-3022-4985-a83f-46995db99b58",
  "date_created": "2026-03-02T18:02:33.971000Z",
  "date_modified": "2026-03-02T18:02:33.971000Z",
  "file_hash": "1514bd832517d32aa3eb9c928dde6167577ad8078858618cb111c31d4d015d06",
  "private": false,
  "record": {
    "abstract": "Qubit loss and gate failure are significant obstacles for the implementation\nof scalable quantum computation. Recently there have been several proposals for\novercoming these problems, including schemes based on parity and cluster\nstates. While effective at dealing with loss and gate failure, these schemes\ntypically lead to a blow-out in effective depolarizing noise rates. In this\nsupplementary paper we present a detailed analysis of this problem and\ntechniques for minimizing it.",
    "arxiv_id": "quant-ph/0701090",
    "authors": [
      "Peter P. Rohde",
      "Timothy C. Ralph",
      "William J. Munro"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Error propagation in loss- and failure-tolerant quantum computation   schemes",
    "url": "https://arxiv.org/abs/quant-ph/0701090"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "8b38e59c-1e52-4ee9-a566-3ae7788e3391",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}