Cited by 256Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum many-body systems

A quantum annealing architecture with all-to-all connectivity from local interactions

Open access
Lechner, Wolfgang, Hauke, Philipp, Zoller, Peter·2015·Science Advances

Abstract

An architecture for adiabatic quantum computing devices, which is programmed by local fields and features all-to-all connectivity.

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1126/sciadv.1500838

Cites

19 of 19 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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?

  • A general proposal for quantum annealing with neutral atom processors utilises the LHZ-scheme, in which the qubits represent the edges of a problem graph, allowing to realise an effective all-to-all connectivity with local Rydberg interactions.

    “A general proposal for quantum annealing with neutral atom processors utilises the socalled LHZ-scheme [101,102], in which the qubits represent the edges of a problem graph, allowing to realise an effective all-to-all connectivity with local Rydberg interactions.”

    From Neutral atom quantum computing hardware: performance and end-user perspective (2023) · cites this paper as [101]

    Split into 2 atoms — 0 confirmed, 2 partially supported, 0 disputed, 0 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.

    Experimental — accuracy not yet measured
  • The LHZ framework can be applied to quantum annealing systems.

    “The same framework can be applied to quantum annealing systems as well (Lechner et al. , 2015).”

    From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Lechner et al., 2015

Self-check

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

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

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Lechner, W., Hauke, P., & Zoller, P.
Affiliations
Austrian Academy of Sciences (AT)
Corresponding author
Lechner, Wolfgang
Venue
Science Advances
Published
2015-10-02
Volume
1
Issue
9
Pages
e1500838-e1500838
ISSN
2375-2548 (ISSN-L)
OpenAlex
W2274114116
Cited by
256
References
19
Citations by year
2026: 15 · 2025: 35 · 2024: 29 · 2023: 32 · 2022: 22 · 2021: 28 · 2020: 28 · 2019: 23 · 2018: 10 · 2017: 19 · 2016: 15
FWCI
14.38
Type
journal article
Language
en
Open access
Licence
cc-by
Locations
  • Science Advances (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • Iris (University of Trento) (submittedVersion, cc-by)
Funders
  • Austrian Science Fund (ID0EXEBG2808, P25454)
  • European Research Council (ID0ETJBG2809, UQUAM)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
Keywords
quantum annealing, all-to-all connectivity, local interactions, Ising model, NP-complete optimization, fault tolerance, redundant encoding, topological quantum memory, lattice gauge theory, long-range interactions, scalable quantum hardware, superconducting qubits, nitrogen-vacancy centers, quantum dots, atomic systems

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