Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2608.01111

Fault-tolerant quantum computing with a microwave Cat Bus

Yanyan Chen, Xinyang Yu, Yueyang Min, Zhihao Zhang, Shuaifan Cao, Xiaopeng Li

quant-phSubmitted Aug 2, 2026• Announced Aug 4, 2026• 0 citations
arXivHTMLPDF

Abstract

The scalability of fault-tolerant neutral-atom quantum computers is constrained by the latency of shuttling with optical tweezers, imposing a stringent trade-off between qubit overhead and circuit depth in quantum algorithm compilation. Here we propose a hardware-efficient, shuttling-free architecture that achieves all-to-all connectivity. Remote Rydberg atoms are resonantly entangled through a microwave ``Cat Bus''---a cavity mode autonomously stabilized in a bosonic cat state. The Cat Bus natively supports the highly parallelized execution of one-to-many $\mathrm{CZ}^n$ gates with exponentially suppressed crosstalk. We derive the resulting cat--atom error channel from the underlying interactions and physical constraints. For fault-tolerant operation, we develop a hardware-aware scheduling scheme that exploits the native cat--atom $\mathrm{CZ}^{n}$ gate to construct a syndrome-extraction circuit with minimum depth. We benchmark the architecture using hypergraph-product (HGP) codes and estimate a 180-fold reduction in syndrome-extraction cycle time at $N=10^5$ data qubits compared with an atom-rearrangement-based architecture. Under matched two-qubit depolarizing noise, the corresponding error threshold increases from $0.55\%$ to $0.72\%$. Under the hardware-derived error model, we obtain a threshold of $0.80\%$, corresponding to a threshold cooperativity of $C_{\mathrm{th}}=7.8 \times 10^4$, compatible with experimentally accessible parameters for Rydberg-coupled microwave-cavity systems. By avoiding atom transport, the Cat Bus provides a route towards high-speed, fault-tolerant neutral-atom quantum computation.

AI Summary

The paper asks whether cavity-mediated interactions can remove atom-shuttling latency from neutral-atom fault-tolerant computing. It proposes a static atom array coupled to crossed rows and columns of microwave resonators, each stabilized in a bosonic cat manifold. Projecting the resonant atom–cavity interaction into this manifold yields approximately commuting conditional rotations, enabling a native cat–atom $\mathrm{CZ}^n$ gate whose duration is independent of target count at fixed cat amplitude. The analysis derives leading photon-loss and Rydberg-decay channels, with optimized process infidelity $\epsilon_{n,\min}=\pi\sqrt{n/(2C)}$ for cooperativity $C=g^2/(\kappa_1\gamma)$. Assumed parameters give a 142 ns native gate. For hypergraph-product codes, syndrome extraction is compiled through star-based scheduling, with minimum depth within the specified scheduling model determined by a minimum vertex cover. The estimated cycle time scales as $N^{1/2}$ and is 180 times shorter than an atom-rearrangement estimate at $N=10^5$ data qubits. Stabilizer-circuit simulations with BP+OSD decoding give thresholds of approximately $0.72\%$ with cat flags versus $0.55\%$ for rearrangement under matched pairwise depolarizing noise. A hardware-derived stochastic model gives $0.80\%$, mapped to $C_{\mathrm{th}}\approx7.8\times10^4$. These are architectural estimates and quantum-memory simulations, not experimental results. Threshold benchmarks assume ideal single-qubit gates, preparation, measurement and idling, and replace atomic leakage by unheralded depolarizing noise. The channel derivation omits finite-dissipative-gap corrections. Large-code logical failure rates are extrapolated from empirical fits; universal fault-tolerant logical gates remain future work.

Little sign of AI-generated textStrong assumptionsOverclaims

