CoChat

A NASA perspective on quantum computing: Opportunities and challenges

Open access
Biswas, Rupak, Jiang, Zhang, Kechezhi, Kostya, Knysh, Sergey, Mandrà, Salvatore, O’Gorman, Bryan, Perdomo-Ortiz, Alejandro, Petukhov, Andre, Realpe-Gómez, John, Rieffel, Eleanor, Venturelli, Davide, Vasko, Fedir, Wang, Zhihui · 2017 · Parallel Computing
Cited by 96

The 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.parco.2016.11.002

Cites

13 of 13 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 96

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

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.