A NASA perspective on quantum computing: Opportunities and challenges
Open accessThe DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Abstract
NASA Perspective on Quantum Computing. In the last couple of decades, the world has seen several stunning instances of quantum algorithms that provably outperform the best classical algorithms. For most problems, however, it is currently unknown whether quantum algorithms can provide an advantage, and if so by how much, or how to design quantum algorithms that realize such advantages. Many of the most challenging computational problems arising in the practical world are tackled today by heuristic algorithms that have not been mathematically proven to outperform other approaches but have been shown to be effective empirically. While quantum heuristic algorithms have been proposed, empirical testing becomes possible only as quantum computation hardware is built. The next few years will be exciting as empirical testing of quantum heuristic algorithms becomes more and more feasible. While large-scale universal quantum computers are likely decades away, special-purpose quantum computational hardware has begun to emerge, which will become more powerful over time, as well as small-scale universal quantum computers.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Dynamics of the dissipative two-state system
Leggett, A. J., Chakravarty, S., Dorsey, A. T., Fisher, M. P. A., Garg, A., & Zwerger, W. (1987) · Reviews of Modern Physics · doi:10.1103/revmodphys.59.1 · Cited by 5,109
Charge-insensitive qubit design derived from the Cooper pair box
Koch, J., Yu, T. M., Gambetta, J., Houck, A. A., Schuster, D. I., Majer, J., Blais, A., Devoret, M. H., Girvin, S. M., & Schoelkopf, R. J. (2007) · Physical Review A · doi:10.1103/physreva.76.042319 · Cited by 3,351
An introduction to quantum machine learning
Schuld, M., Sinayskiy, I., & Petruccione, F. (2015) · Contemporary Physics · doi:10.1080/00107514.2014.964942 · Cited by 1,381 · cited 1×
“This work is part of the emerging field of quantum machine learning [30], an essentially unexplored territory where quantum annealing might have a large impact in the near term.”
BackgroundDefining and detecting quantum speedup
Rønnow, T. F., Wang, Z., Job, J., Boixo, S., Isakov, S. V., Wecker, D., Martinis, J. M., Lidar, D. A., & Troyer, M. (2014) · Science · doi:10.1126/science.1252319 · Cited by 601 · cited 1×
“[33] defines four classes of quantum speedups: • Provable quantum speedup: It is rigorously proven that no classical algo-rithm can scale better than a given quantum algorithm.”
BackgroundSelf-citationQuantum Computation by Adiabatic Evolution
Farhi, E., Goldstone, J., Gutmann, S., & Sipser, M. (2000) · arXiv · doi:10.48550/arxiv.quant-ph/0001106 · Cited by 536 · cited 1×
“Quantum annealing [2, 3] is a metaheuristic optimization algorithm that makes use of quantum effects such as quantum tunneling and interference.”
MethodWhat is the Computational Value of Finite-Range Tunneling?
Denchev, V. S., Boixo, S., Isakov, S. V., Ding, N., Babbush, R., Smelyanskiy, V., Martinis, J., & Neven, H. (2016) · Physical Review X · doi:10.1103/physrevx.6.031015 · Cited by 399
Implementing Qubits with Superconducting Integrated Circuits
devoret, M. H., & Martinis, J. M. (2004) · Quantum Information Processing · doi:10.1007/s11128-004-3101-5 · Cited by 230
Benedetti, M., Realpe-Gómez, J., Biswas, R., & Perdomo-Ortiz, A. (2016) · Physical Review A · doi:10.1103/physreva.94.022308 · Cited by 215
Self-citationQuantum Optimization of Fully Connected Spin Glasses
Venturelli, D., Mandrà, S., Knysh, S., O’Gorman, B., Biswas, R., & Smelyanskiy, V. (2015) · Physical Review X · doi:10.1103/physrevx.5.031040 · Cited by 209 · cited 2×
“The maximum noise that can be added to H 1 before the target solutions do not belong to the ground subspace of H 1 is called resilience [46, 47].”
BackgroundSelf-citationExperimental demonstration of a robust and scalable flux qubit
Harris, R., Johansson, J., Berkley, A. J., Johnson, M. W., Lanting, T., Han, S., Bunyk, P., Ladizinsky, E., Oh, T., Perminov, I., et al. (2010) · Physical Review B · doi:10.1103/physrevb.81.134510 · Cited by 177 · cited 2×
“(11) are implemented in D-Wave quantum annealers [51].”
BackgroundMethod
Cited by
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
Hadfield, S., Wang, Z., O’Gorman, B., Rieffel, E. G., Venturelli, D., & Biswas, R. (2019) · Algorithms · doi:10.3390/a12020034 · Cited by 772
Self-citationQuantum approximate optimization of non-planar graph problems on a planar superconducting processor
Harrigan, M. P., Sung, K. J., Neeley, M., Satzinger, K. J., Arute, F., Arya, K., Atalaya, J., Bardin, J. C., Barends, R., Boixo, S., et al. (2021) · Nature Physics · doi:10.1038/s41567-020-01105-y · Cited by 564
Self-citationApplications of hybrid models in chemical, petroleum, and energy systems: A systematic review
Zendehboudi, S., Rezaei, N., & Lohi, A. (2018) · Applied Energy · doi:10.1016/j.apenergy.2018.06.051 · Cited by 394
Reinforcement Quantum Annealing: A Hybrid Quantum Learning Automata
Ayanzadeh, R., Halem, M., & Finin, T. (2020) · Scientific Reports · doi:10.1038/s41598-020-64078-1 · Cited by 57
Metadata
- Authors
- Biswas, R., Jiang, Z., Kechezhi, K., Knysh, S., Mandrà, S., O’Gorman, B., Perdomo-Ortiz, A., Petukhov, A., Realpe-Gómez, J., Rieffel, E., Venturelli, D., Vasko, F., & Wang, Z.
- Venue
- Parallel Computing
- Publisher
- Elsevier BV
- Published
- 2017-05
- Volume
- 64
- Pages
- 81-98
- ISSN
- 0167-8191 (ISSN-L)
- OpenAlex
- W2555122525
- Cited by
- 96
- References
- 13
- FWCI
- 5.26
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A NASA perspective on quantum computing: Opportunities and challenges. https://app.cochat.ai/papers/10.1016/j.parco.2016.11.002
- The paper
- Biswas, R., Jiang, Z., Kechezhi, K., Knysh, S., Mandrà, S., O’Gorman, B., Perdomo-Ortiz, A., Petukhov, A., Realpe-Gómez, J., Rieffel, E., Venturelli, D., Vasko, F., & Wang, Z. (2017). A NASA perspective on quantum computing: Opportunities and challenges. Parallel Computing. https://doi.org/10.1016/j.parco.2016.11.002
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.