Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2510.25982

Enabling Fast and Accurate Neutral Atom Readout through Image Denoising

Chaithanya Naik Mude, Linipun Phuttitarn, Satvik Maurya, Sinha, Kunal, Mark E. Saffman, Swamit Tannu

Published Oct 29, 2025• 4 citations
arXivHTMLPDF

Abstract

Neutral atom quantum computers hold promise for scaling up to hundreds of thousands or more qubits, but their progress is constrained by slow qubit readout. Parallel measurement of qubit arrays currently takes milliseconds, much longer than the underlying quantum gate operations-making readout the primary bottleneck in deploying quantum error correction. Because each round of QEC depends on measurement, long readout times increase cycle duration and slow down program execution. Reducing the readout duration speeds up cycles and reduces decoherence errors that accumulate while qubits idle, but it also lowers the number of collected photons, making measurements noisier and more error-prone. This tradeoff leaves neutral atom systems stuck between slow but accurate readout and fast but unreliable readout. We show that image denoising can resolve this tension. Our framework, GANDALF, uses explicit denoising using image translation to reconstruct clear signals from short, low-photon measurements, enabling reliable classification at up to 1.6x shorter readout times. Combined with lightweight classifiers and a pipelined readout design, our approach both reduces logical error rate by up to 35x and overall QEC cycle time up to 1.77x compared to state-of-the-art convolutional neural network (CNN)-based readout for Cesium (Cs) Neutral Atom arrays.

DOI
10.48550/arxiv.2510.25982

Related papers

Enhanced measurement of neutral-atom qubits with machine learning

Linipun Phuttitarn, B. M. Becker, Ravikumar Chinnarasu +2 more

We demonstrate qubit-state measurements assisted by a supervised convolutional neural network (CNN) in a neutral-atom quantum processor. We present two CNN architectures for analyzing neutral-atom qubit readout data: a compact five-layer single-qubit CNN architecture and a six-layer multiqubit CNN architecture. We benchmark both architectures against a conventional Gaussian-threshold analysis method. In a sparse array (9-$\text{\ensuremath{\mu}}\mathrm{m}$ atom separation) which experiences negligible crosstalk, we have observed up to 32% and 56% error reduction for the multiqubit and single-qubit architectures, respectively, as compared to the benchmark. In a tightly spaced array (5-$\text{\ensuremath{\mu}}\mathrm{m}$ atom separation), which suffers from readout crosstalk, we have observed up to 43% and 32% error reduction in the multiqubit and single-qubit CNN architectures, respectively, as compared to the benchmark. By examining the correlation between the predicted states of neighboring qubits, we have found that the multiqubit CNN architecture reduces the crosstalk correlation by up to 78.5%. This work demonstrates a proof of concept for a CNN network to be implemented as a real-time readout-processing method on a neutral-atom quantum computer, enabling faster readout time and improved fidelity.

arXiv:2311.12217•Physical Review Applied•Aug 5, 2024•13 citations

Fast Nondestructive Readout for High-Clock-Rate Atom Array Quantum Processor

Xu-Zhao-Qiu Zeng, Chang You, Qing-Wei Wang +18 more

