⚛️ quantum physics

Fault-tolerant quantum computation with static atomic buses

This paper proposes a scalable neutral-atom quantum computing architecture utilizing static atomic buses and auxiliary mediator atoms to enable high-fidelity long-range entanglement without qubit transport, achieving significantly lower logical error rates and faster gate times compared to traditional atom-shuttling methods.

Original authors: Matteo Bergonzoni, Laura Pecorari, Sam Norrell, Cody Poole, Guido Pupillo, Mark Saffman

Published 2026-07-07

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Matteo Bergonzoni, Laura Pecorari, Sam Norrell, Cody Poole, Guido Pupillo, Mark Saffman

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to build a massive, incredibly complex library where every book is made of fragile glass. To keep the books safe, you need to constantly check them for cracks (errors) and move them around to fix problems. In the world of quantum computers, these "books" are qubits, and the "cracks" are errors caused by the environment.

For a long time, the leading idea for fixing these errors in neutral-atom quantum computers was to physically pick up the atoms and move them (shuttling) to where they needed to be. Think of this like a librarian constantly running back and forth across a huge library to fetch books. The problem is that every time you run, you get tired (the atoms heat up), and the faster you run, the more likely you are to drop a book (introduce errors). As the library gets bigger, this running becomes slower and more dangerous.

The New Idea: The "Atomic Bus"

This paper proposes a smarter way: Static Atomic Buses. Instead of running the librarian back and forth, imagine building a special "conveyor belt" or a "bridge" made of extra atoms that stay in one place.

Here is how the authors explain it using simple concepts:

The Problem: To fix errors or perform calculations, distant atoms need to "talk" to each other. In the old method, you had to move them close together. In the new method, you want them to talk from far away without moving.
The Solution (The Bus): The authors use a chain of "helper" atoms (mediators) that sit between two distant "worker" atoms. These helpers act like a relay team. The first worker passes a message to the first helper, who passes it to the next, and so on, until it reaches the final worker.
Why it's better: Because the atoms don't have to run, they don't get "hot" or shaky. This keeps the information much safer. The authors call this a "static" architecture because the main workers stay put.

How They Made It Work

The authors didn't just suggest the idea; they designed the exact "instructions" (laser pulses) needed to make these helpers talk to each other perfectly.

The "Flat Road" Trick: One big challenge is that if the atoms wiggle even a tiny bit, the message gets garbled. The authors found a special way to arrange the atoms and choose their energy levels so that the "road" they are talking on is perfectly flat. Even if the atoms wiggle slightly, the message doesn't change. It's like driving on a flat highway versus a bumpy dirt road; on the flat road, a small bump doesn't throw you off course.
The Results: They simulated this system and found that these "bus" gates are incredibly fast (taking only a fraction of a millisecond) and very accurate (99.9% fidelity).

The Big Picture: What This Means for the Computer

The paper compares two types of quantum computers:

The "Runner" (Old Way): Uses atom shuttling. It gets slower and makes more mistakes as the computer gets bigger because of the "heating" from all the running.
The "Bus" (New Way): Uses static atomic buses.

The authors ran massive simulations and found that for the same size computer, the "Bus" method makes 10 times fewer errors than the "Runner" method.

The Library Layout

The paper also explains how to organize this library:

The Memory: They use a special, efficient way to store data (called LDPC codes) that relies on these long-distance "bus" connections to check for errors.
The Processor: For doing complex math, they move the data into a different, simpler layout (Surface Code) where the "bus" helps connect different sections of the code.
The Magic: To make the computer truly powerful (universal), they need "magic states." They suggest a hybrid approach where the main computer stays static, but a small, separate "factory" can move atoms around just to create these magic ingredients. This keeps the main computer cool and quiet while the factory does the heavy lifting.

In Summary

This paper presents a blueprint for a quantum computer that doesn't rely on moving atoms around to fix errors. Instead, it uses a stationary chain of helper atoms to bridge gaps between distant workers. By keeping the atoms still, they avoid the heat and noise that cause errors, resulting in a system that is predicted to be significantly more reliable and faster than current methods that rely on moving atoms.

Technical Summary: Fault-Tolerant Quantum Computation with Static Atomic Buses

Problem Statement
Scalable, fault-tolerant quantum computing (FTQC) requires high-fidelity long-range connectivity to perform logical operations across code blocks and execute syndrome measurements for high-rate quantum error correction (QEC). In neutral-atom platforms, long-range connectivity is traditionally achieved via atom shuttling (transport). However, this approach introduces significant latency scaling as $O(d^{1/3})$ and induces motional heating, leading to dephasing errors that scale as $O(d^{2/3})$ . These effects degrade logical error rates and limit the efficiency of QEC cycles, particularly for high-rate quantum low-density parity-check (qLDPC) codes and transversal logical gates between surface code patches. While direct Rydberg interactions can extend range, they are typically limited to a few tens of micrometers and are highly sensitive to field fluctuations and atomic positions.

