PreprintarXiv licencearXiv
2 Fast 2 Surgery: Fast surgery on QLDPC codes with Õ(n(k + d)) space overhead
Abstract
We show that the fast surgery framework of Baspin-Berent-Cohen can be instantiated using at most Õ(n(k + d)) ancilla qubits, improving on the previously achievable O(n· k · d) overhead. This result also establishes that fast surgery can be performed at a cost comparable to the Õ(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.
Related
- Lifted surgery: Fast processing with QLDPC codes
- Algorithmic Construction of Gapped Boundaries for Topological Stabilizer Codes: A Route to Low-Overhead Planar qLDPC Codes
- Sipser-Spielman meets Dijkgraaf-Witten: non-Abelian qLDPC codes via twisted sheaf gauge theory and almost-constant-overhead magic state fountain
- Fast computational primitives for La-cross qLDPC codes
- A lower bound on the overhead of addressable surgery on sparse stabiliser codes
BibTeX
@misc{baspin2026fast,
title = {{2 Fast 2 Surgery: Fast surgery on QLDPC codes with $\tildeO(n(k + d))$ space overhead}},
author = {Nouédyn Baspin},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.11079},
eprint = {2610.11079},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.11079},
}
RIS
TY - UNPB
TI - 2 Fast 2 Surgery: Fast surgery on QLDPC codes with Õ(n(k + d)) space overhead
AU - Nouédyn Baspin
PY - 2026
DA - 2026/10/09
PB - arXiv
DO - 10.48550/arxiv.2610.11079
UR - https://arxiv.org/abs/2610.11079
AB - We show that the fast surgery framework of Baspin-Berent-Cohen can be instantiated using at most Õ(n(k + d)) ancilla qubits, improving on the previously achievable O(n· k · d) overhead. This result also establishes that fast surgery can be performed at a cost comparable to the Õ(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.
ER -