Toward the first quantum simulation with quantum speedup
Open accessAbstract
With quantum computers of significant size now on the horizon, we should understand how to best exploit their initially limited abilities. To this end, we aim to identify a practical problem that is beyond the reach of current classical computers, but that requires the fewest resources for a quantum computer. We consider quantum simulation of spin systems, which could be applied to understand condensed matter phenomena. We synthesize explicit circuits for three leading quantum simulation algorithms, using diverse techniques to tighten error bounds and optimize circuit implementations. Quantum signal processing appears to be preferred among algorithms with rigorous performance guarantees, whereas higher-order product formulas prevail if empirical error estimates suffice. Our circuits are orders of magnitude smaller than those for the simplest classically infeasible instances of factoring and quantum chemistry, bringing practical quantum computation closer to reality.
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?
ASCI allows for the generation of a small number of determinants while accounting for at least 90% of the wave function.
“ASCI allows for the generation of a small number of determinants while accounting for at least 90% of the wave function.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [289]
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
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 1× · see citing works
“Efficient quantum algorithms for simulating quantum dynamics have been known for over two decades (12).”
BackgroundProbing 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 · see citing works
Observation of many-body localization of interacting fermions in a quasirandom optical lattice
Schreiber, M., Hodgman, S. S., Bordia, P., Lüschen, H. P., Fischer, M. H., Vosk, R., Altman, E., Schneider, U., & Bloch, I. (2015) · Science · doi:10.1126/science.aaa7432 · Cited by 1,728 · see citing works
Universal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525 · cited 1× · see citing works
“Finally, rather than using only the T = Rz(π/4) gate, one may also distill Rz(π/6) with comparable or better efficiency as the T gate [18].”
BackgroundMany-body localization phase transition
Pal, A., & Huse, D. A. (2010) · Physical Review B · doi:10.1103/physrevb.82.174411 · Cited by 1,500 · see citing works
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 · see citing works
Scalable 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 · see citing works
Many-body localization edge in the random-field Heisenberg chain
Luitz, D. J., Laflorencie, N., & Alet, F. (2015) · Physical Review B · doi:10.1103/physrevb.91.081103 · Cited by 1,001 · see citing works
Many-body localization in a quantum simulator with programmable random disorder
Smith, J. L., Lee, A., Richerme, P., Neyenhuis, B., Hess, P., Hauke, P., Heyl, M., Huse, D. A., & Monroe, C. R. (2016) · Nature Physics · doi:10.1038/nphys3783 · Cited by 899 · see citing works
Simulating Physics with Computers
Feynman, R. P. (2018) · CRC Press eBooks · doi:10.1201/9780429500459-11 · Cited by 870 · see citing works
Quantum computational supremacy
Harrow, A. W., & Montanaro, A. (2017) · Nature · doi:10.1038/nature23458 · Cited by 820 · see citing works
Demonstration of a small programmable quantum computer with atomic qubits
Debnath, S., Linke, N. M., Figgatt, C., Landsman, K. A., Wright, K., & Monroe, C. (2016) · Nature · doi:10.1038/nature18648 · Cited by 777 · see citing works
Optimal Hamiltonian Simulation by Quantum Signal Processing
Low, G. H., & Chuang, I. L. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.010501 · Cited by 770 · see citing works
Suzuki, M. (1991) · Journal of Mathematical Physics · doi:10.1063/1.529425 · Cited by 765 · see citing works
Elucidating 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 · see citing works
Simulating 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 · see citing works
Self-citationHamiltonian Simulation by Qubitization
Low, G. H., & Chuang, I. L. (2019) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 714 · see citing works
Efficient 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 · see citing works
Synthesis of quantum-logic circuits
Shende, V., Bullock, S. S., & Markov, I. L. (2006) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2005.855930 · Cited by 682 · see citing works
Proceedings of the 30th IEEE symposium on Foundations of computer science
Galil, Z., & Blum, E. K. (1994) · Cited by 651 · see citing works
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 · see citing works
Many-Body Localization in a Disordered Quantum Ising Chain
Kjäll, J. A., Bardarson, J. H., & Pollmann, F. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.107204 · Cited by 607 · see citing works
Qubit Architecture with High Coherence and Fast Tunable Coupling
Chen, Y., Neill, C., Roushan, P., Leung, N., Fang, M., Barends, R., Kelly, J., Campbell, B., Chen, Z., Chiaro, B., et al. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.220502 · Cited by 583 · see citing works
A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits
Amy, M., Maslov, D., Mosca, M., & Roetteler, M. (2013) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2013.2244643 · Cited by 549 · cited 3× · see citing works
“s gate set an NCT circuit). Of the three basic gates used by the NCT circuits, the Toffoli gate is the most expensive—its best known implementation uses 6 cnotgates, 2 Hadamard gates, and 7 T/T† gates [2]—so we first focus on optimizing the Toffoli gate count. We use Toffoli gates with controls of arbitrary polarities. Al…”
BackgroundMethodInfluentialSelf-citationQuantum Algorithms for Quantum Field Theories
Jordan, S. P., Lee, K. S. M., & Preskill, J. P. (2012) · Science · doi:10.1126/science.1217069 · Cited by 511 · see citing works
Experimental comparison of two quantum computing architectures
Linke, N. M., Maslov, D., Roetteler, M., Debnath, S., Figgatt, C., Landsman, K. A., Wright, K., & Monroe, C. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1618020114 · Cited by 508 · see citing works
Self-citation10-Qubit Entanglement and Parallel Logic Operations with a Superconducting Circuit
Song, C., Xu, K., Liu, W., Yang, C., Zheng, S., Deng, H., Xie, Q., Huang, K., Guo, Q., Zhang, L., et al. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.180511 · Cited by 449 · see citing works
Factorization of a 768-Bit RSA Modulus
Kleinjung, T., Aoki, K., Franke, J., Lenstra, A. K., Thomé, E., Bos, J. W., Gaudry, P., Kruppa, A., Montgomery, P. L., Osvik, D. A., et al. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_18 · Cited by 423 · see citing works
On the Relationship Between Continuous- and Discrete-Time Quantum Walk
Childs, A. M. (2010) · Communications in Mathematical Physics · doi:10.1007/s00220-009-0930-1 · Cited by 411 · see citing works
Self-citationHamiltonian simulation using linear combinations of unitary operations
Childs, A. M., & Wiebe, N. (2012) · Quantum Information and Computation · doi:10.26421/qic12.11-12-1 · Cited by 408 · see citing works
Self-citationHamiltonian Simulation with Nearly Optimal Dependence on all Parameters
Berry, D. W., Childs, A. M., & Kothari, R. (2015) · 2015 IEEE 56th Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2015.54 · Cited by 372 · see citing works
Self-citationSimulating physical phenomena by quantum networks
Somma, R. D., Ortíz, G., Gubernatis, J. E., Knill, E. H., & Laflamme, R. (2002) · Physical Review A · doi:10.1103/physreva.65.042323 · Cited by 364 · see citing works
Simulating Chemistry Using Quantum Computers
Kassal, I., Whitfield, J. D., Perdomo-Ortiz, A., Yung, M.-H., & Aspuru-Guzik, A. (2011) · Annual Review of Physical Chemistry · doi:10.1146/annurev-physchem-032210-103512 · Cited by 352 · see citing works
Quantum algorithms for fermionic simulations
Ortiz, G., Gubernatis, J. E., Knill, E., & Laflamme, R. (2001) · Physical Review A · doi:10.1103/physreva.64.022319 · Cited by 347 · see citing works
Green, A. S., Lumsdaine, P. L., Ross, N. J., Selinger, P., & Valiron, B. (2013) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/2491956.2462177 · Cited by 341 · see citing works
Self-citationDigital quantum simulation of fermionic models with a superconducting circuit
Barends, R., Lamata, L., Kelly, J., García-Álvarez, L., Fowler, A. G., Megrant, A., Jeffrey, E. R., White, T., Sank, D., Mutus, J., et al. (2015) · Nature Communications · doi:10.1038/ncomms8654 · Cited by 329 · see citing works
Gate-count estimates for performing quantum chemistry on small quantum computers
Wecker, D., Bauer, B., Clark, B. K., Hastings, M. B., & Troyer, M. (2014) · Physical Review A · doi:10.1103/physreva.90.022305 · Cited by 296 · see citing works
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 · see citing works
Efficient networks for quantum factoring
Beckman, D., Chari, A. N., Devabhaktuni, S., & Preskill, J. (1996) · Physical Review A · doi:10.1103/physreva.54.1034 · Cited by 268 · see citing works
Fast and efficient exact synthesis of single-qubit unitaries generated by clifford and T gates
Kliuchnikov, V., Maslov, D., & Mosca, M. (2012) · Quantum information & computation · doi:10.26421/qic13.7-8-4 · Cited by 255 · see citing works
Self-citationAutomated optimization of large quantum circuits with continuous parameters
Nam, Y., Ross, N. J., Su, Y., Childs, A. M., & Maslov, D. (2018) · npj Quantum Information · doi:10.1038/s41534-018-0072-4 · Cited by 221 · see citing works
Self-citationQuantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms
Roetteler, M., Naehrig, M., Svore, K. M., & Lauter, K. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-70697-9_9 · Cited by 212 · see citing works
Circuit for Shor's algorithm using 2n+3 qubits
Beauregard, S. (2003) · Quantum Information and Computation · doi:10.26421/qic3.2-8 · Cited by 206 · see citing works
Chemical basis of Trotter-Suzuki errors in quantum chemistry simulation
Babbush, R., McClean, J., Wecker, D., Aspuru-Guzik, A., & Wiebe, N. (2015) · Physical Review A · doi:10.1103/physreva.91.022311 · Cited by 199 · see citing works
Quantum computation of scattering in scalar quantum field theories
Jordan, S. P., Lee, K. S. M., & Preskill, J. P. (2014) · Quantum Information and Computation · doi:10.26421/qic14.11-12-8 · Cited by 199 · see citing works
Maslov, D. (2016) · Physical Review A · doi:10.1103/physreva.93.022311 · Cited by 193 · cited 3× · see citing works
“The reflection about |0〉 is implemented as a multiply-controlled Z gate, following the construction in [55] that uses ancillas in the state |0〉.”
BackgroundMethodInfluentialSelf-citation0.5 petabyte simulation of a 45-qubit quantum circuit
Häner, T., & Steiger, D. S. (2017) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3126908.3126947 · Cited by 184 · see citing works
Optimal ancilla-free Clifford+T approximation of z-rotations
Ross, N. J., & Selinger, P. (2016) · Quantum Information and Computation · doi:10.26421/qic16.11-12-1 · Cited by 176 · see citing works
Self-citationInterferometric Probes of Many-Body Localization
Serbyn, M., Knap, M., Gopalakrishnan, S., Papić, Z., Yao, N. Y., Laumann, C. R., Abanin, D. A., Lukin, M. D., & Demler, E. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.147204 · Cited by 170 · see citing works
The Trotter step size required for accurate quantum simulation of quantum chemistry
Poulin, D., Hastings, M. B., Wecker, D., Wiebe, N., Doberty, A. C., & Troyer, M. (2015) · Quantum Information and Computation · doi:10.26421/qic15.5-6-1 · Cited by 159 · see citing works
Methodology of Resonant Equiangular Composite Quantum Gates
Low, G. H., Yoder, T. J., & Chuang, I. L. (2016) · Physical Review X · doi:10.1103/physrevx.6.041067 · Cited by 159 · cited 3× · see citing works
“, φM that realize this expansion can be computed by an efficient classical procedure (see Lemmas 1 and 3 of [53]).”
BackgroundMethodInfluentialGreen, A. S., Lumsdaine, P. L., Ross, N. J., Selinger, P., & Valiron, B. (2013) · ACM SIGPLAN Notices · doi:10.1145/2499370.2462177 · Cited by 158 · see citing works
Self-citationEfficient Synthesis of Universal Repeat-Until-Success Quantum Circuits
Bocharov, A., Roetteler, M., & Svore, K. M. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.080502 · Cited by 142 · see citing works
Synthesis of quantum logic circuits
Shende, V., Bullock, S. S., & Markov, I. L. (2005) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1145/1120725.1120847 · Cited by 142 · see citing works
Implementation of Shor's algorithm on a linear nearest neighbour qubit array
Fowler, A. G., Devitt, S. J., & Hollenberg, L. C. L. (2004) · CERN Document Server (European Organization for Nuclear Research) · doi:10.5555/2011827.2011828 · Cited by 139 · see citing works
Exponentially more precise quantum simulation of fermions in second quantization
Babbush, R., Berry, D. W., Kivlichan, I. D., Wei, A. Y., Love, P. J., & Aspuru-Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/3/033032 · Cited by 135 · see citing works
Improving quantum algorithms for quantum chemistry
Hastings, M. B., Wecker, D., Bauer, B., & Troyer, M. (2015) · Quantum Information and Computation · doi:10.26421/qic15.1-2-1 · Cited by 132 · see citing works
Black-box hamiltonian simulation and unitary implementationPreprint
Berry, D. W., & Childs, A. M. (2012) · doi:10.5555/2231036.2231040 · Cited by 122 · see citing works
Self-citationBlack-box Hamiltonian simulation and unitary implementation
Childs, A. M., & Berry, D. W. (2012) · Quantum Information and Computation · doi:10.26421/qic12.1-2-4 · Cited by 107 · see citing works
Self-citationBrown, K. R., Clark, R. J., & Chuang, I. L. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.050504 · Cited by 98 · cited 2× · see citing works
“hm has the worst performance, using from 102 to over 104 times more gates than the fourth- or sixth-order algorithm. The experimental demonstrations of digital quantum simulation that we are aware of [6, 19, 48] have primarily used the first-order formula, with some limited applications of the second-order formula [19,…”
BackgroundMethodQuantum information processing in continuous time
Childs, A. M., & Farhi, E. (2004) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 92 · see citing works
Self-citationFactoring using $2n+2$ qubits with Toffoli based modular multiplication
Haner, T., Roetteler, M., & Svore, K. M. (2017) · Quantum Information and Computation · doi:10.26421/qic17.7-8-7 · Cited by 90 · see citing works
Breaking the 49-Qubit Barrier in the Simulation of Quantum Circuits
Pednault, E., Gunnels, J. A., Nannicini, G., Lior Horesh, C., Magerlein, T., Solomonik, E., & Wisnieff, R. (2018) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · Cited by 88 · see citing works
Simulating Sparse Hamiltonians with Star Decompositions
Childs, A. M., & Kothari, R. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-18073-6_8 · Cited by 85 · see citing works
Self-citationBabbush, R., Berry, D. W., Sanders, Y. R., Kivlichan, I., Scherer, A., Wei, A. Y., Love, P. J., & Aspuru‐Guzik, A. (2017) · Quantum Science and Technology · doi:10.1088/2058-9565/aa9463 · Cited by 85 · see citing works
Adiabatic quantum state generation and statistical zero knowledge
Aharonov, D., & Ta‐Shma, A. (2003) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/780543.780546 · Cited by 80 · see citing works
Quantum Algorithms for Fermionic Quantum Field TheoriesPreprint
Jordan, S. P., Lee, K. S. M., & Preskill, J. P. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1404.7115 · Cited by 77 · see citing works
Implementation of Shor's algorithm on a linear nearest neighbour qubit array
Fowler, A. G., Devitt, S. J., & Hollenberg, L. C. L. (2004) · Quantum Information and Computation · doi:10.26421/qic4.4-1 · Cited by 74 · see citing works
Quantum-circuit design for efficient simulations of many-body quantum dynamics
Raeisi, S., Wiebe, N., & Sanders, B. C. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/10/103017 · Cited by 72 · see citing works
Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians
Haah, J., Hastings, M. B., Kothari, R., & Low, G. H. (2018) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2018.00041 · Cited by 70 · see citing works
On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography
Cheung, D., Maslov, D., Mathew, J., & Pradhan, D. K. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89304-2_9 · Cited by 68 · see citing works
Self-citationShorter gate sequences for quantum computing by mixing unitaries
Campbell, E. T. (2017) · Physical Review A · doi:10.1103/physreva.95.042306 · Cited by 53 · see citing works
Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral
Pednault, E., Gunnels, J. A., Nannicini, G., Horesh, L., Magerlein, T., Solomonik, E., Draeger, E. W., Holland, E. T., & Wisnieff, R. (2017) · arXiv · doi:10.48550/arxiv.1710.05867 · Cited by 48 · see citing works
Shor's algorithm on a nearest-neighbor machine
Kutin, S. A. (2006) · arXiv · doi:10.48550/arxiv.quant-ph/0609001 · Cited by 47 · see citing works
A quantum circuit for Shor's factoring algorithm using 2n+2 qubits
Takahashi, Y., & Kunihiro, N. (2006) · Quantum Information and Computation · doi:10.26421/qic6.2-4 · Cited by 46 · see citing works
Reducing the quantum-computing overhead with complex gate distillation
Duclos-Cianci, G., & Poulin, D. (2015) · Physical Review A · doi:10.1103/physreva.91.042315 · Cited by 44 · see citing works
Optimal and asymptotically optimal NCT reversible circuits by the gate types
Maslov, D. (2016) · Quantum information & computation · doi:10.26421/qic16.13-14-2 · Cited by 25 · see citing works
Self-citationFast Quantum Modular Exponentiation Architecture for Shor's Factorization AlgorithmPreprint
Pavlidis, A., & Gizopoulos, D. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.0511 · Cited by 14 · see citing works
Exact Analyses of Computational Time for Factoring in Quantum Computers
Kunihiro, N. (2005) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1093/ietfec/e88-a.1.105 · Cited by 13 · see citing works
Optimal and asymptotically optimal NCT reversible circuits by the gate types
Maslov, D. (2016) · Quantum Information and Computation · doi:10.26421/qic16.13-14 · Cited by 6 · see citing works
Self-citationOn the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve CryptographyPreprint
Cheung, D., Maslov, D., Mathew, J., et al. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0710.1093 · Cited by 3 · see citing works
Self-citation
Flagged first, then by citations
Cited by
Sorted by citations
Quantum computational chemistry
McArdle, S., Endo, S., Aspuru-Guzik, A., Benjamin, S. C., & Yuan, X. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.015003 · Cited by 1,621 · see citing works
Quantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560 · see citing works
The Variational Quantum Eigensolver: A review of methods and best practices
Tilly, J., Chen, H., Cao, S., Picozzi, D., Setia, K., Li, Y., Grant, E., Wossnig, L., Rungger, I., Booth, G. H., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.08.003 · Cited by 1,031 · see citing works
Hamiltonian Simulation by Qubitization
Low, G. H., & Chuang, I. L. (2019) · Quantum · doi:10.22331/q-2019-07-12-163 · Cited by 854 · see citing works
Quantum Algorithms for Quantum Chemistry and Quantum Materials Science
Bauer, B., Bravyi, S., Motta, M., & Chan, G. K.-L. (2020) · Chemical Reviews · doi:10.1021/acs.chemrev.9b00829 · Cited by 848 · see citing works
t|ket⟩: a retargetable compiler for NISQ devices
Sivarajah, S., Dilkes, S., Cowtan, A., Simmons, W., Edgington, A., & Duncan, R. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8e92 · Cited by 475 · see citing works
Exponential suppression of bit or phase errors with cyclic error correction
Google Quantum, A. I., Chen, Z., Satzinger, K. J., Atalaya, J., Korotkov, A. N., Dunsworth, A., Sank, D., Quintana, C., McEwen, M., Barends, R., et al. (2021) · Nature · doi:10.1038/s41586-021-03588-y · Cited by 393 · see citing works
Encoding 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 · see citing works
A Race-Track Trapped-Ion Quantum Processor
Moses, S. A., Baldwin, C. H., Allman, M. S., Ancona, R., Ascarrunz, L., Barnes, C., Bartolotta, J., Bjork, B., Blanchard, P., Bohn, M., et al. (2023) · Physical Review X · doi:10.1103/physrevx.13.041052 · Cited by 391 · see citing works
Learning-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
Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
Berry, D. W., Gidney, C., Motta, M., McClean, J. R., & Babbush, R. (2019) · Quantum · doi:10.22331/q-2019-12-02-208 · Cited by 222 · see citing works
Perspective on the Current State-of-the-Art of Quantum Computing for Drug Discovery Applications
Blunt, N. S., Camps, J., Crawford, O., Izsák, R., Leontica, S., Mirani, A., Moylett, A. E., Scivier, S. A., Sünderhauf, C., Schopf, P., et al. (2022) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.2c00574 · Cited by 192 · see citing works
Strategies for solving the Fermi-Hubbard model on near-term quantum computers
Cade, C., Mineh, L., Montanaro, A., & Stanisic, S. (2020) · Physical Review B · doi:10.1103/physrevb.102.235122 · Cited by 178 · see citing works
Kivlichan, I. D., Gidney, C., Berry, D. W., Wiebe, N., McClean, J., Sun, W., Jiang, Z., Rubin, N., Fowler, A., Aspuru-Guzik, A., et al. (2020) · Quantum · doi:10.22331/q-2020-07-16-296 · Cited by 173 · see citing works
Sawaya, N. P. D., Menke, T., Kyaw, T. H., Johri, S., Aspuru-Guzik, A., & Guerreschi, G. G. (2020) · npj Quantum Information · doi:10.1038/s41534-020-0278-0 · Cited by 163 · see citing works
Circuit-Based Quantum Random Access Memory for Classical Data
Park, D. K., Petruccione, F., & Rhee, J.-K. K. (2019) · Scientific Reports · doi:10.1038/s41598-019-40439-3 · Cited by 151 · see citing works
Focus beyond Quadratic Speedups for Error-Corrected Quantum Advantage
Babbush, R., McClean, J. R., Newman, M., Gidney, C., Boixo, S., & Neven, H. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010103 · Cited by 148 · 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
Fault-tolerant quantum simulations of chemistry in first quantization
Su, Y., Berry, D. W., Wiebe, N., Rubin, N., & Babbush, R. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040332 · Cited by 123 · see citing works
Self-citationBiology and medicine in the landscape of quantum advantages
Cordier, B. A., Sawaya, N. P. D., Guerreschi, G. G., & McWeeney, S. K. (2022) · Journal of The Royal Society Interface · doi:10.1098/rsif.2022.0541 · Cited by 87 · see citing works
Early fault-tolerant simulations of the Hubbard model
Campbell, E. T. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac3110 · Cited by 81 · see citing works
Mitigating algorithmic errors in a Hamiltonian simulation
Endo, S., Zhao, Q., Li, Y., Benjamin, S., & Yuan, X. (2019) · Physical Review A · doi:10.1103/physreva.99.012334 · Cited by 72 · see citing works
Babbush, R., Huggins, W. J., Berry, D. W., Ung, S. F., Zhao, A., Reichman, D. R., Neven, H., Baczewski, A. D., & Lee, J. (2023) · Nature Communications · doi:10.1038/s41467-023-39024-0 · Cited by 32 · see citing works
- Authors
- Childs, A. M., Maslov, D., Nam, Y., Ross, N. J., & Su, Y.
- Affiliations
- Joint Center for Quantum Information and Computer Science (US)
- U.S. National Science Foundation (US)
- Dalhousie University (CA)
- Venue
- Proceedings of the National Academy of Sciences
- Publisher
- National Academy of Sciences
- Published
- 2018-09-06
- Volume
- 115
- Issue
- 38
- Pages
- 9456-9461
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- PMC
- PMC6156649
- OpenAlex
- W2775106578
- Cited by
- 551
- References
- 83
- Citations by year
- 2026: 45 · 2025: 115 · 2024: 83 · 2023: 87 · 2022: 73 · 2021: 63 · 2020: 45 · 2019: 31 · 2018: 9
- FWCI
- 20.85
- Type
- journal article
- Language
- en
- Open access
- green
- europepmc.org
- Locations
- Proceedings of the National Academy of Sciences (publishedVersion)
- Europe PMC (PubMed Central) (publishedVersion)
- PubMed Central (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- DOD | United States Army | RDECOM | Army Research Office (W911NF-16-1-0349)
- Canadian Institute for Advanced Research (none)
- National Science Foundation (1526380)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Keywords
- quantum simulation, quantum advantage, spin systems, condensed matter physics, quantum signal processing, quantum circuit synthesis, error bounds, circuit optimization
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
