Envisioning a Quantum Supercomputer
Abstract
1453MetricsTotal Downloads145Last 6 Months7Last 12 Months23Total Citations3Last 6 Months0Last 12 Months0View all metrics
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Cites
Landauer, R. W. (1991) · Physics Today · doi:10.1063/1.881299 · Cited by 804 · see citing works
A Potentially Realizable Quantum Computer
Lloyd, S. (1993) · Science · doi:10.1126/science.261.5128.1569 · Cited by 649 · see citing works
Self-citationUncertainty principle and minimal energy dissipation in the computer
Landauer, R. W. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857731 · Cited by 88 · see citing works
Computation and physics: Wheeler's meaning circuit?
Landauer, R. W. (1986) · Foundations of Physics · doi:10.1007/bf01886520 · Cited by 47 · see citing works
Advanced technology and truth in advertising
Landauer, R. W. (1990) · Physica A Statistical Mechanics and its Applications · doi:10.1016/0378-4371(90)90359-z · Cited by 44 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713 · see citing works
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311 · see citing works
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904 · see citing works
Quantum information and computation
Bennett, C. H., & DiVincenzo, D. P. (2000) · Nature · doi:10.1038/35005001 · Cited by 3,263 · see citing works
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · see citing works
Self-citationDiVincenzo, D. P. (1995) · Science · doi:10.1126/science.270.5234.255 · Cited by 1,651 · see citing works
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 · see citing works
- Authors
- Lloyd, S.
- Affiliations
- Los Alamos National Laboratory (US)
- Corresponding author
- Lloyd, Seth
- ORCID
- Lloyd, Seth
- Venue
- Science
- Published
- 1994-02-04
- Volume
- 263
- Issue
- 5147
- Pages
- 695-695
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W1994894686
- Cited by
- 60
- References
- 5
- Citations by year
- 2024: 1 · 2023: 1 · 2022: 1 · 2012: 2
- FWCI
- 8.24
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Science (publishedVersion)
- PubMed (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
- Keywords
- quantum computing, quantum computing hardware
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
