Fault-tolerant quantum computation with static atomic buses

• URL: http://arxiv.org/abs/2607.02804v1
• Date: Thu, 02 Jul 2026 22:34:55 GMT
• Title: Fault-tolerant quantum computation with static atomic buses
• Abstract summary: Efficient quantum error correction and fault-tolerant quantum computing require high-fidelity long-range connectivity.<n>Here, we introduce a neutral-atom architecture on static atomic buses, in which mediator atoms enable long-range operations without qubit transport.<n>The architecture achieves logical gate times of approximately 100 us and quantum-error- cycle distances of about 1 ms for code d12.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Quantum Random Access Memory Implementation Using Photon-Photon Interaction in Rydberg Atomic Ensemble [0.0]
  Quantum random access memory (qRAM) is crucial for overcoming data-loading bottlenecks in quantum machine learning.<n>Traditional fanout designs demand exponential decoherence-prone gates, while bucket-brigade schemes require highly error-prone active switches.<n>We propose a scalable qRAM architecture that fundamentally replaces active nodes with phase-encoded quantum walkers.
  arXiv  Detail & Related papers  (2026-09-10T10:08:55Z)
• Ultrafast and high resolution spatial light modulation for cold atoms [70.8440518934986]
  We develop and numerically validate a scheme for fully programmable Hubbard models, with time-dependent control over local chemical potentials, tunneling amplitudes, on-site interactions, and patterns of artificial magnetic flux.<n>The same architecture performs fast, arbitrary permutations of tweezers in 2D, decoupling optical constraints from the design of high-rate error-correcting codes.
  arXiv  Detail & Related papers  (2026-08-18T17:56:25Z)
• Quantum-classical crossover in fault-tolerant quantum dynamics simulation [56.198154828333685]
  We introduce a scalable fault-tolerant framework that combines coherent observable estimation with a space-time-efficient implementation of non-Clifford rotations.<n>A benchmark against state-of-the-art tensor-network and variational Monte Carlo algorithms reveals a concrete crossover for mixed-field Ising dynamics.
  arXiv  Detail & Related papers  (2026-07-17T16:54:25Z)
• Blueprint for a fault-tolerant compound photon-atom quantum architecture [26.831715552066694]
  We present a compound photonic-atomic quantum computing platform that uses cavity QED to realize near-deterministic entangling operations.<n> Photons provide long-range connectivity and scalability via measurement-based quantum computing.<n>We show how large-scale cluster states with effectively unrestricted connectivity and reduced overhead can be generated through atomic reuse.
  arXiv  Detail & Related papers  (2026-06-29T14:40:27Z)
• Velocity-Enabled Quantum Computing with Neutral Atoms [0.0]
  We introduce atom velocity as a new degree of freedom in neutral-atom architectures tailored to quantum error correction.<n>By enabling selective operations on continuously moving atoms using only global beams, this velocity-enabled architecture reduces hardware overhead.
  arXiv  Detail & Related papers  (2026-03-16T17:24:15Z)
• Quantum Reverse Mapping: Synthesizing an Optimal Spin Qubit Shuttling Bus Architecture for the Surface Code [1.62107954358883]
  A high-quality encoding allows future compilation techniques to build on optimal or near-optimal layouts.<n>We synthesize a one-dimensional shuttling bus architecture for the rotated surface code, leveraging coherent spin-qubit shuttling.<n>We show that the proposed design can sustain logical error rates as low as $2cdot 10-10$ per round at code distance 21.
  arXiv  Detail & Related papers  (2025-10-20T16:05:36Z)
• Network Requirements for Distributed Quantum Computation [0.0]
  A modular quantum computing architecture, comprising small processors interconnected by quantum links, is emerging as a promising approach to fault-tolerant quantum computing.<n>We consider an architecture tailored for qubits with nearest-neighbor physical connectivity, leveraging the surface code for error correction.<n>We propose measurement teleportation as a tool to extend lattice surgery techniques to qubits located on different computing units interconnected via Bell pairs.
  arXiv  Detail & Related papers  (2025-04-11T18:01:00Z)
• Optimizing quantum gates towards the scale of logical qubits [78.55133994211627]
  A foundational assumption of quantum gates theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance. Here we report on a strategy that can overcome such problems. We demonstrate it by choreographing the frequency trajectories of 68 frequency-tunablebits to execute single qubit while superconducting errors.
  arXiv  Detail & Related papers  (2023-08-04T13:39:46Z)
• Quantum Gate Optimization for Rydberg Architectures in the Weak-Coupling Limit [55.05109484230879]
  We demonstrate machine learning assisted design of a two-qubit gate in a Rydberg tweezer system. We generate optimal pulse sequences that implement a CNOT gate with high fidelity. We show that local control of single qubit operations is sufficient for performing quantum computation on a large array of atoms.
  arXiv  Detail & Related papers  (2023-06-14T18:24:51Z)
• High-fidelity parallel entangling gates on a neutral atom quantum computer [41.74498230885008]
  We report the realization of two-qubit entangling gates with 99.5% fidelity on up to 60 atoms in parallel. These advances lay the groundwork for large-scale implementation of quantum algorithms, error-corrected circuits, and digital simulations.
  arXiv  Detail & Related papers  (2023-04-11T18:00:04Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• Interleaving: Modular architectures for fault-tolerant photonic quantum computing [50.591267188664666]
  Photonic fusion-based quantum computing (FBQC) uses low-loss photonic delays. We present a modular architecture for FBQC in which these components are combined to form "interleaving modules" Exploiting the multiplicative power of delays, each module can add thousands of physical qubits to the computational Hilbert space.
  arXiv  Detail & Related papers  (2021-03-15T18:00:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.