The DOI matches its Crossref record; 154 of the 154 references it cites were found in a registry or an index.
Challenges and Opportunities of Near-Term Quantum Computing Systems
Open accessAbstract
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.
Overview
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.
Integrity signals
Registry
Cites
Statistics
Verification
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.
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
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
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 cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2014) · Theoretical Computer Science · doi:10.1016/j.tcs.2014.05.025 · Cited by 8,299
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
Fault-tolerant quantum computation by anyons
Kitaev, A. Y. (2003) · Annals of Physics · doi:10.1016/s0003-4916(02)00018-0 · Cited by 7,238
A variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552 · cited 2×
“Examples for such quantum - classical hybrid schemes are variational algorithms for quantum many-body systems [37], [108], [109] and machine learning [36].”
BackgroundScheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306
Degen, C. L., Reinhard, F., & Cappellaro, P. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.035002 · Cited by 4,045
Flagged first, then by citations
Research works printed but not linked: 15
- 10.1017/cbo9780511976667 · DOI · Paper page
- Jordan, Quantum Algorithm Zoo
- 2017, Qiskit Terra
- 2019, Qiskit Aer
- 2019, Qiskit Ignis
- 2019, Qiskit Aqua
- 2018, PyQuil
- 2018, Cirq
- 10.1145/2597917.2597939 · DOI
- 10.5753/ctd.2020.11368 · DOI
- 2019, Quantum Algorithm Zoo
- 10.26421/QIC4.3-7 · DOI
- Shepherd, 2009, Instantaneous quantum computation, Proc. Roy. Soc., 465, 1413
- Lienhard, 2005, Microwave packaging for superconducting qubits
- 10.1007/springerreference_60600 · DOI
Cited by
Sorted by citations
Items 201–203 of 203
Quantum Machine Learning for Enhanced Qubit Stability and Gate Efficiency: A Qiskit-based Framework
Parameswaran, S. S., Surya, M. A. R., Geetha, K., K.Madhavan, & Siva, V. (2026) · International Conference on Secure Information Systems and Technologies (ICSIST) · doi:10.1109/icsist70215.2026.11705835
Hettiarachchi, A., Dissanayaka, K. D., & Bamunusinghe, J. (2026) · IEEE Access · doi:10.1109/access.2026.3741621
Zhe-yu, S., Cheng, L., Liu, S.-C., Jun-Yi, D. E. N. G., & Peng, L.-Y. (2026) · APS Open Science · doi:10.1103/rfgl-6q15
Metadata
- 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
- FWCI
- 7.86
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- 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 › 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
- 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