Neutral-atom arrays have rapidly advanced to support thousands of qubits and execute high-fidelity logical operations. However, these processors remain severely throttled by their slowest fundamental operation: nondestructive qubit measurement, which requires milliseconds and fundamentally limits the system's clock rate. This bottleneck arises from both an inherent photon-budget dilemma---sufficient fluorescence for reliable state discrimination must be collected without excessive heating or loss---and frame-based imaging, which imposes one common exposure and decision latency on intrinsically independent, site-local measurements. Here, we overcome these limitations with a fast, nondestructive readout architecture based on real-time, site-resolved adaptive protection. By integrating continuous photon counting with a dynamic feedforward framework, we decode qubit states with sub-microsecond latency and instantly shield atoms from redundant scattering. Demonstrated in parallel across a 100-qubit reconfigurable atom array, with adaptive protection on a 25-site subarray, this dynamic decision protocol reduces the average probe time to just $15\ μ\text{s}$. Model-free benchmarking yields a discrimination infidelity of $4.1 \times 10^{-5}$ and an atom loss of $2.1 \times 10^{-4}$, simultaneously setting new performance records for atom arrays. Exploiting this capability, we operate repeated quantum circuits at an unprecedented 1.7 kHz clock rate with atoms reused over 120 consecutive rounds---nearly sevenfold higher than the previous record---and enter the sub-millisecond cycle regime for the first time. By removing nondestructive readout as the dominant cycle-time bottleneck, this work unlocks high-clock-rate mid-circuit syndrome extraction, paving the way for high-throughput, fault-tolerant quantum computation.

quant-pharXiv:2608.17189•Aug 19, 2026•5 citations

Image Denoising via Quantum Reservoir Computing

Soumyadip Das, Luke Antoncich, Jingbo B. Wang

Quantum Reservoir Computing (QRC) leverages the natural dynamics of quantum systems for information processing, without requiring a fault-tolerant quantum computer. In this work, we apply QRC within a hybrid quantum classical framework for image denoising. The quantum reservoir is implemented using a Rydberg atom array, while a classical neural network serves as the readout layer. To prepare the input, images are first compressed using Principal Component Analysis (PCA), reducing their dimensionality to match the size of the atom array. Each feature vector is encoded into local detuning parameters of a time-dependent Hamiltonian governing the Rydberg system. As the system evolves, it generates nonlinear embeddings through the measurement of observables across multiple time steps. These temporal embeddings capture complex correlations, which are fed into a classical neural network to reconstruct the denoised images. To evaluate performance, we compare this QRC-assisted model against a baseline architecture consisting of PCA followed by a dense neural network, trained under identical conditions. Our results show that the QRC-based approach achieves improved image sharpness and similar structural recovery compared to the PCA-based model. We demonstrate the practical viability of this framework through experiments on QuEra's Aquila neutral-atom processor, leveraging its programmable atom arrays to physically realize the reservoir dynamics.

quant-pharXiv:2512.18612•Dec 23, 2025•3 citations

Efficient measurement of neutral-atom qubits with matched filters

Robert M. Kent, Linipun Phuttitarn, Chaithanya Naik Mude +4 more

Quantum computers require high-fidelity measurement of many qubits to achieve a quantum advantage. Traditional approaches suffer from readout crosstalk for a neutral-atom quantum processor with a tightly spaced array. Although classical machine learning algorithms based on convolutional neural networks can improve fidelity, they are computationally expensive, making it difficult to scale them to large qubit counts. We present two simpler and scalable machine learning algorithms that realize matched filters for the readout problem. One is a local model that focuses on a single qubit, and the other uses information from neighboring qubits in the array to prevent crosstalk among the qubits. We demonstrate error reductions of up to 32% and 43% for the site and array models, respectively, compared to a conventional Gaussian threshold approach. Additionally, our array model uses two orders of magnitude fewer trainable parameters and four orders of magnitude fewer multiplications and nonlinear function evaluations than a recent convolutional neural network approach, with only a minor (3.5%) increase in error across different readout times. Another strength of our approach is its physical interpretability: the learned filter can be visualized to provide insights into experimental imperfections. We also show that a convolutional neural network model for improved can be pruned to have 70x and 4000x fewer parameters, respectively, while maintaining similar errors. Our work shows that simple machine learning approaches can achieve high-fidelity qubit measurements while remaining scalable to systems with larger qubit counts.

arXiv:2504.08170•Physical Review Applied•Feb 17, 2026•4 citations

Loss-correcting fault-tolerant quantum computing architecture for neutral atoms

Sanaa Sharma, Yutaka Hirano, Akihisa Goban +3 more