Methodology
The authors propose a neutral-atom architecture utilizing static atomic buses, where auxiliary mediator atoms enable long-range entangling operations without transporting the data qubits. The methodology involves a co-design approach integrating microscopic atomic physics with architectural constraints:

Atomic Bus Hamiltonian: The system employs a dual-species architecture (Rubidium and Cesium) to suppress crosstalk. Data atoms and ancilla mediators are arranged in a chain. The dynamics are governed by a Hamiltonian including global laser drives coupling qubit states to Rydberg states and van der Waals (vdW) interactions between atoms.
Optimal Control Design: The authors use Gradient Ascent Pulse Engineering (GRAPE) to design time-optimal laser pulses for Controlled-Z (CZ) gates. The optimization targets:
- Time-optimality: Minimizing gate duration to reduce spontaneous emission errors.
- Robustness: Incorporating constraints to mitigate sensitivity to interaction strength variations caused by thermal motion. This is achieved by selecting specific Rydberg principal quantum numbers ( $n$ ) and lattice spacings ( $r_0$ ) to create locally flat interaction potentials (where $dB/dR \approx 0$ ) at the target separation.
- Disentanglement: Ensuring mediator atoms return to their ground states, fully disentangled from the end qubits.
Architectural Integration: The framework is applied to two primary use cases:
- Transversal Gates: Implementing logical CZ gates between adjacent surface code patches (distance $d$ ).
- Long-Range Stabilizer Readout: Executing non-local stabilizer measurements for high-rate qLDPC codes (La-cross and bivariate bicycle codes).
Simulation and Benchmarking: Large-scale numerical simulations using the Stim simulator and Belief-Propagation with Ordered-Statistics Decoder (BPOSD) are performed. The static bus architecture is benchmarked against an equivalent architecture relying on dynamic atom shuttling, modeling noise sources including spontaneous emission, thermal motion, and shuttling-induced heating.

Key Contributions

Static Bus Architecture: Introduction of a modular framework where long-range entanglement is mediated by static chains of ancilla atoms, eliminating the need for qubit transport during algorithmic operations.
Co-Designed Pulse Protocols: Development of smooth, time-optimal control pulses that achieve high fidelities ( $F \approx 0.999$ ) and durations of a few hundred nanoseconds. These protocols explicitly account for microscopic dynamics and robustness against motional errors.
Support for High-Rate Codes: Demonstration that the architecture natively supports the non-local connectivity required for high-rate qLDPC codes (La-cross and bivariate bicycle), enabling efficient syndrome extraction without the $O(d)$ overhead of lattice surgery or shuttling.
Universal Computation Pathway: Outline of a hybrid approach where static buses handle logical Clifford operations and stabilizer readout, while atom shuttling is restricted to background tasks (qubit reloading and magic state factory routing), thereby decoupling the algorithmic clock from transport latency.

Results

Gate Performance: The authors demonstrate bus-mediated CZ gates with fidelities approaching 99.9% and durations of a few hundred nanoseconds. For surface codes up to distance $d=11$ , gates are achieved with current experimental parameters ( $n \approx 75$ , $r_0 \approx 2.6$ $\mu$ m). Extensions to $d=25$ are shown to be feasible with higher Rydberg states ( $n \approx 95$ ) and tighter spacing ( $r_0 \approx 1.7$ $\mu$ m).
Logical Error Rates: Simulations predict that the static bus architecture yields more than an order-of-magnitude improvement in logical error rates compared to atom-shuttling architectures under realistic noise parameters ( $p \sim 10^{-3}$ ). The improvement is driven by the suppression of motional heating errors, which bottleneck shuttling-based approaches.
Timing Metrics:
- Surface Codes: Logical transversal gate times are predicted at $\sim 100$ $\mu$ s, with QEC cycle times of $\sim 1$ ms for $d \lesssim 12$ .
- La-cross Codes: For $d=7$ codes, the static implementation achieves QEC cycle times of $\sim 255$ –$260$ $\mu$ s, compared to $\sim 1.6$ –$2.0$ ms for shuttling-based implementations (an order-of-magnitude speedup).
- Bivariate Bicycle Codes: The static architecture reduces cycle times by a factor of two compared to motion-based implementations.
Noise Resilience: The use of dual-species encoding and optimized Rydberg states renders the gates intrinsically insensitive to small atomic displacements, suppressing motional infidelity to the spontaneous-emission limit.

Significance and Claims
The paper establishes static atomic buses as a practical, fast, and high-fidelity alternative to atom shuttling for scalable FTQC. By confining active atom transport to background operations (replenishment and resource routing), the architecture effectively eliminates transport-induced latencies and heating from the primary algorithmic clock cycle. The authors claim this work provides the first comprehensive, quantitative assessment of logical performance for a static neutral-atom architecture, demonstrating that it can satisfy the demanding connectivity requirements of universal fault-tolerant quantum computing while significantly outperforming dynamic shuttling approaches in terms of speed and error rates. The results suggest that static buses enable efficient logical memories, Clifford computation, and magic-state distillation, forming a viable pathway toward large-scale quantum computation.

More like this