{
  "abstract": "We show that the fast surgery framework of Baspin-Berent-Cohen can be instantiated using at most $\\tilde{O}(n(k + d))$ ancilla qubits, improving on the previously achievable $O(n\\cdot k \\cdot d)$ overhead. This result also establishes that fast surgery can be performed at a cost comparable to the $\\tilde{O}(nk)$ overhead required for regular surgery. We build the surgery ancilla by first starting with a dense, but expanding system; and then applying expansion-preserving sparsification methods from gauging and code embeddings.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.11079",
  "author_total": 1,
  "authors": [
    {
      "name": "Nouédyn Baspin"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/83waj8pnf9a6k.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.11079",
  "fulltext_url": null,
  "id": "83waj8pnf9a6k",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.11079",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7221086691",
  "pdf_url": "https://arxiv.org/pdf/2610.11079",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-09",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/83waj8pnf9a6k.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:28:36Z",
      "native_id": "2610.11079",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.11079"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "2 Fast 2 Surgery: Fast surgery on QLDPC codes with $\\tilde{O}(n(k + d))$ space overhead",
  "title_text": "2 Fast 2 Surgery: Fast surgery on QLDPC codes with Õ(n(k + d)) space overhead",
  "type": "preprint",
  "updated_at": "2026-10-30T12:28:36Z",
  "url": "https://research.draconitic.com/paper/83waj8pnf9a6k",
  "venue": "arXiv",
  "versions": []
}