PreprintarXiv licencearXiv
A lower bound on the overhead of addressable surgery on sparse stabiliser codes
Abstract
We show that, for stabilisers codes, there always exists a logical subspace requiring Ω̃(k2) ancillary qubits to be measured with a sparse surgery ancilla. For CSS codes the hard subspace can be taken to be generated by all-X, or all-Z operators. As a result, for codes with large k, constant overhead ancillas can only realise a small fraction of possible measurements.
Related
- Constant Rate Codes with Fully Addressable Transversal T: Good Codes, Sparse Checks
- 2 Fast 2 Surgery: Fast surgery on QLDPC codes with Õ(n(k + d)) space overhead
- A Near-Optimal Joint Lower Bound for Sparse Quantum Linear System Solvers
- Stabiliser codes over prime fields as weighted graphs and as quantum sets of lines
- Coherent errors, syndrome extraction and the Robustness of Magic in stabiliser codes
BibTeX
@misc{baspin2026lower,
title = {{A lower bound on the overhead of addressable surgery on sparse stabiliser codes}},
author = {Nouédyn Baspin},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.11097},
eprint = {2610.11097},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.11097},
}
RIS
TY - UNPB
TI - A lower bound on the overhead of addressable surgery on sparse stabiliser codes
AU - Nouédyn Baspin
PY - 2026
DA - 2026/10/09
PB - arXiv
DO - 10.48550/arxiv.2610.11097
UR - https://arxiv.org/abs/2610.11097
AB - We show that, for stabilisers codes, there always exists a logical subspace requiring Ω̃(k^2) ancillary qubits to be measured with a sparse surgery ancilla. For CSS codes the hard subspace can be taken to be generated by all-X, or all-Z operators. As a result, for codes with large k, constant overhead ancillas can only realise a small fraction of possible measurements.
ER -