Cited by 259Quantum Computing Algorithms and ArchitectureQuantum Mechanics and ApplicationsCold Atom Physics and Bose-Einstein Condensates

Quantum walks in optical lattices

Open access
Dür, W., Raussendorf, R., Kendon, V. M., Briegel, H.-J.·2002·Physical Review A

Abstract

We propose an experimental realization of discrete quantum walks using neutral atoms trapped in optical lattices. The quantum walk is taking place in position space and experimental implementation with present-day technology---even using existing setups---seems feasible. We analyze the influence of possible imperfections in the experiment and investigate the transition from a quantum walk to the classical random walk for increasing errors and decoherence.

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.1103/physreva.66.052319

Cites

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

  • Classical random walks in the presence of static disorder still propagate, albeit ultraslowly.

    “Surprisingly, classical random walks for static disorder are still propagating, although ultraslowly[17, 18].”

    From Quantum walks on a random environment (2008) · cites this paper as [17]

  • Random walks in random media, the Sinai walk, lead to ultra slow classical evolution σ2(t) proportional to ln t^4.

    “This is the so-called random random or Sinai walk[17, 18] which leads to ultra slow classical evolution σ 2 ( t ) ∝ ln t 4 , very close to a complete cease.”

    From Quantum walks on a random environment (2008) · cites this paper as [17]

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

Research works printed but not linked: 5

  1. [1]1. ͓1͔ P.W. Shor, in Proceedings of the 35th Annual Symposium on Foundations of Computer Science ͑IEEE Computer Society Press, Los Alamitos, CA, 1994͒, p. 124.
  2. [4]4. ͓4͔ M. Jerrum, A. Sinclair, and E. Vigoda, Proc. 33rd STOC 712 ͑2001͒;
  3. [5]5. R. Motwani and P. Raghavan, Randomized Algorithms ͑Cambridge University Press, Cambridge, UK, 1995͒; U. Scho ¨ning, in Proceedings of the 40th Annual Symposium on Foundations of Computer Science ͑IEEE, New York, 1999͒, pp. 17-19.
  4. [9]9. ͓8͔ A. Ambianis, E. Bach, A. Nayak, A. Vishwanath, and J. Wa- trous, in Proceedings of the 30th Annual ACM Symposium on Theorie of Computing ͑Association for Computing Machinery, New York, 2001͒, pp. 37-49.
  5. [31]31. ͓26͔ D. Polivaev, Master thesis, Ludwig Maximians Universita ¨t Mu ¨nchen, Germany, 2000;

Cited by

Sorted by citations

Authors
Dür, W., Raussendorf, R., Kendon, V. M., & Briegel, H.-J.
Affiliations
  • Ludwig-Maximilians-Universität München (DE)
  • Imperial College London (GB)
Venue
Physical Review A
Published
2002-11-22
Volume
66
Issue
5
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W1512388153
Cited by
259
References
31
Citations by year
2026: 2 · 2025: 2 · 2024: 7 · 2023: 3 · 2022: 7 · 2021: 7 · 2020: 8 · 2019: 10 · 2018: 9 · 2017: 4 · 2016: 6 · 2015: 8 · 2014: 7 · 2013: 12 · 2012: 15
FWCI
17.30
Type
journal article
Language
en
Open access
Locations
  • Physical Review A (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Strathprints: The University of Strathclyde institutional repository (University of Strathclyde) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • European Commission
  • Deutsche Forschungsgemeinschaft
  • Engineering and Physical Sciences Research Council
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Cold Atom Physics and Bose-Einstein Condensates
Keywords
discrete-time quantum walks, optical lattices, neutral atoms, trapped atoms, decoherence, experimental imperfections, classical random walks, quantum-to-classical transition, position space

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