Metraipolis › archive › dc_62140aef0396

Parallel algebraic surgery for qLDPC codes with constant shuttling depth — arXiv:2609.39874

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.39874
License (as archived)
CC0-1.0
Archived
2026-10-07T15:21:44.770Z
SHA-256 of the archived text
bb6eb90646fe554eb46af8554d37e49190fca493f3a3a1391ce0544e39e31334
Stable URL of this page
https://metraipolis.com/documento/dc_62140aef0396

How to cite

Parallel algebraic surgery for qLDPC codes with constant shuttling depth — arXiv:2609.39874 — arXiv (en), https://arxiv.org/abs/2609.39874 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_62140aef0396 (Metraipolis archive dc_62140aef0396, sha256 bb6eb90646fe554eb46af8554d37e49190fca493f3a3a1391ce0544e39e31334)
BibTeX
@misc{dc62140aef0396,
  title = {Parallel algebraic surgery for qLDPC codes with constant shuttling depth — arXiv:2609.39874},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.39874},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_62140aef0396; sha256 bb6eb90646fe554eb46af8554d37e49190fca493f3a3a1391ce0544e39e31334},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.39874. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Reconfigurable atom arrays provide a promising platform for high-rate quantum low-density parity-check codes, but their computational advantage depends on whether logical operations can be implemented without incurring prohibitive shuttling and space overheads. We introduce algebraic surgery for lifted product codes, co-designing the logical measurements, auxiliary codes, and atom shuttling to enable hardware-efficient Pauli-product measurements. These protocols provide flexible logical addressability subject to the cyclic-symmetry constraint, enabling a broad class of parallel logical measurements, including canonical logical operators with heavily overlapping physical supports and joint measurements within or between code blocks even with different lift sizes, while achieving constant shuttling depth on neutral-atom processors under explicit layout assumptions. In a representative hardware-model benchmark, a cycle supporting 33 parallel canonical logical measurements is about $2\times$ faster than the compared single-observable graph-based surgery schedules, with competitive qubit overhead. These shuttling and circuit-level simulations confirm that the algebraic structure of quantum low-density parity-check codes can be used not only to reduce space overhead, but also to simplify physical implementation and expand the set of efficiently accessible logical operations on neutral-atom processors.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-10-01 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph) ; Atomic Physics (physics.atom-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.39874 — 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-07T14:53:56.746Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).