Cited by 172Cold Atom Physics and Bose-Einstein CondensatesQuantum Information and CryptographyQuantum Computing Algorithms and Architecture

Quantum computations with atoms in optical lattices: Marker qubits and molecular interactions

Open access
Calarco, T., Dorner, U., Julienne, P. S., Williams, C. J., Zoller, P.·2004·Physical Review A

Abstract

We develop a scheme for quantum computation with neutral atoms, based on the concept of ``marker'' atoms, i.e., auxiliary atoms that can be efficiently transported in state-independent periodic external traps to operate quantum gates between physically distant qubits. This allows for relaxing a number of experimental constraints for quantum computation with neutral atoms in microscopic potential, including single-atom laser addressability. We discuss the advantages of this approach in a concrete physical scenario involving molecular interactions.

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.70.012306

Cites

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?

  • For the spin-chain model, the bound on the minimum transfer time is T_QSL/(N-1) ≥ max{π/(2∆E1); π/(2∆E2)}, which must be satisfied by any H(t) that brings the initial state to the target state in time T.

    “The bound on the minimum transfer time is then given by T QSL / ( N -1) ≥ max { π 2∆ E 1 ; π 2∆ E 2 } , which needs to be satisfied by any H ( t ) that brings | ψ (0) 〉 to the target state | ψ G 〉 in a time T .”

    From Optimal Control at the Quantum Speed Limit (2009) · cites this paper as [6]

Self-check

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

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

The citation lists haven’t been fetched yet

References 41 · Cited by 172

Research works printed but not linked: 2

  1. [20]L.-M. Duan, B. B. Blinov, D. L. Moehring, and C. Monroe (2004), quant-ph/0401020. · arXiv
  2. Flannery, Numerical Recipes in C (Cambridge University Press, Cambridge, 1992), 2nd ed.

Authors
Calarco, T., Dorner, U., Julienne, P. S., Williams, C. J., & Zoller, P.
Affiliations
  • Austrian Academy of Sciences (AT)
  • National Institute of Standards and Technology (US)
Venue
Physical Review A
Published
2004-07-12
Volume
70
Issue
1
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W1978145373
Cited by
172
References
41
Citations by year
2026: 2 · 2025: 2 · 2024: 2 · 2023: 7 · 2022: 2 · 2021: 2 · 2020: 7 · 2019: 1 · 2018: 2 · 2017: 2 · 2016: 7 · 2015: 4 · 2014: 9 · 2013: 5 · 2012: 8
FWCI
10.84
Type
journal article
Language
en
Open access
Locations
  • Physical Review A (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (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 › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
Keywords
quantum computing, neutral atoms, optical lattices, quantum gates, molecular interactions

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