Parsimonious Quantum Low-Density Parity-Check Code Surgery
Abstract
Quantum code surgery offers a flexible, low-overhead framework for executing logical measurements within quantum error-correcting codes. It encompasses several fault-tolerant logical computation schemes, including parallel surgery, universal adapters and fast surgery, and serves as the key primitive in extractor architectures. The efficiency of these schemes crucially depends on constructing low-overhead ancilla systems for measuring arbitrary logical operators in general quantum Low-Density Parity-Check (qLDPC) codes. In this work, we introduce a method to construct an ancilla system of qubit size to measure an arbitrary logical Pauli operator of weight in any qLDPC stabilizer code. This new construction immediately reduces the asymptotic overhead across various quantum code surgery schemes.
Keywords
Cite
@article{arxiv.2603.05082,
title = {Parsimonious Quantum Low-Density Parity-Check Code Surgery},
author = {Andrew C. Yuan and Alexander Cowtan and Zhiyang He and Ting-Chun Lin and Dominic J. Williamson},
journal= {arXiv preprint arXiv:2603.05082},
year = {2026}
}