Cited by 867Cold Atom Physics and Bose-Einstein CondensatesQuantum many-body systemsQuantum Computing Algorithms and Architecture

A Rydberg quantum simulator

Open access
Weimer, Hendrik, Müller, Markus, Lesanovsky, Igor, Zoller, Peter, Büchler, Hans Peter·2010·Nature Physics

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.1038/nphys1614

Cites

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

  • Lloyd showed that any local many-body unitary evolution governed by a local Hamiltonian could be implemented by the control afforded by a universal digital quantum computer.

    “Lloyd who showed that any 'local' many-body unitary evolution governed by a 'local' Hamiltonian could be implemented by the control afforded by a universal digital quantum computer [98].”

    From Can one trust quantum simulators? (2012) · cites this paper as [98]

  • A universal digital quantum simulator is perfectly controllable, because a universal set of gates allows sufficient control of the parameters.

    “In accordance with [98], a UDQS is perfectly controllable, i.e., with the help of a universal set of gates sufficient control of the parameters can be achieved.”

    From Can one trust quantum simulators? (2012) · cites this paper as [98]

  • A fault-tolerant implementation of the standard Trotter-expansion approach to digital quantum simulation has an overhead in the number of gates and time required that grows exponentially with the degree of precision required.

    “Indeed, as discussed above, a fault-tolerant implementation of the standard approach based on the Trotter expansion [98] comes at the cost of an overhead in the number of gates and time required that grows exponentially with the degree of precision required [64, 120].”

    From Can one trust quantum simulators? (2012) · cites this paper as [98]

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
Weimer, H., Müller, M., Lesanovsky, I., Zoller, P., & Büchler, H. P.
Affiliations
  • University of Stuttgart (DE)
  • Austrian Academy of Sciences (AT)
Corresponding author
Weimer, Hendrik
Venue
Nature Physics
Published
2010-03-14
Volume
6
Issue
5
Pages
382-388
ISSN
  • 1745-2473 (ISSN-L)
  • 1745-2481
OpenAlex
W2099277972
Cited by
867
References
43
Citations by year
2026: 39 · 2025: 56 · 2024: 54 · 2023: 66 · 2022: 57 · 2021: 57 · 2020: 71 · 2019: 38 · 2018: 53 · 2017: 42 · 2016: 61 · 2015: 47 · 2014: 58 · 2013: 52 · 2012: 50
FWCI
28.82
Type
journal article
Language
en
Open access
Locations
  • Nature Physics (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • 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
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
Keywords
Rydberg atoms, optical lattices, magnetic lattice, many-body interactions, spin systems, toric code, color codes, lattice gauge theory, spin liquid, optical pumping, quantum many-body 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