Commercialize quantum technologies in five years
The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
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
“The opening decade of the 21st century witnessed the first quantum algorithms for quantum chemistry built on the insights of QPEA. For example, the quantum algorithms developed for computing molecular spectra with exponential speedup over classical computers 45,46 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [45]
In the citing paper
“The Quantum Phase Estimation (QPE) algorithm 38,99 is the natural translation of the FCI procedure to quantum computers 45 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [45]
In the citing paper
“As detailed by Aspuru-Guzik et al. 45 and Dobˇ s´ ıˇ cek et al. 275 , the number of ancilla qubits can be greatly reduced, while maintaining the same precision by using the iterative quantum phase estimation algorithm (IPEA).”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [45]
In the citing paper
“This allowed the number of qubits in the QPEA ancilla register to be reduced from 20 to 4, enabling the study of quantum algorithms for electronic structure problems on a classical computer 45 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [45]
In the citing paper
“This work shows that even with modest quantum computers of 30-100 errorcorrected qubits, ground state energy calculations of H 2 O and LiH could be carried out to an accuracy beyond that of classical computers.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [45]
5 more claims about this paper
Create a free account to see every claim other papers make about this one.
Citations
Cites
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
The second machine age: work, progress, and prosperity in a time of brilliant technologies
(2015) · Choice Reviews Online · doi:10.5860/choice.184834 · Cited by 4,381
Surface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059
Self-citationCharacterizing quantum supremacy in near-term devices
Boixo, S., Isakov, S. V., Smelyanskiy, V. N., Babbush, R., Ding, N., Jiang, Z., Bremner, M. J., Martinis, J. M., & Neven, H. (2018) · Nature Physics · doi:10.1038/s41567-018-0124-x · Cited by 1,175
Self-citationProgress towards practical quantum variational algorithms
Wecker, D., Hastings, M. B., & Troyer, M. (2015) · Physical Review A · doi:10.1103/physreva.92.042303 · Cited by 716
Computational multiqubit tunnelling in programmable quantum annealers
Boixo, S., Smelyanskiy, V. N., Shabani, A., Isakov, S. V., Dykman, M., Denchev, V. S., Amin, M. H., Smirnov, A. Y., Mohseni, M., & Neven, H. (2016) · Nature Communications · doi:10.1038/ncomms10327 · Cited by 233
Self-citationSolving the Optimal Trading Trajectory Problem Using a Quantum Annealer
Rosenberg, G., Haghnegahdar, P., Goddard, P., Carr, P., Wu, K., & de Prado, M. L. (2016) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2016.2574703 · Cited by 171
Inhomogeneous quasi-adiabatic driving of quantum critical dynamics in weakly disordered spin chains
Rams, M. M., Mohseni, M., & del Campo, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/aa5079 · Cited by 49
Self-citationThe Theory of the Quantum World
Gross, D. J., Marc Henneaux, A., & Sevrin, A. (2013) · WORLD SCIENTIFIC eBooks · doi:10.1142/8674 · Cited by 11
Research works printed but not linked: 3
- Touzalin, A. et al. Quantum Manifesto: A New Area of Technology (Quantum Information Processing and Communication in Europe, 2016); available at http://go.nature.com/2im6rjr
- Boixo, S. et al. Preprint at http://arxiv.org/abs/1608.00263 (2016). · arXiv
- Denchev, V. S. et al. Phys. Rev. X 6, 031015 (2016).
Cited by
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
Self-citationSecure quantum key distribution with realistic devices
Xu, F., Ma, X., Zhang, Q., Lo, H.-K., & Pan, J.-W. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.025002 · Cited by 1,543
“…classical supercomputer for a specific computational task (Arute et al., 2019), and plans to commercialize quantum computers within a few years (Mohseni et al., 2017); IBM Q has already put its sixteen-qubit quantum processor online for client use2; Rigetti has also provided the quantum cloud…”
BackgroundQuantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560
Parameterized quantum circuits as machine learning models
Benedetti, M., Lloyd, E., Sack, S., & Fiorentini, M. (2019) · Quantum Science and Technology · doi:10.1088/2058-9565/ab4eb5 · Cited by 1,144
“Nevertheless, there is a growing consensus that noisy intermediate-scale quantum (NISQ) devices may find useful applications and commercialization in the near term [1, 2].”
BackgroundCircuit-centric quantum classifiers
Schuld, M., Bocharov, A., Svore, K. M., & Wiebe, N. (2020) · Physical Review A · doi:10.1103/physreva.101.032308 · Cited by 1,057
“[1] Masoud Mohseni, Peter Read, Hartmut Neven, Sergio Boixo, Vasil Denchev, Ryan Babbush, Austin Fowler, Vadim Smelyanskiy, and John Martinis.”
Background
Metadata
- Authors
- Mohseni, M., Read, P., Neven, H., Boixo, S., Denchev, V., Babbush, R., Fowler, A., Smelyanskiy, V., & Martinis, J.
- Affiliations
- Google (United States) (US)
- Corresponding author
- Mohseni, Masoud
- Read, Peter
- Neven, Hartmut
- ORCID
- Venue
- Nature
- Published
- 2017-03-09
- Volume
- 543
- Issue
- 7644
- Pages
- 171-174
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W2593019179
- Cited by
- 268
- References
- 8
- Citations by year
- 2026: 10 · 2025: 16 · 2024: 22 · 2023: 18 · 2022: 29 · 2021: 32 · 2020: 35 · 2019: 64 · 2018: 26 · 2017: 16
- FWCI
- 23.01
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
- Locations
- Nature (publishedVersion)
- PubMed (publishedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- 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 computing, commercialization, Google Quantum AI, quantum computing hardware, quantum machine learning
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.