Central claim may not hold: The reported thresholds assume ideal single-qubit gates, preparation, measurement, and idling, so they establish a CZ-limited benchmark rather than a full hardware fault-tolerance threshold. The 0.80% threshold uses independent atomic depolarizing noise in place of the derived leakage channel, leaving its identification with a physical cooperativity threshold unvalidated. The error model omits Rydberg decay during the preparation and return pulses, whose integrated excited-state population adds approximately 35% to the interaction-only decay exposure for the quoted parameters. The 180-fold cycle-time comparison omits atomic check-ancilla preparation and measurement durations without establishing that they are negligible or overlapped. The quoted physical performance relies on strong cat stabilization without a numerical stabilization rate or a bound on the omitted finite-gap errors.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
13+14 pages, 4+6 figures

Related papers

Fault-tolerant quantum computation with static atomic buses

Matteo Bergonzoni, Laura Pecorari, Sam Norrell +3 more

Efficient quantum error correction and fault-tolerant quantum computing require scalable, high-fidelity long-range connectivity. In neutral-atom quantum computers, this is commonly achieved through atom transport, but shuttling introduces latency and motional heating that worsen with system size. Here, we introduce a neutral-atom architecture based on static atomic buses, in which auxiliary mediator atoms enable long-range entangling operations without qubit transport. The architecture naturally supports long-range stabilizer measurements in high-rate LDPC codes and transversal logical gates between neighboring surface-code patches, enabling a modular framework for efficient logical memories, Clifford computation, and magic-state distillation. To realize these capabilities, we co-design optimal-control protocols for bus-mediated controlled-Z gates that incorporate both microscopic neutral-atom dynamics and architectural constraints. We obtain smooth bus-mediated gates with fidelities approaching 99.9% and durations of a few hundred nanoseconds by combining time-optimal control with interaction-flatness and robustness constraints. Large-scale simulations of quantum error correction and logical entangling operations between neighboring surface-code patches predict more than an order-of-magnitude improvement in logical error rates compared with atom-shuttling architectures under realistic noise. The architecture achieves logical gate times of approximately 100 us and quantum-error-correction cycle times of about 1 ms for code distances d<12. These results establish static atomic buses as a practical alternative to atom shuttling for scalable fault-tolerant neutral-atom quantum computing.

quant-pharXiv:2607.02804•PRX Quantum•Jul 6, 2026•2 citations

Neutral Atom Quantum Computing: Principles, Routes, Progress, and Challenges

Junchao Wang, Zeyuan Wang, Lei Li +3 more

Neutral atom quantum computing utilizes laser-trapped neutral atoms as qubits and realizes quantum logic gate operations through Rydberg-state interactions. In recent years, it has become one of the most vibrant directions in quantum computing hardware. This paper systematically reviews the working principles of neutral-atom quantum computers, including qubit encoding, atom trapping and manipulation, Rydberg states and interactions, the Rydberg blockade quantum gate mechanism, and atom rearrangement with reconfigurable architectures. The mainstream technical routes are surveyed, represented by optical tweezer arrays combined with Rydberg interactions, optical lattice schemes, and dipole trap arrays. A panoramic review is provided of domestic and international research progress from theoretical foundations in 2000 to the latest achievements in 2026, including thousand-qubit-scale systems, logical qubits, and quantum error correction experiments. Key breakthroughs are highlighted, such as the 6100-atom qubit array, continuous operation of a 3000-qubit system, quantum simulation of the Kitaev honeycomb model, toric code error correction demonstrations, encoding rates exceeding 1/2, and fault-tolerant architectures. The core bottlenecks are analyzed in depth, including the scalability--fidelity trade-off, engineering implementation of quantum error correction, atom loss and mid-circuit replenishment, laser system industrialization, control electronics scalability, and long-distance quantum interconnection. This paper aims to provide a systematic reference for academic research and technological development in this field.

quant-pharXiv:2608.05010•Aug 6, 2026•2 citations

A Universal Fault-Tolerant Quantum Computing Architecture with Globally Driven Atom Arrays

Zhihao Zhang, Shuaifan Cao, Xinyang Yu +6 more

