AtomFlow: An End-to-End FPGA-Based Control Architecture for Neutral Atom Quantum Computers

• URL: http://arxiv.org/abs/2607.11490v1
• Date: Mon, 13 Jul 2026 12:46:46 GMT
• Title: AtomFlow: An End-to-End FPGA-Based Control Architecture for Neutral Atom Quantum Computers
• Abstract summary: AtomFlow consolidates fluorescence-image analysis and a newly developed atom-rearrangement algorithm onto a single Zynq UltraScale+ device.<n>AtomFlow achieves an end-to-end latency of 25.3 ms with a first-move latency of 4 ms and an average move generation of 1 ms.
• Score: 1.8339320861642727
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Neutral Atom Quantum Computing (NAQC) is an emerging modality for scalable quantum computation, valued for its long coherence times and the naturally identical atomic qubits. However, one of the main drawbacks is its slow execution rate, dominated by lengthy classical processing tasks, such as fluorescence imaging, cooling, and atom rearrangement. We address this bottleneck with AtomFlow, a field-programmable gate array (FPGA)-based control architecture that consolidates fluorescence-image analysis and a newly developed atom-rearrangement algorithm onto a single Zynq UltraScale+ device. By co-locating the two stages on the same board and emitting rearrangement moves in a streaming fashion as soon as they are computed, AtomFlow eliminates the round-trip latency of conventional host-mediated pipelines. Evaluated on a 16x16 atom array, AtomFlow achieves an end-to-end latency of 25.3 ms with a first-move latency of 4 ms and an average move generation of 1 ms. Furthermore, our scalability analysis demonstrates that the architecture can readily support larger atom arrays within a single-board resource budget.

Related papers

• Highly-Parallel Atom-Detection Accelerator for Tweezer-Based Neutral Atom Quantum Computers [2.579336620638783]
  Neutral atom quantum computers (NAQCs) are among the most promising computational platforms for quantum computing.<n>We propose a highly-parallel atom-detection accelerator for tweezer-based NAQCs.<n>Our design builds on an existing state-reconstruction method and combines an algorithm-level optimization with a Field Programmable Gate Array (FPGA) implementation.
  arXiv  Detail & Related papers  (2026-04-01T12:24:43Z)
• A Scalable Distributed Quantum Optimization Framework via Factor Graph Paradigm [46.08923284345648]
  We introduce a structure-aware framework for distributed quantum optimization.<n>We find that for a search space of size $N$, our framework achieves $O(sqrtN)$ query complexity up to processors and separator dependent factors.<n>We show that structure-aware decomposition delivers a practical path to scalable distributed quantum optimization on quantum networks.
  arXiv  Detail & Related papers  (2026-03-08T15:15:52Z)
• Efficient Image Reconstruction Architecture for Neutral Atom Quantum Computing [2.579336620638783]
  neutral atom quantum computers (NAQCs) have attracted a lot of attention, primarily due to their long coherence times and good scalability.<n>One of their main drawbacks is their comparatively time-consuming control overhead.<n>We propose a highly-parallel atom-detection accelerator for tweezer-based NAQCs.
  arXiv  Detail & Related papers  (2026-03-03T16:40:24Z)
• ATLAS: Efficient Atom Rearrangement for Defect-Free Neutral-Atom Quantum Arrays Under Transport Loss [46.043413607980845]
  Neutral-atom quantum computers encode qubits in individually trapped atoms arranged in optical lattices.<n>Algorithm converts a randomly loaded $W times W$ lattice into a defect-free $L times L$ subarray.<n>Algorithm achieves sublinear move scaling and linear growth of required initial size with target dimension.
  arXiv  Detail & Related papers  (2025-11-20T12:32:35Z)
• HQViT: Hybrid Quantum Vision Transformer for Image Classification [48.72766405978677]
  We propose a Hybrid Quantum Vision Transformer (HQViT) to accelerate model training while enhancing model performance.<n>HQViT introduces whole-image processing with amplitude encoding to better preserve global image information without additional positional encoding.<n>Experiments across various computer vision datasets demonstrate that HQViT outperforms existing models, achieving a maximum improvement of up to $10.9%$ (on the MNIST 10-classification task) over the state of the art.
  arXiv  Detail & Related papers  (2025-04-03T16:13:34Z)
• Design of an FPGA-Based Neutral Atom Rearrangement Accelerator for Quantum Computing [1.003635085077511]
  Neutral atoms have emerged as a promising technology for implementing quantum computers. We propose a novel quadrant-based rearrangement algorithm that employs a divide-and-conquer strategy and also enables the simultaneous movement of multiple atoms. This is the first hardware acceleration work for atom rearrangement, and it significantly reduces the processing time.
  arXiv  Detail & Related papers  (2024-11-19T10:38:21Z)
• DasAtom: A Divide-and-Shuttle Atom Approach to Quantum Circuit Transformation [2.0861727452345766]
  Neutral atom (NA) quantum systems are emerging as a leading platform for quantum computation.<n>DasAtom is a novel divide-and-shuttle atom approach designed to optimise quantum circuit transformation for NA devices.<n>DasAtom achieves a 414x improvement in fidelity over the move-based algorithm Enola and a 10.6x improvement over the SWAP-based algorithm Tetris.
  arXiv  Detail & Related papers  (2024-09-05T02:23:32Z)
• Atomique: A Quantum Compiler for Reconfigurable Neutral Atom Arrays [19.543879449267372]
  We introduce Atomique, a compilation framework designed for qubit mapping, atom movement, and gate scheduling. Atomique consistently outperforms IBM Superconducting, FAA with long-range gates, and FAA with rectangular and triangular topologies.
  arXiv  Detail & Related papers  (2023-11-25T21:57:41Z)
• Efficient algorithms to solve atom reconfiguration problems. II. The assignment-rerouting-ordering (aro) algorithm [35.300779480388705]
  atom reconfiguration problems require solving an atom problem quickly and efficiently.<n>A typical approach to solve atom reconfiguration problems is to use an assignment algorithm to determine which atoms to move to which traps.<n>This approach does not optimize for the number of displaced atoms or the number of times each atom is displaced.<n>We propose the assignment-rerouting-ordering (aro) algorithm to improve the performance of assignment-based algorithms in solving atom reconfiguration problems.
  arXiv  Detail & Related papers  (2022-12-11T19:48:25Z)
• Efficient algorithms to solve atom reconfiguration problems. I. The redistribution-reconfiguration (red-rec) algorithm [35.300779480388705]
  Red-rec exploits simples and exact subroutines to solve atom reconfiguration problems on grids.<n>Red-rec enables assembling large configurations of atoms with high mean success probability.
  arXiv  Detail & Related papers  (2022-12-07T19:00:01Z)
• A quantum processor based on coherent transport of entangled atom arrays [44.62475518267084]
  We show a quantum processor with dynamic, nonlocal connectivity, in which entangled qubits are coherently transported in a highly parallel manner. We use this architecture to realize programmable generation of entangled graph states such as cluster states and a 7-qubit Steane code state.
  arXiv  Detail & Related papers  (2021-12-07T19:00:00Z)
• 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.