Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 100 of the 100 references it cites were found in a registry or an index.

Quantum computing with neutral atoms

Open access

Abstract

The manipulation of neutral atoms by light is at the heart of countless scientific discoveries in the field of quantum physics in the last three decades. The level of control that has been achieved at the single particle level within arrays of optical traps, while preserving the fundamental properties of quantum matter (coherence, entanglement, superposition), makes these technologies prime candidates to implement disruptive computation paradigms. In this paper, we review the main characteristics of these devices from atoms / qubits to application interfaces, and propose a classification of a wide variety of tasks that can already be addressed in a computationally efficient manner in the Noisy Intermediate Scale Quantum\cite{Preskill_NISQ} era we are in. We illustrate how applications ranging from optimization challenges to simulation of quantum systems can be explored either at the digital level (programming gate-based circuits) or at the analog level (programming Hamiltonian sequences). We give evidence of the intrinsic scalability of neutral atom quantum processors in the 100-1,000 qubits range and introduce prospects for universal fault tolerant quantum computing and applications beyond quantum computing.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.22331/q-2020-09-21-327

Cites

100 of 100 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

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?

7 more claims about this paper

Create a free account to see every claim other papers make about this one.

See all claims — free account

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 86 references

Research works printed but not linked: 3

  1. Sylvain de Léséleuc, Sebastian Weber, Vincent Lienhard, Daniel Barredo, Hans Peter Büchler, Thierry Lahaye, and Antoine Browaeys. Accurate mapping of multilevel rydberg atoms on interacting spin-$1/2$ particles for the quantum simulation of ising models. Phys. Rev. Lett., 120: 113602, Mar 2018b. 10.1103/PhysRevLett.120.113602. URL https://link.aps.org/doi/10.1103/PhysRevLett.120.113602. · DOI
  2. Sylvain de Léséleuc, Vincent Lienhard, Pascal Scholl, Daniel Barredo, Sebastian Weber, Nicolai Lang, Hans Peter Büchler, Thierry Lahaye, and Antoine Browaeys. Observation of a symmetry-protected topological phase of interacting bosons with rydberg atoms. Science, 365 (6455): 775–780, 2019b. ISSN 0036-8075. 10.1126/science.aav9105. URL https://science.sciencemag.org/content/365/6455/775. · DOI · Paper page
  3. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences). W. H. Freeman, first edition edition, 1979. ISBN 0716710455. URL http://www.amazon.com/Computers-Intractability-NP-Completeness-Mathematical-Sciences/dp/0716710455.

Cited by

See all 550

Metadata

Authors
Henriet, L., Beguin, L., Signoles, A., Lahaye, T., Browaeys, A., Reymond, G.-O., & Jurczak, C.
Affiliations
  • Pasqal (France) (FR)
  • Pasqal, 2 avenue Augustin Fresnel, 91120 Palaiseau, France
  • Centre National de la Recherche Scientifique (FR)
Venue
Quantum
Published
2020-09-21
Volume
4
Pages
327
ISSN
2521-327X (ISSN-L)
OpenAlex
W3035899097
Cited by
550
References
86
Citations by year
2026: 88 · 2025: 138 · 2024: 116 · 2023: 99 · 2022: 65 · 2021: 39 · 2020: 5
FWCI
20.44
Type
journal article
Language
en
Open access
Locations
  • Quantum (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion, cc-by)
  • HAL (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • arXiv (Cornell University) (cc-by)
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 › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
Keywords
neutral atom quantum computing, optical tweezers, atom arrays, qubits, NISQ devices, quantum optimization, quantum simulation, fault-tolerant quantum computing, scalability

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Quantum computing with neutral atoms. https://app.cochat.ai/papers/10.22331/q-2020-09-21-327
The paper
Henriet, L., Beguin, L., Signoles, A., Lahaye, T., Browaeys, A., Reymond, G.-O., & Jurczak, C. (2020). Quantum computing with neutral atoms. Quantum. https://doi.org/10.22331/q-2020-09-21-327

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.