Scalable quantum computation requires reconciling programmability with simple, high-fidelity control. Here, we propose a universal fault-tolerant architecture using globally driven dual-species atom arrays. In a hybrid neutral-atom system, interspecies Rydberg interactions enable qubit addressability without locally addressed quantum gates. We construct a universal native instruction set, Global Rydberg Atom Instruction Language (GRAIL), and show that crosstalk errors can be suppressed to the $10^{-4}$ level. We compile surface-code error correction and magic state cultivation into GRAIL, and parallelize the compilation to suppress crosstalk. Under a hardware-inferred circuit-level noise model, we obtain an error-correction threshold of $1.43\%$ for the resulting quantum memory and a logical error rate below $10^{-9}$ for magic states cultivated at an experimentally accessible Rydberg Rabi frequency. By replacing local gate addressing with atom-mediated selectivity, this architecture removes the associated calibration requirements, offering a route to simpler control for large-scale fault-tolerant neutral-atom computation.

arXiv:2611.12098•Nov 9, 2026•0 citations

Quantum computing and error correction protocols for atomic quantum processors

David Frederik Locher

State-of-the-art quantum computers are not yet capable of executing large-scale fault-tolerant quantum algorithms. However, experiments in recent years have demonstrated remarkable noisy intermediate-scale and early fault-tolerant quantum computations. To use the existing yet limited hardware most effectively, these protocols are typically tailored to a specific device or hardware platform that comes with certain capabilities but also with individual limitations. This thesis studies quantum protocols suited for near-term atomic quantum processors, i.e., neutral atoms in optical tweezer arrays and trapped ions. One challenge these two platforms have in common is the difficulty of performing mid-circuit measurements. On the other hand, both platforms offer advantages in qubit connectivity and scalability, both of which can be achieved by shuttling atoms or ions. Furthermore, neutral-atom and trapped-ion setups provide native support for multiqubit gates. The protocols explored in this thesis focus on quantum error correction, but also touch on quantum simulation. Concretely, we first investigate quantum autoencoders as a tool for measurement-free quantum error correction in a quantum memory. We propose an experimental implementation of this quantum machine-learning model on a shuttling-based trapped-ion quantum processor to demonstrate that quantum autoencoders can independently identify optimal strategies that combat hardware-specific noise. Secondly, we develop a software toolbox to optimize two- and multiqubit Rydberg gates utilized in neutral-atom quantum processors. We show that multiqubit gates can be useful for achieving good performance and efficient implementations of Floquet and measurement-free fault-tolerant quantum error correction with neutral atoms. Thirdly, we study the feasibility of neutral atoms as a platform for bosonic quantum error correction. We devise blueprints for encoding Gottesman-Kitaev-Preskill qubits in selected motional modes of neutral atoms confined in optical dipole traps and compare the suitability of optical tweezers and optical lattices for this purpose. Finally, we investigate a novel dissipative variational quantum eigen solver that enables the study of ground-state properties of the pure Z-2 lattice gauge theory. We demonstrate that the scheme outperforms established unitary approaches in the presence of circuit-level noise and can be implemented in available neutral-atom quantum processors. Overall, the schemes developed in this work could serve as building blocks for executing elaborate protocols on state-of-the-art atomic quantum processors. Therefore, the results of this thesis contribute to bridging the gap between the theoretical development of protocols for quantum error correction or quantum simulation and their experimental realization.

•Jan 1, 2026•0 citations

Blueprint for a fault-tolerant compound photon-atom quantum architecture

Geva Arwas, Doron Azoury, Daniel Azses +11 more

