The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Quantum Computation
Abstract
If the bits of computers are someday scaled down to the size of individual atoms, quantum mechanical effects may profoundly change the nature of computation itself. The wave function of such a quantum computer could consist of a superposition of many computations carried out simultaneously; this kind of parallelism could be exploited to make some important computational problems, like the prime factoring of large integers, tractable. However, building such a quantum computer would place undreamed of demands on the experimental realization of highly quantum-coherent systems; present-day experimental capabilities in atomic physics and other fields permit only the most rudimentary implementation of quantum computation.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Although computational universality might at first seem to be a stringent demand on a physical system, a wide variety of physical systems - ranging from nearest neighbor Ising models 52 to quantum electrodynamics 84 and conformal field theories 86 - are known to be computationally universal 51 -53 , 55 -65 .”
From Ultimate physical limits to computation (2000) · cites this paper as [56]
Citations
Cites
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Irreversibility and heat generation in the computing process
Landauer, R. (1961) · IBM Journal of Research and Development · doi:10.1147/rd.53.0183 · Cited by 4,980
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Quantum Computations with Cold Trapped Ions
Cirac, J. I., & Zoller, P. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.4091 · Cited by 3,733
Irreversibility and heat generation in the computing process
Landauer, R. W. (2000) · IBM Journal of Research and Development · doi:10.1147/rd.441.0261 · Cited by 2,665
Fredkin, E., & Toffoli, T. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857727 · Cited by 1,896
Quantum computational networks
Deutsch, D. E. (1989) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1989.0099 · Cited by 1,270
Schumacher, B. (1995) · Physical Review A · doi:10.1103/physreva.51.2738 · Cited by 1,090
Two-bit gates are universal for quantum computation
DiVincenzo, D. P. (1995) · Physical Review A · doi:10.1103/physreva.51.1015 · Cited by 1,069
Self-citation
Research works printed but not linked: 21
- BAM G, LECTURES QUANTUM MEC 140, (1969).
- BARENCO A, IN PRESS PHYS REV A .
- BENNETT C.H., PURIFICATION NOISY E (1995).
- BERTHIAUME A, P WORKSH PHYS COMP P 60, (1994).
- BROWN J, NEW SCI 133, 21 (1994).
- CHUANG I.L., COMMUNICATION .
- COPPERSMITH D, IBM RC19642 RES REP (1994).
- DEUTSCH D, P ROY SOC LOND A MAT 439, 554 (1992).
- EKERT A.K., AIP C P 323, 450 (1995).
- LANDAUER R, IN PRESS P DREXEL 4 .
- LANDAUER R, IN PRESS PHILOS T A .
- LENSTRA A.K., 22ND P ANN ACM S THE 564, (1990).
- MARGOLUS N, COMPLEXITY ENTROPY P 8, 273 (1990).
- MATHEWS J, MATH METHODS PHYSICS 464, (1970).
- MONROE C, COMMUNICATION .
- SHOR P.W., 35TH P ANN S F COMP 124, (1994).
- SLICHTER C.P., PRINCIPLES MAGNETIC (1992).
- TOFFOLI T, AUTOMATA LANGUAGES P 632, (1980).
- TURCHETTE Q.A., MEASUREMENT CONDITIO (1995).
- VANDYCK R.S., PHYSICS NEWS 1 S APR: S6 (1995).
- YAMAMOTO Y, 3RD P AS PAC PHYS C (1988).
Cited by
Sorted by citations
Spintronics: Fundamentals and applications
Žutić, I., Fabian, J., & Sarma, S. D. (2004) · Reviews of Modern Physics · doi:10.1103/revmodphys.76.323 · Cited by 11,370
Entanglement of Formation of an Arbitrary State of Two Qubits
Wootters, W. K. (1998) · Physical Review Letters · doi:10.1103/physrevlett.80.2245 · Cited by 8,290
Quantum computation with quantum dots
Loss, D., & DiVincenzo, D. P. (1998) · Physical Review A · doi:10.1103/physreva.57.120 · Cited by 6,840
Self-citationMaking Nonmagnetic Semiconductors Ferromagnetic
Ohno, H. (1998) · Science · doi:10.1126/science.281.5379.951 · Cited by 4,795
Quantum information with continuous variables
Braunstein, S. L., & van Loock, P. (2005) · Reviews of Modern Physics · doi:10.1103/revmodphys.77.513 · Cited by 3,858
Metadata
- Authors
- DiVincenzo, D. P.
- Affiliations
- IBM Research - Thomas J. Watson Research Center (US)
- Corresponding author
- DiVincenzo, David P.
- ORCID
- DiVincenzo, David P.
- Venue
- Science
- Published
- 1995-10-13
- Volume
- 270
- Issue
- 5234
- Pages
- 255-261
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W4239873278
- Semantic Scholar
- 7feb1c3a3d1ae7f73891ccfb927cbbee1852290c
- Cited by
- 1,651
- References
- 27
- Citations by year
- 2026: 23 · 2025: 75 · 2024: 56 · 2023: 64 · 2022: 53 · 2021: 34 · 2020: 47 · 2019: 66 · 2018: 23 · 2017: 43 · 2016: 44 · 2015: 41 · 2014: 44 · 2013: 31 · 2012: 57
- FWCI
- 53.85
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Science (publishedVersion)
- JuSER (Forschungszentrum Jülich) (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- quantum computing, quantum computing hardware, superposition, quantum parallelism, integer factorization, quantum coherence, atomic physics
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