The DOI matches its Crossref record; 9 of the 12 references it cites were found in a registry or an index.
Read the fine print
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
“However, depending on the nature of the input data, this loading phase may become the bottleneck of the overall simulation, therefore eliminating any practical quantum advantage.[224]”
From Quantum Computing for Molecular Biology** (2023) · cites this paper as [224]
In the citing paper
“Whilst there has been much development in the growing field of quantum machine learning, a systematic study of the trade-offs between quantum and classical models has yet to be conducted [12].”
From The power of quantum neural networks (2021) · cites this paper as [12]
In the citing paper
“The problems appear precisely in these two steps: how to prepare an adequate input, and how to extract the information from the output [109].”
From The prospects of quantum computing in computational molecular biology (2021) · cites this paper as [109]
Citations
Cites
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Quantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325
Quantum Support Vector Machine for Big Data Classification
Rebentrost, P., Mohseni, M., & Lloyd, S. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.130503 · Cited by 1,951
Quantum principal component analysis
Lloyd, S., Mohseni, M., & Rebentrost, P. (2014) · Nature Physics · doi:10.1038/nphys3029 · Cited by 1,385
Simulating Hamiltonian Dynamics with a Truncated Taylor Series
Berry, D. W., Childs, A. M., Cleve, R., Kothari, R., & Somma, R. D. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.090502 · Cited by 742
Quantum Algorithm for Data Fitting
Wiebe, N., Braun, D., & Lloyd, S. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.050505 · Cited by 528
Preconditioned Quantum Linear System Algorithm
Clader, B. D., Jacobs, B. C., & Sprouse, C. R. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.250504 · Cited by 288
Adiabatic Quantum Algorithm for Search Engine Ranking
Garnerone, S., Zanardi, P., & Lidar, D. A. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.230506 · Cited by 102
Equation solving by simulation
Childs, A. M. (2009) · Nature Physics · doi:10.1038/nphys1473 · Cited by 31
Research works printed but not linked: 5
- Wang, G. Preprint at http://arxiv.org/abs/1311.1851 (2013). · arXiv
- Lloyd, S., Mohseni, M. & Rebentrost, P. Preprint at http://arxiv.org/abs/1307.0411 (2013). · arXiv
- Aaronson, S. Preprint at http://arxiv.org/abs/0910.4698 (2009). · arXiv
- Aaronson, S. & Ambainis, A. Preprint at http://arxiv.org/abs/1411.5729 (2014). · arXiv
- Lloyd, S., Garnerone, S. & Zanardi, P. Preprint at http://arxiv.org/abs/1408.3106 (2014). · arXiv
Cited by
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
“” Much of the literature on the subject builds on quantum algorithms that speed up linear algebra and related tasks [37, 38], and I’ll address such applications in the ensuing subsections.”
BackgroundBiamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
Quantum algorithms: an overview
Montanaro, A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2015.23 · Cited by 1,071
“Whether this is a reasonable definition of ‘solution’ depends on the application, and again may depend on whether the input is produced algorithmically or is provided explicitly as arbitrary data.(65)”
Machine learning & artificial intelligence in the quantum domain: a review of recent progress
Dunjko, V., & Briegel, H. J. (2018) · Reports on Progress in Physics · doi:10.1088/1361-6633/aab406 · Cited by 1,055
Metadata
- Authors
- Aaronson, S.
- Affiliations
- Massachusetts Institute of Technology (US)
- Corresponding author
- Aaronson, Scott
- ORCID
- Aaronson, Scott
- Venue
- Nature Physics
- Published
- 2015-04
- Volume
- 11
- Issue
- 4
- Pages
- 291-293
- ISSN
- 1745-2473 (ISSN-L)
- 1745-2481
- OpenAlex
- W2042127289
- Cited by
- 567
- References
- 12
- Citations by year
- 2026: 65 · 2025: 100 · 2024: 67 · 2023: 74 · 2022: 61 · 2021: 68 · 2020: 43 · 2019: 32 · 2018: 21 · 2017: 17 · 2016: 17 · 2015: 2
- FWCI
- 18.63
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Nature Physics (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 many-body systems
- Keywords
- quantum algorithms, quantum machine learning, quantum clustering, exponential speedup, algorithmic complexity
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.