In neutral atom quantum computers, readout and preparation of the atomic qubits are usually based on fluorescence imaging and subsequent analysis of the acquired image. For each atom site, the brightness or some comparable metric is estimated and used to predict the presence or absence of an atom. Across different setups, we can see a vast number of different approaches used to analyze these images. Often, the choice of detection algorithm is either not mentioned at all or it is not justified. We investigate several different algorithms and compare their performance in terms of both precision and execution run time. To do so, we rely on a set of synthetic images across different simulated exposure times with known occupancy states, which we generated using a previously validated imaging simulation. Since the use of simulation provides us with the ground truth of atom site occupancy, we can easily state precise error rates and variances of the reconstructed property. However, knowing the relative performance of these algorithms is not sufficient to justify their use, since better ones can exist that were not compared. To investigate this possibility, we calculated the Cramer-Rao bound in order to establish an upper limit that even a perfect estimator cannot outperform. As the metric of choice, we used the number of photonelectrons that can be contributed to a specific atom site. Every estimator that reconstructs a different property can simply be scaled accordingly. Since the bound depends on the occupancy of neighboring sites, we provide the best and worst cases, as well as a half filled one, which should represent an averaged bound best. Our comparison shows that of our tested algorithms, a global nonlinear least-squares solver that uses the optical system's point spread function (PSF) to return a global bias and each sites' number of photoelectrons performed the best, on average crossing the worst-case bound for longer exposure times. Its main drawback is its huge computational complexity and, thus, required calculation time. We manage to somewhat reduce this problem, suggesting that its use may be viable, leading us to a novel group of algorithms that present a compromise between speed and precision. However, our study also shows that for cases where utmost speed is required, simple algorithms, like summing up pixel values around atom sites, may be preferable.
Neutral atom quantum computers require accurate single atom detection for the preparation and readout of their qubits. This is usually done using fluorescence imaging. The occupancy of an atom site in these images is often somewhat ambiguous due to the stochastic nature of the imaging process. Further, the lack of ground truth makes it difficult to rate the accuracy of reconstruction algorithms. We introduce a bottom-up simulator that is capable of generating sample images of neutral atom experiments from a description of the actual state in the simulated system. Possible use cases include the creation of exemplary images for demonstration purposes, fast training iterations for deconvolution algorithms, and generation of labeled data for machine-learning-based atom detection approaches. The implementation is available through our GitHub as a C library or wrapped Python package. We show the modeled effects and implementation of the simulations at different stages of the imaging process. Not all real-world phenomena can be reproduced perfectly. The main discrepancies are that the simulator allows for only one characterization of optical aberrations across the whole image, supports only discrete atom locations, and does not model all effects of complementary metal-oxide-semiconductor (CMOS) cameras perfectly. Nevertheless, our experiments show that the generated images closely match real-world pictures to the point that they are practically indistinguishable and can be used as labeled data for training the next generation of detection algorithms.
In recent years, neutral atom quantum computers (NAQCs) have attracted a lot of attention, primarily due to their long coherence times and good scalability. One of their main drawbacks is their comparatively time-consuming control overhead, with one of the main contributing procedures being the detection of individual atoms and measurement of their states, each occurring at least once per compute cycle and requiring fluorescence imaging and subsequent image analysis. To reduce the required time budget, we propose a highly-parallel atom-detection accelerator for tweezer-based NAQCs. Building on an existing solution, our design combines algorithm-level optimization with a field-programmable gate array (FPGA) implementation to maximize parallelism and reduce the run time of the image analysis process. Our design can analyze a 256$\times
256−pixelimagerepresentinga10\times$10 atom array in just 115
μs on a Xilinx UltraScale+ FPGA. Compared to the original CPU baseline and our optimized CPU version, we achieve about 34.9
× and 6.3
× speedup of the reconstruction time, respectively. Moreover, this work also contributes to the ongoing efforts toward fully integrated FPGA-based control systems for NAQCs.
Neutral atom quantum computers (NAQCs) are among the most promising computational platforms for quantum computing. Controlling and measuring individual atoms and their states, which often requires multiple imaging and image-analysis procedures, is typically the most time-consuming task during computation and contributes significantly to overall cycle times. To resolve this challenge, we propose a highly-parallel atom-detection accelerator for tweezer-based NAQCs. Our design builds on an existing state-reconstruction method and combines an algorithm-level optimization with a Field Programmable Gate Array (FPGA) implementation to maximize parallelism and reduce the run time of the image-analysis process. We identify and overcome several challenges for an FPGA implementation, such as introducing a prefetching mechanism to improve scalability and customizing bus transfers to support large bandwidths. Tested on a Xilinx UltraScale+ FPGA, our design can analyze a 256x256-pixel fluorescence image in just 115mus, achieving 34.9x and 6.3x speedups over the original and optimized CPU baseline, respectively. Moreover, our accelerator can maintain consistent resource utilization across various atom array sizes, contributing to the ongoing efforts toward scalable and fully integrated FPGA-based control systems for NAQCs.
In recent years, neutral atom quantum computers (NAQCs) have attracted a lot of attention, primarily due to their long coherence times and good scalability. One of their main drawbacks is their comparatively time-consuming control overhead, with one of the main contributing procedures being the detection of individual atoms and measurement of their states, each occurring at least once per compute cycle and requiring fluorescence imaging and subsequent image analysis.To reduce the required time budget, we propose a highly-parallel atom-detection accelerator for tweezer-based NAQCs. Building on an existing solution, our design combines algorithm-level optimization with a field-programmable gate array (FPGA) implementation to maximize parallelism and reduce the run time of the image analysis process. Our design can analyze a 256×256-pixel image representing a 10×10 atom array in just 115 μs on a Xilinx UltraScale+ FPGA. Compared to the original CPU baseline and our optimized CPU version, we achieve about 34.9× and 6.3× speedup of the reconstruction time, respectively. Moreover, this work also contributes to the ongoing efforts toward fully integrated FPGA-based control systems for NAQCs.
The power of quantum computation derives from algorithmic methods that exploit the availability of quantum superposition and entanglement to perform computations that are intractable with classical devices. The race is on to develop hardware that will unleash the promise of quantum algorithms. A handful of different types of hardware are currently being developed with the greatest efforts directed at superconducting, quantum-dot, trapped-ion, photonic, and neutral-atom approaches [1]. While all approaches have strengths and weaknesses, and are at different stages of development, the challenge of creating a practical design that can be scaled to a million or more qubits has not yet been met with any of the existing platforms. One may wonder if we really need a million qubits for a useful quantum computer. The answer depends on our ambition level. On the one hand it is widely believed that a quantum computer with less than 100 reliable qubits will be able to demonstrate a quantum advantage for a well defined computational problem [2]. Demonstration of a quantum computational advantage will generate great excitement in the halls of academia, but will have little broader import. A problem of great practical interest such as ab initio design of chemicals for increasing the yield of fertilizers for crop production, to name but one example, may also require just a few hundred qubits, provided computational sequences with circuit depth of 1010 or more operations can be reliably performed [3]. However, given the current performance of qubit hardware, which has demonstrated error rates not less than ∼10−3, computations with depth 1010 will only produce random outcomes of negligible value. The solution lies in the construction of error-correction circuitry operating on logical qubits, each composed of many physical qubits, which will enable logical error rates many orders of magnitude smaller than physical error rates. Although error correction is remarkably efficient for classical computing devices—Hamming codes detect and correct errors while only requiring roughly 10% overhead in the number of physical bits—quantum error correction is notoriously expensive. New approaches to error correction are the subject of intensive research with one promising direction being the development of codes that are optimized to suppress the dominant error mechanism in a particular physical platform [4,5]. Nevertheless, with physical error rates of 10−4, a plausible target for current qubit systems, the overhead required to reach logical error rates of 10−10 may be measured in thousands of physical qubits for each logical qubit. Thus a quantum computer able to perform deep calculations on a few hundred logical qubits could require a million physical qubits. A consequence of the cost of quantum error correction is that any viable approach to large-scale quantum computing needs to combine high-fidelity quantum logic operations with a capability for integrating large numbers of physical qubits. From this perspective neutral-atom qubits appear particularly promising [6] as they have already demonstrated control of more qubits than any other platform with recent experiments in 1D [7], 2D [8,9], and 3D [10] geometries showing control of up to 50 atomic qubits. Large qubit arrays can potentially be prepared in 1D, 2D, or 3D geometries. The number of proximal qubits increases with the dimensionality, which is advantageous for implementation of error correction code words, and points towards a preference for 2D or 3D arrays. On the other hand, the added overhead of compensating crosstalk incurred when targeting atoms inside a 3D volume makes parallel operations on multiple qubits challenging. A 2D geometry, as shown schematically in Fig. 1, may be an optimal choice since qubit control and measurement can be performed with lasers propagating normal to the plane of the array so that individual qubit sites can be addressed independently. With demonstrated array periods of a few micrometers we require a footprint of less than 1 mm2 for 104 qubits. Conceptual picture of a 2D neutral-atom qubit array. a) High-numerical-aperture lenses project several different wavelengths of light for control and measurement of the qubits. Specific choices of optical wavelengths depend on the atomic species. Not shown are optics for initial laser cooling, transport to the array, beam scanning, and imaging for qubit measurement. b) Averaged fluorescence image of 49 atomic qubits on a 2D grid with |
3.8μm| spacing [8]. From a fundamental perspective the prospects for scaling neutral-atom systems are particularly promising due to the exceptionally large ratio between coherent and incoherent coupling rates. Neutral-atom qubits are encoded in hyperfine ground states for which coherence times of the order of 10 s have been demonstrated [10]. This implies a dephasing rate |
γ∼0.1s−1|. The coherent coupling that enables quantum logic operations is switched on by exciting atoms to high-lying Rydberg states with principal quantum number close to 100 [11,12]. Rydberg excited atoms at spacings of a few micrometers in an optical lattice interact coherently with rates |
g>109s−1|. The ratio between desired coherent coupling and residual incoherent dephasing of g/γ ∼ 1010 establishes a figure of merit that is enabling for scalability. To our knowledge only trapped ions can claim a similar g/γ ratio [13], but without a correspondingly direct path towards controlling thousands of qubits in a single processing unit. Although the g/γ ratio is exceptionally favorable for neutral-atom qubits a complete set of universal gate operations has not yet been demonstrated with high fidelity. Single-qubit gates in large 2D and 3D arrays have reached fidelity |
F∼0.999| [8,10]. However, the highest demonstrated fidelity for two-qubit entanglement mediated by Rydberg-state interactions is |
F<0.8| [6,14,15], a value that is well short of the theoretical limit of |
F>0.9999| [16,17]. There is healthy optimism within the research community working with neutral-atom qubits that combining improved laser sources with reduced noise, better cooling to reduce motional dephasing, and control of stray electric fields that perturb Rydberg atoms will lead to substantially improved gate fidelity in the near future. Recent results with better filtering of laser phase noise have already demonstrated remarkable improvement in ground–Rydberg entanglement [18]. The outlook for the next few years appears very promising. We anticipate that with advances in lasers, optical lattices for atom trapping, deterministic rearrangement and loading of atoms in multi-dimensional arrays [19,20], and optics for fast beam scanning it will be possible to increase the number of physical qubits in a single neutral-atom module to at least 104. A challenging yet plausible path to a million-qubit processor can then be contemplated by connecting 100 such modules with atom–photon entanglement channels [21]. Beyond the potential for advancing the state of the art in computation, development of techniques for single-atom control inside large multi-atom arrays will enable other applications of quantum science including metrology and time-keeping. Rydberg interactions that are at the heart of a neutral-atom quantum computer may lead to multi-atom entanglement and Heisenberg scaling of atomic-clock precision [22]. This work was supported by the NSF and ARL CDQI.
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.