Fault-tolerant quantum computing requires architectures that simultaneously address scalability, connectivity, and error correction under realistic noise constraints. We present a compound photonic-atomic quantum computing platform that uses cavity QED to realize near-deterministic entangling operations between flying photonic qubits and stationary atomic qubits. Photons provide long-range connectivity and scalability via measurement-based quantum computing (MBQC), while atoms supply reusable, near-deterministic resources for photon generation and entanglement, overcoming the inefficiency of purely photonic platforms. The core primitive is a symmetrized Duan-Kimble photon-atom controlled-phase (CZ) gate, robust to experimental imperfections and high-fidelity. Using single $^{87}$Rb atoms coupled to optical cavities, we give protocols for state preparation, measurement, photon generation, and entangling gates on tens-of-nanosecond timescales, and show how large-scale cluster states with effectively unrestricted connectivity and reduced overhead can be generated through atomic reuse. We analyze fault tolerance on the Raussendorf-Harrington-Goyal (RHG) lattice with a hardware-aware noise model capturing asymmetric loss and correlated photonic-atomic errors. Logical memory simulations yield a photon-loss threshold near $2.6\%$ per physical gate ($\sim$15\% total per trajectory). The full Clifford set -- Hadamard, phase, CNOT -- is implementable transversally or fold-transversally at thresholds matching the identity channel, and we propose two non-Clifford resource-state routes (code teleportation and magic state cultivation) within the foliated cluster-state architecture.

quant-pharXiv:2606.30385•Jun 30, 2026•2 citations

Loss-correcting fault-tolerant quantum computing architecture for neutral atoms

Sanaa Sharma, Yutaka Hirano, Akihisa Goban +3 more

Neutral-atom arrays are a leading qubit technology for large-scale, fault-tolerant quantum computing (FTQC). A dominant error source on this platform is qubit loss, which accrues with every operation and movement. The presence of loss undermines the promises of existing architectural work. Standard error correction targets stochastic Pauli errors and cannot correct loss, so most FTQC performance analyses are not directly compatible with it. Moreover, compilation and routing decisions, which strongly affect overall loss, are typically optimized against Pauli-error cost models and often remain loss-agnostic, potentially increasing exposure to the loss channel. In this work, we comprehensively model the effect of qubit loss on neutral-atom FTQC and develop a loss-tolerant transversal-gate architecture. We treat loss not as a predetermined error parameter but as a dynamic budget spent across a whole program, allowing us to control it by co-designing layout, compilation, and decoding. We target a physical implementation with no separate storage and entangling zones, eliminating the repeated SLM-AOD handoffs and long-distance shuttling that dominate loss in other layouts. We develop compiler optimizations that maximize gate parallelism while respecting the RF tone budget and AOD bandwidth constraints. Our work couples these with a loss-aware, delayed-erasure decoder and an end-to-end loss-aware magic state cultivation protocol. Overall, we improve accumulated loss per syndrome-extraction round by up to 2.15X against a zoned baseline and reduce logical error rates by over two orders of magnitude versus current architectures. Our framework also informs concrete device targets such as continuous reloading rates, AOD counts, and shuttling trajectory choices. We expect these insights to matter for system architects as neutral-atom hardware scales.

