Cited by 51Quantum Computing Algorithms and ArchitectureCold Atom Physics and Bose-Einstein CondensatesQuantum Information and Cryptography

Quantum Optimization via Four-Body Rydberg Gates

Open access
Dlaska, Clemens, Ender, Kilian, Mbeng, Glen Bigan, Kruckenhauser, Andreas, Lechner, Wolfgang, van Bijnen, Rick·2022·Physical Review Letters

Abstract

A large ongoing research effort focuses on obtaining a quantum advantage in the solution of combinatorial optimization problems on near-term quantum devices. A particularly promising platform implementing quantum optimization algorithms are arrays of trapped neutral atoms, laser coupled to highly excited Rydberg states. However, encoding combinatorial optimization problems in atomic arrays is challenging due to limited interqubit connectivity of the native finite-range interactions. Here, we present a four-body Rydberg parity gate, enabling a direct and straightforward implementation of the parity architecture, a scalable architecture for encoding arbitrarily connected interaction graphs. Our gate relies on adiabatic laser pulses and is fully programmable by adjusting two hold times during operation. We numerically demonstrate implementations of the quantum approximate optimization algorithm (QAOA) for small-scale test problems. Variational optimization steps can be implemented with a constant number of system manipulations, paving the way for experimental investigations of QAOA beyond the reach of numerical simulations.

Integrity signals

Registry

Crossref · 10.1103/physrevlett.128.120503

Cites

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

  • This approach can also be used to overcome the limited connectivity of neutral atoms QPUs in the context of gate-based algorithms such as QAOA, enabled by the use of four-body Rydberg gates.

    “This approach can also be used to overcome the limited connectivity of neutral atoms QPUs in the context of gate-based algorithms such as QAOA, enabled e.g., by the use of four-body Rydberg gates [103].”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Dlaska, C., Ender, K., Mbeng, G. B., Kruckenhauser, A., Lechner, W., & van Bijnen, R.
Affiliations
  • Austrian Academy of Sciences (AT)
  • Universität Innsbruck (AT)
Venue
Physical Review Letters
Published
2022-03-24
Volume
128
Issue
12
Pages
120503-120503
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W3172556917
Cited by
51
References
14
Citations by year
2026: 8 · 2025: 11 · 2024: 9 · 2023: 15 · 2022: 7 · 2021: 1
FWCI
3.46
Type
journal article
Language
en
Open access
Locations
  • Physical Review Letters (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Zenodo (CERN European Organization for Nuclear Research) (submittedVersion, cc-by)
  • arXiv (Cornell University)
Funders
  • H2020 European Research Council (817482)
  • Austrian Science Fund (Y1067-N27)
  • Defense Advanced Research Projects Agency (HR001120C0068)
  • SFB BeyondC (F7108-N38)
  • Hauser-Raspe Foundation
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
quantum optimization, Rydberg atoms, combinatorial optimization, trapped neutral atoms, quantum approximate optimization algorithm, variational optimization, quantum advantage

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