analiza aiqbench
This paper presents a significant advancement in fault-tolerant quantum computing by introducing a space-time-efficient magic state factory for high-rate qLDPC codes, drastically reducing the overhead required for non-Clifford gate operations. The study combines specific code architectures with an AI-assisted search to identify optimal quadcycle codes, demonstrating practical implementation on neutral-atom platforms that achieve logical error rates as low as $10^{-9}$. These results provide a concrete, end-to-end protocol essential for scaling quantum processors beyond current limitations.
Single-shot magic state factories for quantum LDPC codes
arXiv:2610.10731v1 Announce Type: new Abstract: Quantum low-density parity-check (qLDPC) codes can substantially reduce the qubit overhead of fault-tolerant quantum computation, but any useful architecture based on such codes also requires an efficient mechanism to implement non-Clifford gates in a fault-tolerant manner. We introduce a space-time-efficient magic state factory for high-rate qLDPC codes by combining the transversal non-Clifford gates of recently developed tricycle codes with single-shot four-dimensional balanced product quadcycle codes. The key ingredient is an efficient "escape" mechanism that teleports postselected logical magic states from tricycle codes to larger distance quadcycle codes. Under a standard circuit-level noise model at physical error rate $10^{-3}$, our factories produce $\mathrm{CCZ}$ states at logical error rates as low as $10^{-9}$ with 10-40 times lower space-time cost than state-of-the-art magic state generation methods. The resulting states are directly encoded in high-rate blocks suitable for computation. We identify the quadcycle codes by an AI-assisted search and show that they can serve as excellent memories capable of single-shot error correction. Finally, we present a concrete implementation of the entire factory with highly efficient atom transport on reconfigurable neutral-atom quantum computers. Together, these results provide an end-to-end, practical protocol for producing and utilizing high-fidelity magic states within a high-rate qLDPC architecture, with the lowest space-time cost to date.
Authors:Varun Menon, Rohan Mehta, Andi Gu, Andrei C. Diaconu, Daniel Bochen Tan, Xiao Xiao, Michael J. Gullans, Qian Xu, Hengyun Zhou, Mikhail D. Lukin, J. Pablo Bonilla Ataides
Abstract:Quantum low-density parity-check (qLDPC) codes can substantially reduce the qubit overhead of fault-tolerant quantum computation, but any useful architecture based on such codes also requires an efficient mechanism to implement non-Clifford gates in a fault-tolerant manner. We introduce a space-time-efficient magic state factory for high-rate qLDPC codes by combining the transversal non-Clifford gates of recently developed tricycle codes with single-shot four-dimensional balanced product quadcycle codes. The key ingredient is an efficient "escape" mechanism that teleports postselected logical magic states from tricycle codes to larger distance quadcycle codes. Under a standard circuit-level noise model at physical error rate $10^{-3}$, our factories produce $\mathrm{CCZ}$ states at logical error rates as low as $10^{-9}$ with 10-40 times lower space-time cost than state-of-the-art magic state generation methods. The resulting states are directly encoded in high-rate blocks suitable for computation. We identify the quadcycle codes by an AI-assisted search and show that they can serve as excellent memories capable of single-shot error correction. Finally, we present a concrete implementation of the entire factory with highly efficient atom transport on reconfigurable neutral-atom quantum computers. Together, these results provide an end-to-end, practical protocol for producing and utilizing high-fidelity magic states within a high-rate qLDPC architecture, with the lowest space-time cost to date.
17 main text pages, 6 main figures, Supplementary Information appended. Atom movement animation included in ancillary files
arXiv:2610.10731 [quant-ph]
(or arXiv:2610.10731v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2610.10731 arXiv-issued DOI via DataCite (pending registration)
Text integral sub licența deschisă a publicației · 265 cuvinte
Subiecte conexe

News
Quantum Computing Report · 25 iul. 2026

Breaking the Orthogonality Barrier in Quantum LDPC Codes
Quantum Journal · 9 sept. 2026

Simple logical quantum computation with concatenated symplectic double codes
Quantum Journal · 19 aug. 2026

Zhou’s group’s MIT-Harvard team designs compact quantum error correction codes
Quantum Zeitgeist · 15 oct. 2026