aiqbench analysis
This research introduces "algebraic surgery" for lifted product codes on neutral-atom processors, enabling parallel logical measurements with constant shuttling depth to reduce space overheads. By co-designing logical operations and atom movement, the protocol achieves a 2x speedup in benchmark cycles compared to traditional graph-based schedules while maintaining competitive qubit efficiency. The work demonstrates that leveraging the algebraic structure of quantum error-correcting codes can significantly simplify physical implementation on reconfigurable hardware.
Parallel algebraic surgery for qLDPC codes with constant shuttling depth
arXiv:2609.39874v1 Announce Type: new Abstract: 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.
Abstract: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.
Quantum Physics (quant-ph); Atomic Physics (physics.atom-ph)
arXiv:2609.39874 [quant-ph]
(or arXiv:2609.39874v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.39874 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 274 words
Related coverage

Caltech and Oratomic Introduce “Mitten” qLDPC Codes for High-Throughput Quantum Computing
Quantum Computing Report · Aug 3, 2026
Lifted surgery: Fast processing with QLDPC codes
arXiv · Sep 11, 2026
Sipser-Spielman meets Dijkgraaf-Witten: non-Abelian qLDPC codes via twisted sheaf gauge theory and almost-constant-overhead magic state fountain
arXiv · Sep 28, 2026
Logical computation with canonical lifted product codes
arXiv · Jul 31, 2026