The future of quantum computing with superconducting qubits
Open accessAbstract
For the first time in history, we are seeing a branching point in computing paradigms with the emergence of quantum processing units (QPUs). Extracting the full potential of computation and realizing quantum algorithms with a super-polynomial speedup will most likely require major advances in quantum error correction technology. Meanwhile, achieving a computational advantage in the near term may be possible by combining multiple QPUs through circuit knitting techniques, improving the quality of solutions through error suppression and mitigation, and focusing on heuristic versions of quantum algorithms with asymptotic speedups. For this to happen, the performance of quantum computing hardware needs to improve and software needs to seamlessly integrate quantum and classical processors together to form a new architecture that we are calling quantum-centric supercomputing. In the long term, we see hardware that exploits qubit connectivity in higher than 2D topologies to realize more efficient quantum error correcting codes, modular architectures for scaling QPUs and parallelizing workloads, and software that evolves to make the intricacies of the technology invisible to the users and realize the goal of ubiquitous, frictionless quantum computing.
Integrity signals
Registry
Cites
Statistics
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?
Higher connectivity between qubits is desired for implementing efficient error-correction schemes such as low-density parity check (LDPC) codes, which require lower numbers of physical qubits.
“Apart from reducing the overhead in SWAP-gates, higher connectivity between the qubits is also desired for implementing efficient error-correction schemes such as lowdensity parity check (LDPC) codes which in turn require lower numbers of physical qubits [52].”
From Neutral atom quantum computing hardware: performance and end-user perspective (2023) · cites this paper as [52]
For superconducting qubits, schemes to extend the connectivity exist and have been tested, but issues such as higher cross-talk have to be considered.
“For superconducting qubits, schemes to extend the connectivity exist and have been tested, but issues such as higher cross-talk have to be considered [52,71]”
From Neutral atom quantum computing hardware: performance and end-user perspective (2023) · cites this paper as [52]
Cites
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691 · see citing works
Quantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325 · see citing works
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 1× · see citing works
“Known examples of tasks with an exponential quantum speedup include simulation of quantum many-body systems 19 , number theoretic problems such as integer factoring 5 , solving certain types of linear systems 20 , estimation of Betti numbers used in topological data analysis 21–23 , and computing…”
Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets
Kandala, A., Mezzacapo, A., Temme, K., Takita, M., Brink, M., Chow, J. M., & Gambetta, J. M. (2017) · Nature · doi:10.1038/nature23879 · Cited by 2,982 · see citing works
Self-citationSupervised learning with quantum-enhanced feature spaces
Havlíček, V., Córcoles, A. D., Temme, K., Harrow, A. W., Kandala, A., Chow, J. M., & Gambetta, J. M. (2019) · Nature · doi:10.1038/s41586-019-0980-2 · Cited by 2,572 · see citing works
Self-citationDiVincenzo, D. P. (1995) · Science · doi:10.1126/science.270.5234.255 · Cited by 1,651 · see citing works
Class of quantum error-correcting codes saturating the quantum Hamming bound
Gottesman, D. (1996) · Physical Review A · doi:10.1103/physreva.54.1862 · Cited by 1,227 · cited 1× · see citing works
“Stabilizer-type codes 41,42 are by far the most studied and promising code family.”
BackgroundQuantum Error Correction and Orthogonal Geometry
Calderbank, A. R., Rains, E. M., Shor, P. W., & Sloane, N. J. A. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.405 · Cited by 811 · see citing works
Efficient Variational Quantum Simulator Incorporating Active Error Minimization
Li, Y., & Benjamin, S. C. (2017) · Physical Review X · doi:10.1103/physrevx.7.021050 · Cited by 686 · see citing works
A rigorous and robust quantum speed-up in supervised machine learning
Liu, Y., Arunachalam, S., & Temme, K. (2021) · Nature Physics · doi:10.1038/s41567-021-01287-z · Cited by 649 · see citing works
Hybrid Quantum-Classical Algorithms and Quantum Error Mitigation
Endo, S., Cai, Z., Benjamin, S. C., & Yuan, X. (2021) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.90.032001 · Cited by 566 · see citing works
Demonstration of the trapped-ion quantum CCD computer architecture
Pino, J. M., Dreiling, J. M., Figgatt, C., Gaebler, J. P., Moses, S. A., Allman, M. S., Baldwin, C. H., Foss-Feig, M., Hayes, D., Mayer, K., et al. (2021) · Nature · doi:10.1038/s41586-021-03318-4 · Cited by 547 · see citing works
Quantum Computation by Adiabatic Evolution
Farhi, E., Goldstone, J., Gutmann, S., & Sipser, M. (2000) · arXiv · doi:10.48550/arxiv.quant-ph/0001106 · Cited by 536 · see citing works
High-threshold universal quantum computation on the surface code
Fowler, A. G., Stephens, A. M., & Groszkowski, P. (2009) · Physical Review A · doi:10.1103/physreva.80.052312 · Cited by 486 · see citing works
Probabilistic error cancellation with sparse Pauli–Lindblad models on noisy quantum processors
van den Berg, E., Minev, Z. K., Kandala, A., & Temme, K. (2023) · Nature Physics · doi:10.1038/s41567-023-02042-2 · Cited by 305 · see citing works
Simulation of quantum circuits by low-rank stabilizer decompositions
Bravyi, S., Browne, D., Calpin, P., Campbell, E., Gosset, D., & Howard, M. (2019) · Quantum · doi:10.22331/q-2019-09-02-181 · Cited by 302 · see citing works
Self-citationLearning-Based Quantum Error Mitigation
Strikis, A., Qin, D., Chen, Y., Benjamin, S. C., & Li, Y. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040330 · Cited by 237 · see citing works
Quantum simulations of materials on near-term quantum computers
Ma, H., Govoni, M., & Galli, G. (2020) · npj Computational Materials · doi:10.1038/s41524-020-00353-z · Cited by 197 · see citing works
Fault-Tolerant quantum computation with constant overhead
Gottesman, D. (2014) · Quantum Information and Computation · doi:10.26421/qic14.15-16-5 · Cited by 172 · see citing works
Exponential Error Suppression for Near-Term Quantum Devices
Koczor, B. (2021) · Physical Review X · doi:10.1103/physrevx.11.031057 · Cited by 147 · see citing works
Solid-state qubits integrated with superconducting through-silicon vias
Yost, D. R. W., Schwartz, M. E., Mallek, J., Rosenberg, D., Stull, C., Yoder, J. L., Calusine, G., Cook, M., Das, R., Day, A. L., et al. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00289-8 · Cited by 128 · see citing works
Error Mitigation for Universal Gates on Encoded Qubits
Piveteau, C., Sutter, D., Bravyi, S., Gambetta, J. M., & Temme, K. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.200505 · Cited by 81 · cited 2× · see citing works
“9% and a bud-get of 1 , 000 circuit executions, Piveteau, et al. 83 estimate that logical Clifford+ T circuits with about 2,000 T -gates can be realized reliably.”
BackgroundSelf-citationA fault-tolerant non-Clifford gate for the surface code in two dimensions
Brown, B. J. (2020) · Science Advances · doi:10.1126/sciadv.aay4929 · Cited by 77 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
High-threshold and low-overhead fault-tolerant quantum memory
Bravyi, S., Cross, A. W., Gambetta, J. M., Maslov, D., Rall, P., & Yoder, T. J. (2024) · Nature · doi:10.1038/s41586-024-07107-7 · Cited by 456 · see citing works
“For the first challenge, we can imagine a small change to the packaging 51 that was developed for the IBM Quantum Eagle processor 52 .”
MethodSelf-citationNeutral atom quantum computing hardware: performance and end-user perspective
Wintersperger, K., Dommert, F., Ehmer, T., Hoursanov, A., Klepsch, J., Mauerer, W., Reuber, G., Strohm, T., Yin, M., & Luber, S. (2023) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-023-00190-1 · Cited by 117 · see citing works
Early Fault-Tolerant Quantum Computing
Katabarwa, A., Gratsea, K., Caesura, A., & Johnson, P. D. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.020101 · Cited by 103 · see citing works
Quantifying the effect of gate errors on variational quantum eigensolvers for quantum chemistry
Dalton, K., Long, C. K., Yordanov, Y. S., Smith, C. G., Barnes, C. H. W., Mertig, N., & Arvidsson-Shukur, D. R. M. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00808-x · Cited by 43 · see citing works
- Authors
- Bravyi, S., Dial, O., Gambetta, J. M., Gil, D., & Nazario, Z.
- Affiliations
- IBM (United States) (US)
- IBM Quantum, IBM T.J. Watson Research Center , Yorktown Heights, New York 10598, USA
- Corresponding author
- Nazario, Zaira
- Venue
- Journal of Applied Physics
- Publisher
- AIP Publishing
- Published
- 2022-10-26
- Volume
- 132
- Issue
- 16
- ISSN
- 0021-8979 (ISSN-L)
- 1089-7550
- OpenAlex
- W4307283983
- Cited by
- 334
- References
- 23
- Citations by year
- 2026: 59 · 2025: 111 · 2024: 110 · 2023: 52 · 2022: 2
- FWCI
- 22.65
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Journal of Applied Physics (publishedVersion)
- 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 › Condensed Matter Physics › Physics of Superconductivity and Magnetism
- Keywords
- quantum computing, superconducting qubits, quantum processing units, quantum error correction, hybrid quantum-classical computing, qubit connectivity, modular quantum architectures, quantum advantage
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
