Cited by 32Quantum Computing Algorithms and ArchitectureCold Atom Physics and Bose-Einstein CondensatesQuantum many-body systems

Solving optimization problems with Rydberg analog quantum computers: Realistic requirements for quantum advantage using noisy simulation and classical benchmarks

Open access
Serret, Michel Fabrice, Marchand, Bertrand, Ayral, Thomas·2020·Physical Review A

Abstract

Platforms of Rydberg atoms have been proposed as promising candidates to solve some combinatorial optimization problems. Here we compute quantitative requirements on the system sizes and noise levels that these platforms must fulfill to reach quantum advantage in approximately solving the Unit-Disk Maximum Independent Set problem. Using noisy simulations of Rydberg platforms of up to 26 atoms interacting through realistic van der Waals interactions, we compute the average approximation ratio that can be attained with a simple quantum annealing-based heuristic within a fixed temporal computational budget. Based on estimates of the correlation lengths measured in the engineered quantum state, we extrapolate the results to large atom numbers and compare them to a simple classical approximation heuristic. We find that approximation ratios of at least $\ensuremath{\approx}0.84$ are within reach for near-future noise levels. Not taking into account further classical and quantum algorithmic improvements, we estimate that quantum advantage could be reached by attaining a number of controlled atoms of $\ensuremath{\sim}8000$ for a time budget of 2 s, and $\ensuremath{\sim}1000--1200$ for a time budget of 0.2 s, provided the coherence levels of the system can be improved by a factor 10 while maintaining a constant repetition rate.

Integrity signals

Registry

Crossref · 10.1103/physreva.102.052617

Cites

6 of 6 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?

  • Some parts of the standard annealing algorithm, such as the initial state |+⊗n or the hard-sphere interaction in the Ising model, are difficult to implement with Rydberg atoms.

    “While some parts of the standard annealing algorithm like the initial state |+ ⊗n or the hard-sphere interaction in the Ising model are difficult to implement with Rydberg atoms [97]”
  • Several algorithmic classes can be used to solve the MIS on a neutral atom platform, such as QAOA, QAA, or variational quantum simulation.

    “There are several algorithmic classes which can be used to solve the MIS on a neutral atom platform, such as the Quantum Approximate Optimisation Algorithm (QAOA), quantum annealing algorithms (QAA) [96], or variational quantum simulation as described in [95,97].”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Serret, M. F., Marchand, B., & Ayral, T.
Affiliations
  • École Polytechnique (FR)
  • Atos (France) (FR)
Venue
Physical Review A
Published
2020-11-23
Volume
102
Issue
5
ISSN
  • 0556-2791 (ISSN-L)
  • 2469-9926
  • 2469-9934
OpenAlex
W3036494108
Cited by
32
References
6
Citations by year
2026: 3 · 2025: 6 · 2024: 4 · 2023: 10 · 2022: 1 · 2021: 6 · 2020: 2
FWCI
1.87
Type
journal article
Language
en
Open access
Locations
  • Physical Review A (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
Horizon 2020 (817482)
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 many-body systems
Keywords
Rydberg atoms, analog quantum computing, quantum advantage, combinatorial optimization, quantum annealing, approximation ratio, van der Waals interactions, correlation length, coherence time

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