Preprint · 2025 · Open access

Fast surgery for quantum LDPC codes

Nouédyn Baspin, Lucas Berent, Lawrence Z. Cohen

arXiv (Cornell University) · Published 6 October 2025 · DOI 10.48550/arxiv.2510.04521

Open PDFView at the publisherCite this paper

In brief

“Fast surgery for quantum LDPC codes” is a 2025 preprint by Nouédyn Baspin and 2 co-authors, published in arXiv (Cornell University). OpenAlex counts 49 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
49
Most cited in
2026 (43)
References
30
Authors
3

Abstract

Quantum LDPC codes promise significant reductions in physical qubit overhead compared with topological codes. However, many existing constructions for performing logical operations come with distance-dependent temporal overheads. We introduce a scheme for performing generalized surgery on quantum LDPC codes using a constant number of rounds of syndrome measurement. The merged code in our scheme is constructed by taking the total complex of the base code and a suitably chosen homomorphic chain complex. We demonstrate the applicability of our scheme on an example multi-cycle code and assess the performance under a phenomenological noise model, showing that fast surgery performs comparably to standard generalized surgery with multiple rounds. Our results pave the way towards fault-tolerant quantum computing with LDPC codes with both low spatial and temporal overheads.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Baspin, N., Berent, L., & Cohen, L. Z. (2025). Fast surgery for quantum LDPC codes. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2510.04521

MLA 9

Baspin, Nouédyn, et al. “Fast surgery for quantum LDPC codes.” arXiv (Cornell University), 2025. https://doi.org/10.48550/arxiv.2510.04521.

Chicago

Baspin, Nouédyn, Lucas Berent, and Lawrence Z. Cohen. 2025. “Fast surgery for quantum LDPC codes.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2510.04521.

Harvard

Baspin, N., Berent, L. and Cohen, L. Z. (2025) ‘Fast surgery for quantum LDPC codes’, arXiv (Cornell University). doi:10.48550/arxiv.2510.04521.

IEEE

N. Baspin, L. Berent, and L. Z. Cohen, “Fast surgery for quantum LDPC codes,” arXiv (Cornell University), 2025, doi: 10.48550/arxiv.2510.04521.

BibTeX

@misc{baspin2025fast,
  title     = {{Fast surgery for quantum LDPC codes}},
  author    = {Baspin, Nouédyn and Berent, Lucas and Cohen, Lawrence Z.},
  howpublished = {arXiv (Cornell University)},
  year      = {2025},
  doi       = {10.48550/arxiv.2510.04521},
  url       = {https://doi.org/10.48550/arxiv.2510.04521}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture

  • quantum LDPC codes
  • logical operations
  • syndrome measurement
  • fault-tolerant quantum computing

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Baspin, N., Berent, L., & Cohen, L. Z. (2025). Fast surgery for quantum LDPC codes. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2510.04521

How many times has this paper been cited?

49 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.

Who wrote this paper?

Nouédyn Baspin, Lucas Berent, Lawrence Z. Cohen.

What is the DOI of this paper?

10.48550/arxiv.2510.04521, permanently at https://doi.org/10.48550/arxiv.2510.04521. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.