Resource Analysis of Low-Overhead Transversal Architectures for Reconfigurable Atom Arrays
arXiv:2505.15907 · doi:10.1145/3695053.3731039
Abstract
Neutral atom arrays have recently emerged as a promising platform for fault-tolerant quantum computing. Based on these advances, including dynamically-reconfigurable connectivity and fast transversal operations, we present a low-overhead architecture that supports the layout and resource estimation of large-scale fault-tolerant quantum algorithms. Utilizing recent advances in fault tolerance with transversal gate operations, this architecture achieves a run time speed-up on the order of the code distance , which we find directly translates to run time improvements of large-scale quantum algorithms. Our architecture consists of functional building blocks of key algorithmic subroutines, including magic state factories, quantum arithmetic units, and quantum look-up tables. These building blocks are implemented using efficient transversal operations, and we design space-time efficient versions of them that minimize interaction distance, thereby reducing atom move times and minimizing the volume for correlated decoding. We further propose models to estimate their logical error performance. We perform resource estimation for a large-scale implementation of Shor's factoring algorithm, one of the prototypical benchmarks for large-scale quantum algorithms, finding that 2048-bit RSA factoring can be executed with 19 million qubits in 5.6 days, for 1 ms QEC cycle times. This represents close to 50 speed-up of the run-time compared to existing estimates with similar assumptions, with no increase in space footprint.
Accepted to ISCA 2025
References in corpus (78)
- Quantum Computing in the NISQ era and beyond
- Surface codes: Towards practical large-scale quantum computation
- Topological quantum memory
- Quantum computational chemistry
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Quantum Error Correction for Quantum Memories
- Suppressing quantum errors by scaling a surface code logical qubit
- Logical quantum processor based on reconfigurable atom arrays
- Hamiltonian Simulation by Qubitization
- Elucidating Reaction Mechanisms on Quantum Computers
- Large Scale Modular Quantum Computer Architecture with Atomic Memory and Photonic Interconnects
- How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
- Parallel implementation of high-fidelity multi-qubit gates with neutral atoms
- Roads towards fault-tolerant universal quantum computation
- Surface code quantum computing by lattice surgery
- Demonstration of the trapped-ion quantum-CCD computer architecture
- Nanophotonic quantum phase switch with a single atom
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- High-fidelity parallel entangling gates on a neutral atom quantum computer
- Restrictions on Transversal Encoded Quantum Gate Sets
- High-threshold and low-overhead fault-tolerant quantum memory
- Exponential suppression of bit or phase flip errors with repetitive error correction
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
- A Race Track Trapped-Ion Quantum Processor
- Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
- Demonstration of fault-tolerant universal quantum gate operations
- Even more efficient quantum computations of chemistry through tensor hypercontraction
- Halving the cost of quantum addition
- Quantum computing enhanced computational catalysis
- High-fidelity gates with mid-circuit erasure conversion in a metastable neutral atom qubit
- Layered architecture for quantum computing
- Decoding Across the Quantum LDPC Code Landscape
- Fast Quantum Modular Exponentiation
- Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization
- Quantum computation with realistic magic state factories
- Ytterbium nuclear-spin qubits in an optical tweezer array
- Unfolding the color code
- Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
- Reliably assessing the electronic structure of cytochrome P450 on today's classical computers and tomorrow's quantum computers
- Assembly and coherent control of a register of nuclear spin qubits
- Universal gate operations on nuclear spin qubits in an optical tweezer array of Yb atoms
- Entanglement transport and a nanophotonic interface for atoms in optical tweezers
- Sparse Blossom: correcting a million errors per core second with minimum-weight matching
- Low-overhead fault-tolerant quantum computing using long-range connectivity
- Mid-circuit cavity measurement in a neutral atom array
- Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules
- A Fault-Tolerant Honeycomb Memory
- Constant-overhead quantum error correction with thin planar connectivity
- The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
- Improved decoding of circuit noise and fragile boundaries of tailored surface codes
- Parallel window decoding enables scalable fault tolerant quantum computation
- Trading T gates for dirty qubits in state preparation and unitary synthesis
- Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits
- Benchmarking and fidelity response theory of high-fidelity Rydberg entangling gates
- Surface code compilation via edge-disjoint paths
- Fast Preparation and Detection of a Rydberg Qubit using Atomic Ensembles
- Quantum algorithms for computing short discrete logarithms and factoring RSA integers
- Low overhead quantum computation using lattice surgery
- Code Deformation and Lattice Surgery Are Gauge Fixing
- Implementing Fault-tolerant Entangling Gates on the Five-qubit Code and the Color Code
- Protected gates for topological quantum field theories
- Transversal Clifford gates on folded surface codes
- Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors
- The Impact of Hardware Specifications on Reaching Quantum Advantage in the Fault Tolerant Regime
- Fast single atom imaging for optical lattice arrays
- A real-time, scalable, fast and highly resource efficient decoder for a quantum computer
- Gauge color codes in two dimensions
- Fault-Tolerant One-Bit Addition with the Smallest Interesting Colour Code
- Constructions and performance of hyperbolic and semi-hyperbolic Floquet codes
- Inplace Access to the Surface Code Y Basis
- Looped Pipelines Enabling Effective 3D Qubit Lattices in a Strictly 2D Device
- Sub-ms, nondestructive, time-resolved quantum-state readout of a single, trapped neutral atom
- Error correction of transversal CNOT gates for scalable surface code computation
- Multi-scale architecture for fast optical addressing and control of large scale qubit arrays
- Modular decoding: parallelizable real-time decoding for quantum computers
- Leveraging Zero-Level Distillation to Generate High-Fidelity Magic States
- Virtualized Logical Qubits: A 2.5D Architecture for Error-Corrected Quantum Computing