Quantum Computer Systems for Scientific Discovery
Open accessThe DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
Abstract
The great promise of quantum computers comes with the dual challenges of building them and finding their useful applications.We argue that these two challenges should be considered together, by codesigning full-stack quantum computer systems along with their applications in order to hasten their development and potential for scientific discovery.In this context, we identify scientific and community needs, opportunities, a sampling of a few use case studies, and significant challenges for the development of quantum computers for science over the next 2-10 years.This document is written by a community of university, national laboratory, and industrial researchers in the field of Quantum Information Science and Technology, and is based on a summary from a U.S.
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
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Self-citationPolynomial-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 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
Self-citationSimulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Biamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779
Self-citationA 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
Ladd, T. D., Jelezko, F., Laflamme, R., Nakamura, Y., Monroe, C., & O’Brien, J. L. (2010) · Nature · doi:10.1038/nature08812 · Cited by 3,592
Self-citationQuantum 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 · cited 2×
“A handy guide to known quantum algorithms is the quantum algorithm zoo [29].”
MethodSelf-citationLloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 2×
“Another class of quantum algorithms are quantum simulations [9,30,31], which use a quantum computer to simulate models of a candidate physical system of interest, such as molecules, materials, or quantum field theories whose models are intractable using classical computers.”
BackgroundMethodSelf-citationHardware-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
Supervised 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
Good quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516 · cited 5×
“It is thus critical that quantum computers exploit the technique of quantum error correction (QEC) [20, 21], or at least have sufficiently small native errors that allow the system to complete the algorithm [22].”
BackgroundInfluentialProbing many-body dynamics on a 51-atom quantum simulator
Bernien, H., Schwartz, S., Keesling, A., Levine, H., Omran, A., Pichler, H., Choi, S., Zibrov, A. S., Endres, M., Greiner, M., et al. (2017) · Nature · doi:10.1038/nature24622 · Cited by 2,460
Self-citationQuantum computational advantage using photons
Zhong, H.-S., Wang, H., Deng, Y.-H., Chen, M.-C., Peng, L.-C., Luo, Y.-H., Qin, J., Wu, D., Ding, X., Hu, Y., et al. (2020) · Science · doi:10.1126/science.abe8770 · Cited by 2,405 · cited 1×
“Recent results have provided strong evidence that sampling from the distribution obtained by evolving some initial state with a Hamiltonian and then measuring cannot be solved by any polynomial-time classical algorithm [50,70,71].”
BackgroundQuantum annealing in the transverse Ising model
Kadowaki, T., & Nishimori, H. (1998) · Physical Review E · doi:10.1103/physreve.58.5355 · Cited by 2,339 · cited 1×
“Quantum annealing models [16,17] do not appear to be”
BackgroundThe theory of variational hybrid quantum-classical algorithms
McClean, J. R., Romero, J., Babbush, R., & Aspuru-Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/2/023023 · Cited by 2,227
Measurement-based quantum computation on cluster states
Raussendorf, R., Browne, D. E., & Briegel, H. J. (2003) · Physical Review A · doi:10.1103/physreva.68.022312 · Cited by 1,655 · cited 1×
“Alternative modes such as measurement-based or cluster-state quantum computing [12] can be shown to”
BackgroundQuantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
On the Power of Quantum Computation
Simon, D. R. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796298637 · Cited by 1,295
Characterizing quantum supremacy in near-term devices
Boixo, S., Isakov, S. V., Smelyanskiy, V. N., Babbush, R., Ding, N., Jiang, Z., Bremner, M. J., Martinis, J. M., & Neven, H. (2018) · Nature Physics · doi:10.1038/s41567-018-0124-x · Cited by 1,175
Observation of a many-body dynamical phase transition with a 53-qubit quantum simulator
Zhang, J., Pagano, G., Hess, P. W., Kyprianidis, A., Becker, P., Kaplan, H., Gorshkov, A. V., Gong, Z.-X., & Monroe, C. (2017) · Nature · doi:10.1038/nature24654 · Cited by 1,079
Self-citationTwo-bit gates are universal for quantum computation
DiVincenzo, D. P. (1995) · Physical Review A · doi:10.1103/physreva.51.1015 · Cited by 1,069 · cited 1×
“families operating on single and pairwise qubits [11], akin to the NAND gate family in classical computing.”
BackgroundScalable Quantum Simulation of Molecular Energies
O’Malley, P. J. J., Babbush, R., Kivlichan, I. D., Romero, J., McClean, J. R., Barends, R., Kelly, J., Roushan, P., Tranter, A., Ding, N., et al. (2016) · Physical Review X · doi:10.1103/physrevx.6.031007 · Cited by 1,059
Randomized benchmarking of quantum gates
Knill, E., Leibfried, D., Reichle, R., Britton, J., Blakestad, R. B., Jost, J. D., Langer, C., Ozeri, R., Seidelin, S., & Wineland, D. J. (2008) · Physical Review A · doi:10.1103/physreva.77.012307 · Cited by 1,019
Extending the lifetime of a quantum bit with error correction in superconducting circuits
Ofek, N., Petrenko, A., Heeres, R., Reinhold, P., Leghtas, Z., Vlastakis, B., Liu, Y., Frunzio, L., Girvin, S. M., Jiang, L., et al. (2016) · Nature · doi:10.1038/nature18949 · Cited by 941
Scaling the Ion Trap Quantum Processor
Monroe, C., & Kim, J. (2013) · Science · doi:10.1126/science.1231298 · Cited by 786
Self-citationElucidating reaction mechanisms on quantum computers
Reiher, M., Wiebe, N., Svore, K. M., Wecker, D., & Troyer, M. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1619152114 · Cited by 745 · cited 1×
“or energy-efficient production of fertilizers [32], to new types of models of materials for improving batteries or solar cells well beyond what is accessible with classical”
BackgroundSimulating Hamiltonian Dynamics with a Truncated Taylor Series
Berry, D. W., Childs, A. M., Cleve, R., Kothari, R., & Somma, R. D. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.090502 · Cited by 742 · cited 1×
“and linear combinations of unitaries [64,65].”
Validating quantum computers using randomized model circuits
Cross, A. W., Bishop, L. S., Sheldon, S., Nation, P. D., & Gambetta, J. M. (2019) · Physical Review A · doi:10.1103/physreva.100.032328 · Cited by 704
Colloquium : Quantum annealing and analog quantum computation
Das, A., & Chakrabarti, B. K. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1061 · Cited by 700 · cited 1×
“Quantum annealing models [16,17] do not appear to be”
BackgroundEfficient Quantum Algorithms for Simulating Sparse Hamiltonians
Berry, D. W., Ahokas, G., Cleve, R., & Sanders, B. C. (2007) · Communications in Mathematical Physics · doi:10.1007/s00220-006-0150-x · Cited by 692
Universal Digital Quantum Simulation with Trapped Ions
Lanyon, B. P., Hempel, C., Nigg, D., Müller, M., Gerritsma, R., Zähringer, F., Schindler, P., Barreiro, J. T., Rambach, M., Kirchmair, G., et al. (2011) · Science · doi:10.1126/science.1208001 · Cited by 613
Defining 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×
“universal, and there is a current debate over the advantage such models can have over classical computation [18].”
BackgroundToward the first quantum simulation with quantum speedup
Childs, A. M., Maslov, D., Nam, Y., Ross, N. J., & Su, Y. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1801723115 · Cited by 551
Self-citationScalable noise estimation with random unitary operators
Emerson, J., Alicki, R., & Życzkowski, K. (2005) · Journal of Optics B: Quantum and Semiclassical Optics · doi:10.1088/1464-4266/7/10/021 · Cited by 502
Theory of variational quantum simulation
Yuan, X., Endo, S., Zhao, Q., Li, Y., & Benjamin, S. C. (2019) · Quantum · doi:10.22331/q-2019-10-07-191 · Cited by 458 · cited 7×
“Variational quantum algorithms such as the variational quantum eigensolver (VQE) [6, 33, 34] and the quantum approximate optimization algorithm (QAOA) [8] are recent developments.”
BackgroundMethodInfluentialAdiabatic Quantum Computation is Equivalent to Standard Quantum Computation
Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., & Regev, O. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539705447323 · Cited by 457
Self-citationTime/Space Trade-Offs for Reversible Computation
Bennett, C. H. (1989) · SIAM Journal on Computing · doi:10.1137/0218053 · Cited by 405 · cited 1×
“mented using Bennett’s pebbling game [114].”
Cloud Quantum Computing of an Atomic Nucleus
Dumitrescu, E. F., McCaskey, A. J., Hagen, G., Jansen, G. R., Morris, T. D., Papenbrock, T., Pooser, R. C., Dean, D. J., & Lougovski, P. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.210501 · Cited by 393
Development of quantum interconnects (QuICs) for next-generation information technologies
Awschalom, D., Berggren, K. K., Bernien, H., Bhave, S., Carr, L. D., Davids, P., Economou, S. E., Englund, D., Faraon, A., Fejer, M., et al. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.017002 · Cited by 392
Self-citationEncoding Electronic Spectra in Quantum Circuits with Linear T Complexity
Babbush, R., Gidney, C., Berry, D. W., Wiebe, N., McClean, J., Paler, A., Fowler, A., & Neven, H. (2018) · Physical Review X · doi:10.1103/physrevx.8.041015 · Cited by 383 · cited 1×
“Apart from theoretical studies aiming to discover new efficient quantum algorithms and improve asymptotic upper bounds, there are also resource count and empirical performance studies [63,66,67] as well as approaches that take advantage of the spatial locality of the Hamiltonian to reduce the gate count [68,69].”
BackgroundOverhead and noise threshold of fault-tolerant quantum error correction
Steane, A. M. (2003) · Physical Review A · doi:10.1103/physreva.68.042322 · Cited by 372
An approximate Fourier transform useful in quantum factoring
Coppersmith, D. (2002) · arXiv · doi:10.48550/arxiv.quant-ph/0201067 · Cited by 343
Solving strongly correlated electron models on a quantum computer
Wecker, D., Hastings, M. B., Wiebe, N., Clark, B. K., Nayak, C., & Troyer, M. (2015) · Physical Review A · doi:10.1103/physreva.92.062318 · Cited by 285
Optimizing Variational Quantum Algorithms Using Pontryagin’s Minimum Principle
Yang, Z.-C., Rahmani, A., Shabani, A., Neven, H., & Chamon, C. (2017) · Physical Review X · doi:10.1103/physrevx.7.021027 · Cited by 210 · cited 1×
“One particular area of active exploration is the use of the VQE or QAOA for tasks in machine learning [36] or combinatorial optimization [37,38], as discussed below.”
MethodMaslov, D. (2016) · Physical Review A · doi:10.1103/physreva.93.022311 · Cited by 193 · cited 1×
“125,126], multiple-control gates [127,128], libraries for integer arithmetic and finite fields, and many domain-”
BackgroundSelf-citationQuantum Algorithms to Simulate Many-Body Physics of Correlated Fermions
Jiang, Z., Sung, K. J., Kechedzhi, K., Smelyanskiy, V. N., & Boixo, S. (2018) · Physical Review Applied · doi:10.1103/physrevapplied.9.044036 · Cited by 175
Quantum computing with neutral atoms
Saffman, M. (2019) · National Science Review · doi:10.1093/nsr/nwy088 · Cited by 69
Gidney, C. (2019) · arXiv · doi:10.48550/arxiv.1905.07682 · Cited by 11
Cited by
The potential and global outlook of integrated photonics for quantum technologies
Pelucchi, E., Fagas, G., Aharonovich, I., Englund, D., Figueroa, E., Gong, Q., Hannes, H., Liu, J., Lu, C.-Y., Matsuda, N., et al. (2021) · Nature Reviews Physics · doi:10.1038/s42254-021-00398-z · Cited by 533
Self-citationHigh-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
“It is believed that a scalable functioning quantum computer may help solve computational problems in such areas as scientific discovery, materials research, chemistry, and drug design, to name a few [2, 3, 4, 5].”
BackgroundSelf-citationQuantum simulation and computing with Rydberg-interacting qubits
Morgado, M., & Whitlock, S. (2021) · AVS Quantum Science · doi:10.1116/5.0036562 · Cited by 370
The randomized measurement toolbox
Elben, A., Flammia, S. T., Huang, H.-Y., Kueng, R., Preskill, J., Vermersch, B., & Zoller, P. (2022) · Nature Reviews Physics · doi:10.1038/s42254-022-00535-2 · Cited by 355
Self-citationHerman, D., Googin, C., Liu, X., Sun, Y., Galda, A., Safro, I., Pistoia, M., & Alexeev, Y. (2023) · Nature Reviews Physics · doi:10.1038/s42254-023-00603-1 · Cited by 284
Self-citation
Metadata
- Authors
- Alexeev, Y., Bacon, D., Brown, K. R., Calderbank, R., Carr, L. D., Chong, F. T., DeMarco, B., Englund, D., Farhi, E., Fefferman, B., Gorshkov, A. V., Houck, A., Kim, J., Kimmel, S., Lange, M., Lloyd, S., Lukin, M. D., Maslov, D., Maunz, P., Monroe, C., Preskill, J., Roetteler, M., Savage, M. J., & Thompson, J.
- Venue
- PRX Quantum
- Publisher
- American Physical Society (APS)
- Published
- 2021-02-24
- Volume
- 2
- Issue
- 1
- ISSN
- 2691-3399 (ISSN-L)
- OpenAlex
- W2996023926
- Cited by
- 248
- References
- 49
- FWCI
- 15.44
- Type
- journal article
- Language
- en
- Open access
- gold
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.