Neutral-atom arrays are a leading qubit technology for large-scale, fault-tolerant quantum computing (FTQC). A dominant error source on this platform is qubit loss, which accrues with every operation and movement. The presence of loss undermines the promises of existing architectural work. Standard error correction targets stochastic Pauli errors and cannot correct loss, so most FTQC performance analyses are not directly compatible with it. Moreover, compilation and routing decisions, which strongly affect overall loss, are typically optimized against Pauli-error cost models and often remain loss-agnostic, potentially increasing exposure to the loss channel. In this work, we comprehensively model the effect of qubit loss on neutral-atom FTQC and develop a loss-tolerant transversal-gate architecture. We treat loss not as a predetermined error parameter but as a dynamic budget spent across a whole program, allowing us to control it by co-designing layout, compilation, and decoding. We target a physical implementation with no separate storage and entangling zones, eliminating the repeated SLM-AOD handoffs and long-distance shuttling that dominate loss in other layouts. We develop compiler optimizations that maximize gate parallelism while respecting the RF tone budget and AOD bandwidth constraints. Our work couples these with a loss-aware, delayed-erasure decoder and an end-to-end loss-aware magic state cultivation protocol. Overall, we improve accumulated loss per syndrome-extraction round by up to 2.15X against a zoned baseline and reduce logical error rates by over two orders of magnitude versus current architectures. Our framework also informs concrete device targets such as continuous reloading rates, AOD counts, and shuttling trajectory choices. We expect these insights to matter for system architects as neutral-atom hardware scales.

quant-pharXiv:2609.10079•Sep 10, 2026•0 citations

Quantum error correction with the toric code

Atom Computing, Collaborators

Quantum computing platforms based on arrays of tweezer-confined neutral atoms have recently emerged as a competitive modality thanks to a direct path toward high qubit count, rapidly advancing operation fidelities, and their ability to execute circuits with arbitrary qubit connectivity. These features will enable the use of efficient error correction schemes with high encoding-rates, time-efficient decoding, and resource-efficient architectures based on transversal gates. With these goals in mind, recent state of the art neutral atom demonstrations focus on the transition from the use of physical qubits to error-corrected logical qubits, but to date there has been no demonstration of repeated error correction scalable to arbitrary depth. Here, we demonstrate many cycles of syndrome extraction in a toric quantum error correcting code, using mid-circuit measurement and replacement of lost qubits, including reloading of a qubit reservoir for indefinite coherent operation. We characterize the logical error rate after up to 90 cycles, showing that logical information can be preserved through multiple rounds of qubit reloading. Comparing two distances of the code up to 8 rounds of syndrome extraction shows a lower absolute logical error rate for the larger distance code.

