Metraipolis › archive › dc_2d635d845ee9
Lifted surgery: Fast processing with QLDPC codes — arXiv:2609.11723
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.11723
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T06:43:09.621Z
- SHA-256 of the archived text
f8882ba34800bf69d793d5adce0b702c5c10b2f1d9d72dda5884f31bc767c46b- Stable URL of this page
https://metraipolis.com/documento/dc_2d635d845ee9
How to cite
Lifted surgery: Fast processing with QLDPC codes — arXiv:2609.11723 — arXiv (en), https://arxiv.org/abs/2609.11723 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2d635d845ee9 (Metraipolis archive dc_2d635d845ee9, sha256 f8882ba34800bf69d793d5adce0b702c5c10b2f1d9d72dda5884f31bc767c46b)
BibTeX
@misc{dc2d635d845ee9,
title = {Lifted surgery: Fast processing with QLDPC codes — arXiv:2609.11723},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.11723},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2d635d845ee9; sha256 f8882ba34800bf69d793d5adce0b702c5c10b2f1d9d72dda5884f31bc767c46b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.11723. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Quantum low-density parity-check (QLDPC) codes are a leading candidate for achieving low-overhead fault-tolerant quantum computing. However, the time overhead of logical operations in QLDPC codes remains a key challenge. Code surgery, a space-efficient technique for fault-tolerant logical measurements, incurs this overhead through repeated rounds of syndrome measurement. We introduce lifted surgery, a method for fast and parallel surgery on Abelian group algebra codes that maintains the low physical overhead that makes QLDPC codes attractive. Lifted surgery preserves the symmetries of the underlying code, making searches for large instances tractable and offering a natural route towards efficient hardware implementations. We utilise block decompositions and techniques from commutative algebra to characterise lifted surgery, investigate well-behaved subfamilies, and construct explicit examples. In particular, we present quantum radial codes with parameters $[[90, 8, 10]]$ and $[[198, 8, 16 ]]$ for which surgery is fast, parallel, and addressable, allowing arbitrary sets of independent logical operators of the same Pauli type to be measured in a single round of syndrome extraction. We benchmark lifted surgery under circuit-level depolarising noise and, for the $[[ 90, 8, 10 ]]$ code, find logical performance comparable to standard code surgery while requiring ten times fewer rounds of syndrome measurement. By combining speed and parallelism, lifted surgery offers a practical route towards low-overhead fault-tolerant quantum computing. Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-11 in quant-ph). Categorie arXiv: Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2609.11723 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T06:20:50.308Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).