quant-pharXiv:2609.10079•Sep 10, 2026•0 citations
The scalability of fault-tolerant neutral-atom quantum computers is constrained by the latency of shuttling with optical tweezers, imposing a stringent trade-off between qubit overhead and circuit depth in quantum algorithm compilation. Here we propose a hardware-efficient, shuttling-free architecture that achieves all-to-all connectivity. Remote Rydberg atoms are resonantly entangled through a microwave ``Cat Bus''---a cavity mode autonomously stabilized in a bosonic cat state. The Cat Bus natively supports the highly parallelized execution of one-to-many CZn\mathrm{CZ}^nCZn gates with exponentially suppressed crosstalk. We derive the resulting cat--atom error channel from the underlying interactions and physical constraints. For fault-tolerant operation, we develop a hardware-aware scheduling scheme that exploits the native cat--atom CZn\mathrm{CZ}^{n}CZn gate to construct a syndrome-extraction circuit with minimum depth. We benchmark the architecture using hypergraph-product (HGP) codes and estimate a 180-fold reduction in syndrome-extraction cycle time at N=105N=10^5N=105 data qubits compared with an atom-rearrangement-based architecture. Under matched two-qubit depolarizing noise, the corresponding error threshold increases from 0.55%0.55\%0.55% to 0.72%0.72\%0.72%. Under the hardware-derived error model, we obtain a threshold of 0.80%0.80\%0.80%, corresponding to a threshold cooperativity of Cth=7.8×104C_{\mathrm{th}}=7.8 \times 10^4Cth​=7.8×104, compatible with experimentally accessible parameters for Rydberg-coupled microwave-cavity systems. By avoiding atom transport, the Cat Bus provides a route towards high-speed, fault-tolerant neutral-atom quantum computation.
The paper asks whether cavity-mediated interactions can remove atom-shuttling latency from neutral-atom fault-tolerant computing. It proposes a static atom array coupled to crossed rows and columns of microwave resonators, each stabilized in a bosonic cat manifold. Projecting the resonant atom–cavity interaction into this manifold yields approximately commuting conditional rotations, enabling a native cat–atom CZn\mathrm{CZ}^nCZn gate whose duration is independent of target count at fixed cat amplitude.
The analysis derives leading photon-loss and Rydberg-decay channels, with optimized process infidelity ϵn,min⁡=πn/(2C)\epsilon_{n,\min}=\pi\sqrt{n/(2C)}ϵn,min​=πn/(2C)​ for cooperativity C=g2/(κ1γ)C=g^2/(\kappa_1\gamma)C=g2/(κ1​γ). Assumed parameters give a 142 ns native gate. For hypergraph-product codes, syndrome extraction is compiled through star-based scheduling, with minimum depth within the specified scheduling model determined by a minimum vertex cover. The estimated cycle time scales as N1/2N^{1/2}N1/2 and is 180 times shorter than an atom-rearrangement estimate at N=105N=10^5N=105 data qubits. Stabilizer-circuit simulations with BP+OSD decoding give thresholds of approximately 0.72%0.72\%0.72% with cat flags versus 0.55%0.55\%0.55% for rearrangement under matched pairwise depolarizing noise. A hardware-derived stochastic model gives 0.80%0.80\%0.80%, mapped to Cth≈7.8×104C_{\mathrm{th}}\approx7.8\times10^4Cth​≈7.8×104.
These are architectural estimates and quantum-memory simulations, not experimental results. Threshold benchmarks assume ideal single-qubit gates, preparation, measurement and idling, and replace atomic leakage by unheralded depolarizing noise. The channel derivation omits finite-dissipative-gap corrections. Large-code logical failure rates are extrapolated from empirical fits; universal fault-tolerant logical gates remain future work.
Efficient quantum error correction and fault-tolerant quantum computing require scalable, high-fidelity long-range connectivity. In neutral-atom quantum computers, this is commonly achieved through atom transport, but shuttling introduces latency and motional heating that worsen with system size. Here, we introduce a neutral-atom architecture based on static atomic buses, in which auxiliary mediator atoms enable long-range entangling operations without qubit transport. The architecture naturally supports long-range stabilizer measurements in high-rate LDPC codes and transversal logical gates between neighboring surface-code patches, enabling a modular framework for efficient logical memories, Clifford computation, and magic-state distillation. To realize these capabilities, we co-design optimal-control protocols for bus-mediated controlled-Z gates that incorporate both microscopic neutral-atom dynamics and architectural constraints. We obtain smooth bus-mediated gates with fidelities approaching 99.9% and durations of a few hundred nanoseconds by combining time-optimal control with interaction-flatness and robustness constraints. Large-scale simulations of quantum error correction and logical entangling operations between neighboring surface-code patches predict more than an order-of-magnitude improvement in logical error rates compared with atom-shuttling architectures under realistic noise. The architecture achieves logical gate times of approximately 100 us and quantum-error-correction cycle times of about 1 ms for code distances d<12. These results establish static atomic buses as a practical alternative to atom shuttling for scalable fault-tolerant neutral-atom quantum computing.
Neutral atom quantum computing utilizes laser-trapped neutral atoms as qubits and realizes quantum logic gate operations through Rydberg-state interactions. In recent years, it has become one of the most vibrant directions in quantum computing hardware. This paper systematically reviews the working principles of neutral-atom quantum computers, including qubit encoding, atom trapping and manipulation, Rydberg states and interactions, the Rydberg blockade quantum gate mechanism, and atom rearrangement with reconfigurable architectures. The mainstream technical routes are surveyed, represented by optical tweezer arrays combined with Rydberg interactions, optical lattice schemes, and dipole trap arrays. A panoramic review is provided of domestic and international research progress from theoretical foundations in 2000 to the latest achievements in 2026, including thousand-qubit-scale systems, logical qubits, and quantum error correction experiments. Key breakthroughs are highlighted, such as the 6100-atom qubit array, continuous operation of a 3000-qubit system, quantum simulation of the Kitaev honeycomb model, toric code error correction demonstrations, encoding rates exceeding 1/2, and fault-tolerant architectures. The core bottlenecks are analyzed in depth, including the scalability--fidelity trade-off, engineering implementation of quantum error correction, atom loss and mid-circuit replenishment, laser system industrialization, control electronics scalability, and long-distance quantum interconnection. This paper aims to provide a systematic reference for academic research and technological development in this field.
Scalable quantum computation requires reconciling programmability with simple, high-fidelity control. Here, we propose a universal fault-tolerant architecture using globally driven dual-species atom arrays. In a hybrid neutral-atom system, interspecies Rydberg interactions enable qubit addressability without locally addressed quantum gates. We construct a universal native instruction set, Global Rydberg Atom Instruction Language (GRAIL), and show that crosstalk errors can be suppressed to the 10−410^{-4}10−4 level. We compile surface-code error correction and magic state cultivation into GRAIL, and parallelize the compilation to suppress crosstalk. Under a hardware-inferred circuit-level noise model, we obtain an error-correction threshold of 1.43%1.43\%1.43% for the resulting quantum memory and a logical error rate below 10−910^{-9}10−9 for magic states cultivated at an experimentally accessible Rydberg Rabi frequency. By replacing local gate addressing with atom-mediated selectivity, this architecture removes the associated calibration requirements, offering a route to simpler control for large-scale fault-tolerant neutral-atom computation.
State-of-the-art quantum computers are not yet capable of executing large-scale fault-tolerant quantum algorithms. However, experiments in recent years have demonstrated remarkable noisy intermediate-scale and early fault-tolerant quantum computations. To use the existing yet limited hardware most effectively, these protocols are typically tailored to a specific device or hardware platform that comes with certain capabilities but also with individual limitations. This thesis studies quantum protocols suited for near-term atomic quantum processors, i.e., neutral atoms in optical tweezer arrays and trapped ions. One challenge these two platforms have in common is the difficulty of performing mid-circuit measurements. On the other hand, both platforms offer advantages in qubit connectivity and scalability, both of which can be achieved by shuttling atoms or ions. Furthermore, neutral-atom and trapped-ion setups provide native support for multiqubit gates. The protocols explored in this thesis focus on quantum error correction, but also touch on quantum simulation. Concretely, we first investigate quantum autoencoders as a tool for measurement-free quantum error correction in a quantum memory. We propose an experimental implementation of this quantum machine-learning model on a shuttling-based trapped-ion quantum processor to demonstrate that quantum autoencoders can independently identify optimal strategies that combat hardware-specific noise. Secondly, we develop a software toolbox to optimize two- and multiqubit Rydberg gates utilized in neutral-atom quantum processors. We show that multiqubit gates can be useful for achieving good performance and efficient implementations of Floquet and measurement-free fault-tolerant quantum error correction with neutral atoms. Thirdly, we study the feasibility of neutral atoms as a platform for bosonic quantum error correction. We devise blueprints for encoding Gottesman-Kitaev-Preskill qubits in selected motional modes of neutral atoms confined in optical dipole traps and compare the suitability of optical tweezers and optical lattices for this purpose. Finally, we investigate a novel dissipative variational quantum eigen solver that enables the study of ground-state properties of the pure Z-2 lattice gauge theory. We demonstrate that the scheme outperforms established unitary approaches in the presence of circuit-level noise and can be implemented in available neutral-atom quantum processors. Overall, the schemes developed in this work could serve as building blocks for executing elaborate protocols on state-of-the-art atomic quantum processors. Therefore, the results of this thesis contribute to bridging the gap between the theoretical development of protocols for quantum error correction or quantum simulation and their experimental realization.
Fault-tolerant quantum computing requires architectures that simultaneously address scalability, connectivity, and error correction under realistic noise constraints. We present a compound photonic-atomic quantum computing platform that uses cavity QED to realize near-deterministic entangling operations between flying photonic qubits and stationary atomic qubits. Photons provide long-range connectivity and scalability via measurement-based quantum computing (MBQC), while atoms supply reusable, near-deterministic resources for photon generation and entanglement, overcoming the inefficiency of purely photonic platforms. The core primitive is a symmetrized Duan-Kimble photon-atom controlled-phase (CZ) gate, robust to experimental imperfections and high-fidelity. Using single 87^{87}87Rb atoms coupled to optical cavities, we give protocols for state preparation, measurement, photon generation, and entangling gates on tens-of-nanosecond timescales, and show how large-scale cluster states with effectively unrestricted connectivity and reduced overhead can be generated through atomic reuse. We analyze fault tolerance on the Raussendorf-Harrington-Goyal (RHG) lattice with a hardware-aware noise model capturing asymmetric loss and correlated photonic-atomic errors. Logical memory simulations yield a photon-loss threshold near 2.6%2.6\%2.6% per physical gate ($\sim$15\% total per trajectory). The full Clifford set -- Hadamard, phase, CNOT -- is implementable transversally or fold-transversally at thresholds matching the identity channel, and we propose two non-Clifford resource-state routes (code teleportation and magic state cultivation) within the foliated cluster-state architecture.
Neutral-atom arrays are a leading qubit technology for large-scale, fault-tolerant quantum computing (FTQC). A dominant error source on this platform is qubit loss, which accrues with every operation and movement. The presence of loss undermines the promises of existing architectural work. Standard error correction targets stochastic Pauli errors and cannot correct loss, so most FTQC performance analyses are not directly compatible with it. Moreover, compilation and routing decisions, which strongly affect overall loss, are typically optimized against Pauli-error cost models and often remain loss-agnostic, potentially increasing exposure to the loss channel. In this work, we comprehensively model the effect of qubit loss on neutral-atom FTQC and develop a loss-tolerant transversal-gate architecture. We treat loss not as a predetermined error parameter but as a dynamic budget spent across a whole program, allowing us to control it by co-designing layout, compilation, and decoding. We target a physical implementation with no separate storage and entangling zones, eliminating the repeated SLM-AOD handoffs and long-distance shuttling that dominate loss in other layouts. We develop compiler optimizations that maximize gate parallelism while respecting the RF tone budget and AOD bandwidth constraints. Our work couples these with a loss-aware, delayed-erasure decoder and an end-to-end loss-aware magic state cultivation protocol. Overall, we improve accumulated loss per syndrome-extraction round by up to 2.15X against a zoned baseline and reduce logical error rates by over two orders of magnitude versus current architectures. Our framework also informs concrete device targets such as continuous reloading rates, AOD counts, and shuttling trajectory choices. We expect these insights to matter for system architects as neutral-atom hardware scales.