2 Fast 2 Surgery: Fast surgery on QLDPC codes with $\tilde{O}(n(k + d))$ space overhead

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.

arXiv:2610.11079 [quant-ph]

(or arXiv:2610.11079v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2610.11079 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.