quant-pharXiv:2606.04079•Jun 3, 2026•24 citations
Neutral atom quantum computers hold promise for scaling up to hundreds of thousands or more qubits, but their progress is constrained by slow qubit readout. Parallel measurement of qubit arrays currently takes milliseconds, much longer than the underlying quantum gate operations-making readout the primary bottleneck in deploying quantum error correction. Because each round of QEC depends on measurement, long readout times increase cycle duration and slow down program execution. Reducing the readout duration speeds up cycles and reduces decoherence errors that accumulate while qubits idle, but it also lowers the number of collected photons, making measurements noisier and more error-prone. This tradeoff leaves neutral atom systems stuck between slow but accurate readout and fast but unreliable readout. We show that image denoising can resolve this tension. Our framework, GANDALF, uses explicit denoising using image translation to reconstruct clear signals from short, low-photon measurements, enabling reliable classification at up to 1.6x shorter readout times. Combined with lightweight classifiers and a pipelined readout design, our approach both reduces logical error rate by up to 35x and overall QEC cycle time up to 1.77x compared to state-of-the-art convolutional neural network (CNN)-based readout for Cesium (Cs) Neutral Atom arrays.
We demonstrate qubit-state measurements assisted by a supervised convolutional neural network (CNN) in a neutral-atom quantum processor. We present two CNN architectures for analyzing neutral-atom qubit readout data: a compact five-layer single-qubit CNN architecture and a six-layer multiqubit CNN architecture. We benchmark both architectures against a conventional Gaussian-threshold analysis method. In a sparse array (9-$\text{\ensuremath{\mu}}\mathrm{m}$ atom separation) which experiences negligible crosstalk, we have observed up to 32% and 56% error reduction for the multiqubit and single-qubit architectures, respectively, as compared to the benchmark. In a tightly spaced array (5-$\text{\ensuremath{\mu}}\mathrm{m}$ atom separation), which suffers from readout crosstalk, we have observed up to 43% and 32% error reduction in the multiqubit and single-qubit CNN architectures, respectively, as compared to the benchmark. By examining the correlation between the predicted states of neighboring qubits, we have found that the multiqubit CNN architecture reduces the crosstalk correlation by up to 78.5%. This work demonstrates a proof of concept for a CNN network to be implemented as a real-time readout-processing method on a neutral-atom quantum computer, enabling faster readout time and improved fidelity.
Neutral-atom arrays have rapidly advanced to support thousands of qubits and execute high-fidelity logical operations. However, these processors remain severely throttled by their slowest fundamental operation: nondestructive qubit measurement, which requires milliseconds and fundamentally limits the system's clock rate. This bottleneck arises from both an inherent photon-budget dilemma---sufficient fluorescence for reliable state discrimination must be collected without excessive heating or loss---and frame-based imaging, which imposes one common exposure and decision latency on intrinsically independent, site-local measurements. Here, we overcome these limitations with a fast, nondestructive readout architecture based on real-time, site-resolved adaptive protection. By integrating continuous photon counting with a dynamic feedforward framework, we decode qubit states with sub-microsecond latency and instantly shield atoms from redundant scattering. Demonstrated in parallel across a 100-qubit reconfigurable atom array, with adaptive protection on a 25-site subarray, this dynamic decision protocol reduces the average probe time to just 15 μs15\ μ\text{s}15 μs. Model-free benchmarking yields a discrimination infidelity of 4.1×10−54.1 \times 10^{-5}4.1×10−5 and an atom loss of 2.1×10−42.1 \times 10^{-4}2.1×10−4, simultaneously setting new performance records for atom arrays. Exploiting this capability, we operate repeated quantum circuits at an unprecedented 1.7 kHz clock rate with atoms reused over 120 consecutive rounds---nearly sevenfold higher than the previous record---and enter the sub-millisecond cycle regime for the first time. By removing nondestructive readout as the dominant cycle-time bottleneck, this work unlocks high-clock-rate mid-circuit syndrome extraction, paving the way for high-throughput, fault-tolerant quantum computation.
Quantum Reservoir Computing (QRC) leverages the natural dynamics of quantum systems for information processing, without requiring a fault-tolerant quantum computer. In this work, we apply QRC within a hybrid quantum classical framework for image denoising. The quantum reservoir is implemented using a Rydberg atom array, while a classical neural network serves as the readout layer. To prepare the input, images are first compressed using Principal Component Analysis (PCA), reducing their dimensionality to match the size of the atom array. Each feature vector is encoded into local detuning parameters of a time-dependent Hamiltonian governing the Rydberg system. As the system evolves, it generates nonlinear embeddings through the measurement of observables across multiple time steps. These temporal embeddings capture complex correlations, which are fed into a classical neural network to reconstruct the denoised images. To evaluate performance, we compare this QRC-assisted model against a baseline architecture consisting of PCA followed by a dense neural network, trained under identical conditions. Our results show that the QRC-based approach achieves improved image sharpness and similar structural recovery compared to the PCA-based model. We demonstrate the practical viability of this framework through experiments on QuEra's Aquila neutral-atom processor, leveraging its programmable atom arrays to physically realize the reservoir dynamics.
Quantum computers require high-fidelity measurement of many qubits to achieve a quantum advantage. Traditional approaches suffer from readout crosstalk for a neutral-atom quantum processor with a tightly spaced array. Although classical machine learning algorithms based on convolutional neural networks can improve fidelity, they are computationally expensive, making it difficult to scale them to large qubit counts. We present two simpler and scalable machine learning algorithms that realize matched filters for the readout problem. One is a local model that focuses on a single qubit, and the other uses information from neighboring qubits in the array to prevent crosstalk among the qubits. We demonstrate error reductions of up to 32% and 43% for the site and array models, respectively, compared to a conventional Gaussian threshold approach. Additionally, our array model uses two orders of magnitude fewer trainable parameters and four orders of magnitude fewer multiplications and nonlinear function evaluations than a recent convolutional neural network approach, with only a minor (3.5%) increase in error across different readout times. Another strength of our approach is its physical interpretability: the learned filter can be visualized to provide insights into experimental imperfections. We also show that a convolutional neural network model for improved can be pruned to have 70x and 4000x fewer parameters, respectively, while maintaining similar errors. Our work shows that simple machine learning approaches can achieve high-fidelity qubit measurements while remaining scalable to systems with larger qubit counts.
Neutral-atom arrays are a leading qubit technology for large-scale, fault-tolerant quantum computing (FTQC). A dominant error source on this platform is qubit loss, which accrues with every operation and movement. The presence of loss undermines the promises of existing architectural work. Standard error correction targets stochastic Pauli errors and cannot correct loss, so most FTQC performance analyses are not directly compatible with it. Moreover, compilation and routing decisions, which strongly affect overall loss, are typically optimized against Pauli-error cost models and often remain loss-agnostic, potentially increasing exposure to the loss channel. In this work, we comprehensively model the effect of qubit loss on neutral-atom FTQC and develop a loss-tolerant transversal-gate architecture. We treat loss not as a predetermined error parameter but as a dynamic budget spent across a whole program, allowing us to control it by co-designing layout, compilation, and decoding. We target a physical implementation with no separate storage and entangling zones, eliminating the repeated SLM-AOD handoffs and long-distance shuttling that dominate loss in other layouts. We develop compiler optimizations that maximize gate parallelism while respecting the RF tone budget and AOD bandwidth constraints. Our work couples these with a loss-aware, delayed-erasure decoder and an end-to-end loss-aware magic state cultivation protocol. Overall, we improve accumulated loss per syndrome-extraction round by up to 2.15X against a zoned baseline and reduce logical error rates by over two orders of magnitude versus current architectures. Our framework also informs concrete device targets such as continuous reloading rates, AOD counts, and shuttling trajectory choices. We expect these insights to matter for system architects as neutral-atom hardware scales.
Quantum computing platforms based on arrays of tweezer-confined neutral atoms have recently emerged as a competitive modality thanks to a direct path toward high qubit count, rapidly advancing operation fidelities, and their ability to execute circuits with arbitrary qubit connectivity. These features will enable the use of efficient error correction schemes with high encoding-rates, time-efficient decoding, and resource-efficient architectures based on transversal gates. With these goals in mind, recent state of the art neutral atom demonstrations focus on the transition from the use of physical qubits to error-corrected logical qubits, but to date there has been no demonstration of repeated error correction scalable to arbitrary depth. Here, we demonstrate many cycles of syndrome extraction in a toric quantum error correcting code, using mid-circuit measurement and replacement of lost qubits, including reloading of a qubit reservoir for indefinite coherent operation. We characterize the logical error rate after up to 90 cycles, showing that logical information can be preserved through multiple rounds of qubit reloading. Comparing two distances of the code up to 8 rounds of syndrome extraction shows a lower absolute logical error rate for the larger distance code.