CoChat
Sign Up
Cited by 54Quantum Computing Algorithms and ArchitectureCold Atom Physics and Bose-Einstein CondensatesQuantum Information and Cryptography

Universal Neutral-Atom Quantum Computer with Individual Optical Addressing and Nondestructive Readout

Open access
Radnaev, A.G., Chung, W.C., Cole, D.C., Mason, D., Ballance, T.G., Bedalov, M.J., Belknap, D.A., Berman, M.R. +50 more·2025·PRX Quantum
DOI 10.1103/66s8-jj18

Published version of a preprint

Open this paper in CoChat — free account

Abstract

Quantum computers must achieve large-scale fault-tolerant operation to deliver on their promise of transformational processing power. This will require thousands or millions of high-fidelity quantum gates and similar numbers of qubits. Demonstrations using neutral-atom qubits trapped and manipulated by lasers have shown that this modality can provide high two-qubit gate () fidelities and scalable operation. However, the gates in these demonstrations are driven by lasers that do not resolve individual qubits, with universal computation enabled by physical midcircuit shuttling of the qubits. This relatively slow operation may greatly extend run times for useful large-scale computation. Here, we demonstrate a universal neutral-atom quantum computer with gate rates limited by optical switching times, rather than shuttling, by individually addressing tightly focused laser beams at an array of single atoms. We achieve fidelity of 99.35(4)% and local single-qubit R Z gate fidelity of 99.902(8)% in both cases accounting for leakage out of the computational basis. Moreover, we demonstrate nondestructive readout of alkali-atom qubits with 0.9(3)% loss, which boosts operational speed. This technique also enables us to measure a state-of-the-art fidelity of 99.73(3)% when excluding atom-loss events, which may be mitigated through erasure conversion. Our results represent a critical step toward large-scale fault-tolerant neutral-atom quantum computers that can execute computations on practical timescales.

Integrity signals

Registry

Crossref · 10.1103/66s8-jj18

Cites

60 of 60 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Mobile qubit architectures, such as QCCD and optical tweezers, can distribute resources more efficiently than stationary qubit architectures because qubits flow through the QPU like bits in a classical processor.

    “However, mobile qubit architectures, such as QCCD and optical tweezers24,25, can distribute resources more efficiently than stationary qubit architectures26–28, because qubits flow through the QPU like bits in a classical processor, with separated memory structures, data buses and logic units, each optimized for their purpose12.”

    From A 98-qubit trapped-ion quantum computer with all-to-all connectivity (2026) · cites this paper as [27]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Related

Authors
Radnaev, A. G., Chung, W. C., Cole, D. C., Mason, D., Ballance, T. G., Bedalov, M. J., Belknap, D. A., Berman, M. R., Blakely, M., Bloomfield, I. L., Buttler, P. D., Campbell, C., Chopinaud, A., Copenhaver, E., Dawes, M. K., Eubanks, S. Y., Friss, A. J., Garcia, D. M., Gilbert, J., Gillette, M., Goiporia, P., Gokhale, P., Goldwin, J., Goodwin, D., Graham, T. M., Guttormsson, C. J., Hickman, G. T., Hurtley, L., Iliev, M., Jones, E. B., Jones, R. A., Kuper, K. W., Lewis, T. B., Lichtman, M. T., Majdeteimouri, F., Mason, J. J., McMaster, J. K., Miles, J. A., Mitchell, P. T., Murphree, J. D., Neff-Mallon, N. A., Oh, T., Omole, V., Parlo Simon, C., Pederson, N., Perlin, M. A., Reiter, A., Rines, R., Romlow, P., Scott, A. M., Stiefvater, D., Tanner, J. R., Tucker, A. K., Vinogradov, I. V., Warter, M. L., Yeo, M., Saffman, M., & Noel, T. W.
Affiliations
  • ColdQuanta, Inc., DBA Infleqtion (United States) (US)
  • Infleqtion UK
  • University of Wisconsin–Madison (US)
  • Infleqtion
Corresponding author
Radnaev, A.G.
ORCID
Venue
PRX Quantum
Publisher
American Physical Society (APS)
Published
2025-08-25
Volume
6
Issue
3
ISSN
2691-3399 (ISSN-L)
DOI
10.1103/66s8-jj18
OpenAlex
W4412402963
Cited by
54
References
60
Citations by year
2026: 36 · 2025: 17 · 2024: 1
FWCI
21.26
Type
journal article
Language
en
Open access
Licence
Locations
  • PRX Quantum (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • Bristol Research (University of Bristol) (submittedVersion, cc-by)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Cold Atom Physics and Bose-Einstein Condensates
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
Keywords
neutral atom quantum computing, optical addressing, nondestructive readout, single-qubit gate fidelity, two-qubit gate fidelity, atom loss, fault-tolerant quantum computing, scalable quantum processors, alkali atoms

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review