CoChat
Sign Up
Cited by 1,586Cold Atom Physics and Bose-Einstein CondensatesQuantum Information and CryptographyQuantum Computing Algorithms and Architecture

Demonstration of a Fundamental Quantum Logic Gate

Open access
Monroe, C., Meekhof, D. M., King, B. E., Itano, W. M., Wineland, D. J.·1995·Physical Review Letters
DOI 10.1103/physrevlett.75.4714
Open this paper in CoChat — free accountOpen PDF

Abstract

We demonstrate the operation of a two-bit "controlled-NOT" quantum logic gate, which, in conjunction with simple single-bit operations, forms a universal quantum logic gate for quantum computation. The two quantum bits are stored in the internal and external degrees of freedom of a single trapped atom, which is first laser cooled to the zero-point energy. Decoherence effects are identified for the operation, and the possibility of extending the system to more qubits appears promising.

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/physrevlett.75.4714

Cites

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

  • Prototype quantum computers that store and process information on individual atoms have already been demonstrated.

    “Although an Avogadro scale computer that can act on 10 23 bits might seem implausible, prototype quantum computers that store and process information on individual atoms have already been demonstrated 64 -65 , 76 -80 .”

    From Ultimate physical limits to computation (2000) · cites this paper as [65]

  • Recently constructed quantum microcomputers use one quantum degree of freedom for each bit and operate at the Heisenberg limit Δt = π hbar/2ΔE for the time needed to flip a bit.

    “The laws of physics do not require redundancy to perform logical operations: recently constructed quantum microcomputers use one quantum degree of freedom for each bit and operate at the Heisenberg limit ∆ t = π ¯ h/ 2∆ E for the time needed to flip a bit 64 -65 , 76 -80 .”

    From Ultimate physical limits to computation (2000) · cites this paper as [65]

  • Only two methods have been used to demonstrate quantum logic gates: ion traps and nuclear magnetic resonance (NMR).

    “only two methods have been used to demonstrate quantum logic gates: ion traps, 3, 4 and nuclear magnetic resonance (NMR). 5, 6”

    From Implementation of a quantum search algorithm on a quantum computer (1998) · cites this paper as [4]

  • Ion traps and optical cavities offer promising experimental approaches, but no quantum algorithm has yet been implemented with those systems.

    “Ion traps and optical cavities offer promising experimental approaches 14,15 , but no quantum algorithm has yet been implemented with those systems.”

    From Experimental realization of a quantum algorithm (1998) · cites this paper as [14]

  • States encountered in actual experiments are in general mixed and typically involve several particles.

    “require such a quantification to be versatile enough to deal with the states encountered in actual experiments, which are in general mixed and typically involve several particles.”

    From Measures and dynamics of entangled states (2005) · cites this paper as [5]

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: 21

  1. J. I. Cirac and P. Zoller, Phys. Rev. Lett. 74, 4091 (1995).
  2. R. P. Feynman, Int. J. Theor. Phys. 21, 467 (1982); Opt. News 11, 11 (1985).
  3. D. Deutsch, Proc. R. Soc. London A 425, 73 (1989);
  4. D. Deutsch and R. Jozsa, Proc. Soc. London A 439, 554 (1992).
  5. R. L. Rivest, A. Shamir, and L. Adelman, Comm. ACM, 28, 120 (1978).
  6. D. P. DiVincenzo, Phys. Rev. A 51, 1015 (1995).
  7. A. Barenco, D. Deutsch, A. Ekert, and R. Jozsa, Phys. Rev. Lett. 74, 4083 (1995).
  8. A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, and H. Weinfurter, Phys. Rev. A 52, 3457 (1995).
  9. R. Landauer, in Proceedings of the Drexel-4 Symposium on Quantum Nonintegrability-Quantum Classical Corre- spondence, edited by D. H. Feng and B-L. Hu (Interna- tional Press, Boston, to be published).
  10. W. G. Unruh, Phys. Rev. A 51, 992 (1995).
  11. K. Obermeyer, W. G. Teich, and G. Mahler, Phys. Rev. B 37, 8111 (1988).
  12. S. Lloyd, Science 261, 1569 (1993).
  13. M. Brune, P. Nussenzveig, F. Schmidt-Kaler, F. Bernar- dot, A. Maali, J.M. Raimond, and S. Haroche, Phys. Rev. Lett. 72, 3339 (1994);
  14. M. Brune, F. Schmidt-Kaler, J. Deyer, A. Maali, and J. M. Raimond, "Laser Spectroscopy XII, " edited by M. Inguscio (World Scientific, Singapore, to be published).
  15. T. Sleator and H. Weinfurter, Phys. Rev. Lett. 74, 4087 (1995).
  16. C. Monroe, D. M. Meekhof, B.E. King, S.R. Jefferts, W. M. Itano, D. J. Wineland, and P. Gould, Phys. Rev. Lett. 75, 4011 (1995).
  17. S.R. Jefferts, C. Monroe, E. W. Bell, and D. J. Wineland, Phys. Rev. A 51, 3112 (1995).
  18. J.E. Thomas, P. R. Hemmer, S. Ezekiel, C. C. Leiby, R. H. Picard, and C. R. Willis, Phys. Rev. Lett. 48, 867 (1982).
  19. N. F. Ramsey, Molecular Beams (Oxford University Press, London, 1956).
  20. F. Diedrich, J. C. Bergquist, W. M. Itano, and D. J. Wineland, Phys. Rev. Lett. 62, 403 (1989).
  21. J.J. Bollinger, D. J. Heinzen, W. M. Itano, S.L. Gilbert, and D. J. Wineland, IEEE Trans. Instrurn. Meas. 40, 126 (1991).

Cited by

Sorted by citations

Related

Authors
Monroe, C., Meekhof, D. M., King, B. E., Itano, W. M., & Wineland, D. J.
Affiliations
National Institute of Standards and Technology (US)
ORCID
Venue
Physical Review Letters
Publisher
American Physical Society (APS)
Published
1995-12-18
Volume
75
Issue
25
Pages
4714-4717
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
DOI
10.1103/physrevlett.75.4714
OpenAlex
W1966533239
Cited by
1,586
References
23
Citations by year
2026: 30 · 2025: 38 · 2024: 47 · 2023: 46 · 2022: 32 · 2021: 40 · 2020: 35 · 2019: 38 · 2018: 22 · 2017: 33 · 2016: 52 · 2015: 40 · 2014: 39 · 2013: 60 · 2012: 45
FWCI
34.35
Type
journal article
Language
en
Open access
Licence
link.aps.org/licenses/aps-default-license (vor)
Locations
  • Physical Review Letters (publishedVersion)
  • PubMed (publishedVersion)
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
CNOT gate, quantum gates, trapped atoms, laser cooling, vacuum energy, decoherence, qubits, quantum computing

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