Cited by 203Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum many-body systems

Challenges and Opportunities of Near-Term Quantum Computing Systems

Open access
Corcoles, Antonio D., Kandala, Abhinav, Javadi-Abhari, Ali, McClure, Douglas T., Cross, Andrew W., Temme, Kristan, Nation, Paul D., Steffen, Matthias +1 more·2020·Proceedings of the IEEE

Abstract

The concept of quantum computing has inspired a whole new generation of scientists, including physicists, engineers, and computer scientists, to fundamentally change the landscape of information technology. With experimental demonstrations stretching back more than two decades, the quantum computing community has achieved a major milestone over the past few years: the ability to build systems that are stretching the limits of what can be classically simulated, and which enable cloud-based research for a wide range of scientists, thus increasing the pool of talent exploring early quantum systems. While such noisy near-term quantum computing systems fall far short of the requirements for fault-tolerant systems, they provide unique test beds for exploring the opportunities for quantum applications. Here, we highlight an IBM-specific perspective of the facets associated with these systems, including quantum software, cloud access, benchmarking quantum systems, error correction and mitigation in such systems, understanding the complexity of quantum circuits, and how early quantum applications can run on near-term quantum computers.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1109/jproc.2019.2954005

Cites

153 of 153 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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.

Cites

Flagged first, then by citations

Research works printed but not linked: 4

  1. M. Nielsen and I. Chuang, Quantum Computation and Quantum Information. New York, NY, USA: Cambridge Univ. Press, 2000.
  2. A. Kandala, K. Temme, A. D. Corcoles, A. Mezzacapo, J. M. Chow, and J. M. Gambetta, "Extending the computational reach of a noisy superconducting quantum processor," Nature, vol. 567, p. 491, May 2019.
  3. D. Shepherd and M. J. Bremner, "Instantaneous quantum computation," Proc. Roy. Soc., vol. 465, pp. 1413-1439, Jan. 2009.
  4. B. Lienhard et al., "Microwave packaging for superconducting qubits," 2005, arXiv:1906.05425. [Online]. Available: https://arxiv.org/abs/ 1906.05425 · arXiv

Cited by

Sorted by citations

Authors
Corcoles, A. D., Kandala, A., Javadi-Abhari, A., McClure, D. T., Cross, A. W., Temme, K., Nation, P. D., Steffen, M., & Gambetta, J. M.
Affiliations
IBM (United States) (US)
Venue
Proceedings of the IEEE
Published
2020-08
Volume
108
Issue
8
Pages
1338-1352
ISSN
  • 0018-9219 (ISSN-L)
  • 1558-2256
OpenAlex
W2978630019
Cited by
203
References
133
Citations by year
2026: 21 · 2025: 44 · 2024: 44 · 2023: 25 · 2022: 22 · 2021: 34 · 2020: 12 · 2019: 1
FWCI
7.86
Type
journal article
Language
en
Open access
Locations
  • Proceedings of the IEEE (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
Keywords
near-term quantum computing, noisy intermediate-scale quantum computing, quantum computing software, cloud quantum computing, quantum benchmarking, quantum circuit 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