Emerging quantum computing algorithms for quantum chemistry
Open accessThe DOI matches its Crossref record; 120 of the 120 references it cites were found in a registry or an index.
Abstract
Digital quantum computers provide a computational framework for solving the Schrödinger equation for a variety of many‐particle systems. Quantum computing algorithms for the quantum simulation of these systems have recently witnessed remarkable growth, notwithstanding the limitations of existing quantum hardware, especially as a tool for electronic structure computations in molecules. In this review, we provide a self‐contained introduction to emerging algorithms for the simulation of Hamiltonian dynamics and eigenstates, with emphasis on their applications to the electronic structure in molecular systems. Theoretical foundations and implementation details of the method are discussed, and their strengths, limitations, and recent advances are presented. This article is categorized under: Quantum Computing > Algorithms Electronic Structure Theory > Ab Initio Electronic Structure Methods Quantum Computing > Theory Development
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
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Quantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
Density matrix formulation for quantum renormalization groups
White, S. R. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.2863 · Cited by 7,702
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
The density-matrix renormalization group in the age of matrix product states
Schollwöck, U. (2011) · Annals of Physics · doi:10.1016/j.aop.2010.09.012 · Cited by 4,818
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 1×
“The ground state is approximated [250, 277, 279, 293–295] by an exponential Ansatz, where | Ψ 0 i is a reference Slater determinant and ˆ T is a linear combination of up to k particle-hole excitation operators that promote electrons from the hole (occupied) to the particle (unoccupied) orbitals of…”
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
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
Electronic excitations: density-functional versus many-body Green’s-function approaches
Onida, G., Reining, L., & Rubio, A. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.601 · Cited by 4,155 · cited 1×
“A variety of algorithmic tools are available for the calculation of spectral functions and time-dependent properties on classical computers today, including time-dependent density functional theory, equation-of-motion coupled-cluster and diagrammatic theories [94, 95].”
BackgroundAngle-resolved photoemission studies of the cuprate superconductors
Damascelli, A., Hussain, Z., & Shen, Z.-X. (2003) · Reviews of Modern Physics · doi:10.1103/revmodphys.75.473 · Cited by 3,775 · cited 1×
“Oscillator strengths exemplify properties, such as structure factors [92, 93], that are determined by excited electronic states through transition energies and matrix elements.”
BackgroundMulticopper oxidases and oxygenases
Solomon, E. I., Sundaram, U. M., & Machonkin, T. E. (1996) · Chemical Reviews · doi:10.1021/cr950046o · Cited by 3,664 · cited 1×
“…between the two dominant structural isomers of the Cu 2 O + core is key to the ability of these metalloenzymes to reversibly bind to molecular oxygen, and is challenging since it also requires a method that can provide a balanced description of static and dynamic electronic correlations [82–85].”
MethodThe quantum theory of the electron
Dirac, P. A. M. (1928) · Proceedings of the Royal Society of London. Series A, Containing Papers of a Mathematical and Physical Character · doi:10.1098/rspa.1928.0023 · Cited by 3,657
Boson localization and the superfluid-insulator transition
Fisher, M. P. A., Weichman, P. B., Grinstein, G., & Fisher, D. S. (1989) · Physical Review B · doi:10.1103/physrevb.40.546 · Cited by 3,512
Coupled-cluster theory in quantum chemistry
Bartlett, R. J., & Musiał, M. (2007) · Reviews of Modern Physics · doi:10.1103/revmodphys.79.291 · Cited by 3,343
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 2×
“We will focus on Hamiltonian dynamics, in particular, since at the current state of knowledge, it can be simulated with lower scaling on a digital quantum computer than on a conventional computer.(5,6) The idea of a quantum simulator is conceptually interesting and appealing, and the manufacturing, control, and operat…”
BackgroundSurface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059 · cited 1×
“Fully addressing the decoherence problem requires an advanced set of techniques, namely fault-tolerant quantum computation via quantum error correction [16, 379–382], which in turn requires extremely low error rates for qubit operations as well as a significant overhead of physical qubits [382, 383].”
MethodHardware-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
Georgescu, I. M., Ashhab, S., & Nori, F. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.153 · Cited by 2,932
�ber das Paulische �quivalenzverbot
Jordan, P., & Wigner, E. (1928) · Zeitschrift f�r Physik · doi:10.1007/bf01331938 · Cited by 2,597 · cited 1×
“The JW transformation [7, 128–130], maps electronic configurations with generic particle number onto computational basis states, and fermionic creation and annihilation operators (ˆ a † k and ˆ a k respectively) onto non-local qubit operators of the form The non-locality of these operator is…”
BackgroundBarren plateaus in quantum neural network training landscapes
McClean, J. R., Boixo, S., Smelyanskiy, V. N., Babbush, R., & Neven, H. (2018) · Nature Communications · doi:10.1038/s41467-018-07090-4 · Cited by 2,329
On the product of semi-groups of operators
Trotter, H. F. (1959) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1959-0108732-6 · Cited by 2,282 · cited 2×
“An important example is the primitive approximation [169, 170] The accuracy of the primitive approximation Eq.”
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
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Lundgren, A., & Preda, D. (2001) · Science · doi:10.1126/science.1057726 · Cited by 2,056
Feynman, R. P. (1986) · Foundations of Physics · doi:10.1007/bf01886518 · Cited by 1,770
Electronic Structure: Basic Theory and Practical Methods
Martin, R. M. (2004) · doi:10.1017/cbo9780511805769 · Cited by 1,752
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
Improved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515
Bernstein, E., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300921 · Cited by 1,503
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424 · cited 1×
“According to the Solovay-Kitaev theorem [16, 18, 22–24], for any ˆ U ∈ SU(2) and any target accuracy ε there exists a sequence of O (log c (1 /ε )) gates from the generating set of G that approximates ˆ U within accuracy ε and c ≃ 4.”
MethodSimulated Quantum Computation of Molecular Energies
Aspuru-Guzik, A., Dutoi, A. D., Love, P. J., & Head-Gordon, M. (2005) · Science · doi:10.1126/science.1113479 · Cited by 1,418
Quantum random walks: An introductory overview
Kempe, J. (2003) · Contemporary Physics · doi:10.1080/00107151031000110776 · Cited by 1,413
Error Mitigation for Short-Depth Quantum Circuits
Temme, K., Bravyi, S., & Gambetta, J. M. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.180509 · Cited by 1,379
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284
Evaluating analytic gradients on quantum hardware
Schuld, M., Bergholm, V., Gogolin, C., Izaac, J., & Killoran, N. (2019) · Physical Review A · doi:10.1103/physreva.99.032331 · Cited by 1,072
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
Bravyi, S. B., & Kitaev, A. Y. (2002) · Annals of Physics · doi:10.1006/aphy.2002.6254 · Cited by 1,033
An adaptive variational algorithm for exact molecular simulations on a quantum computer
Grimsley, H. R., Economou, S. E., Barnes, E., & Mayhall, N. J. (2019) · Nature Communications · doi:10.1038/s41467-019-10988-2 · Cited by 1,033
Universal Computation by Quantum Walk
Childs, A. M. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.180501 · Cited by 1,002 · cited 1×
“These algorithms will be classified, according to the underlying mathematical formalism, into product formula [6, 7], quantum walk [163, 164] and linear combination of unitary operators (LCU) algorithms [165–168].”
BackgroundSuzuki, M. (1976) · Communications in Mathematical Physics · doi:10.1007/bf01609348 · Cited by 895 · cited 1×
“An important example is the primitive approximation [169, 170]”
BackgroundHamiltonian Simulation by Qubitization
Low, G. H., & Chuang, I. L. (2019) · Quantum · doi:10.22331/q-2019-07-12-163 · Cited by 854
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
Self-citationTowards quantum chemistry on a quantum computer
Lanyon, B. P., Whitfield, J. D., Gillett, G. G., Goggin, M. E., Almeida, M. P., Kassal, I., Biamonte, J. D., Mohseni, M., Powell, B. J., Barbieri, M., et al. (2010) · Nature Chemistry · doi:10.1038/nchem.483 · Cited by 796
Quantum optimization using variational algorithms on near-term quantum devices
Moll, N., Barkoutsos, P., Bishop, L. S., Chow, J. M., Cross, A., Egger, D. J., Filipp, S., Fuhrer, A., Gambetta, J. M., Ganzhorn, M., et al. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aab822 · Cited by 744
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 · cited 6×
“In order to describe several important quantum algorithms based on non-unitary approximations of the time evolution operator, in this section we present a theoretical result known as LCU lemma [166], showing how to apply linear combination of L unitary operators to a set of qubits prepared in a state |Ψ〉,”
BackgroundMethodInfluentialStrategies for quantum computing molecular energies using the unitary coupled cluster ansatz
Romero, J., Babbush, R., McClean, J. R., Hempel, C., Love, P. J., & Aspuru-Guzik, A. (2019) · Quantum Science and Technology · doi:10.1088/2058-9565/aad3e4 · Cited by 726
Progress towards practical quantum variational algorithms
Wecker, D., Hastings, M. B., & Troyer, M. (2015) · Physical Review A · doi:10.1103/physreva.92.042303 · Cited by 716 · cited 1×
“…reducing the measurement cost [347], for example by simultaneously measuring commuting subsets of the Pauli operators needed for the cost function [348–352], leveraging amplitude amplification [353], as well as adopting machine-learning techniques to extract more information from a given…”
MethodMotta, M., Sun, C., Tan, A. T. K., O’Rourke, M. J., Ye, E., Minnich, A. J., Brandão, F. G. S. L., & Chan, G. K.-L. (2020) · Nature Physics · doi:10.1038/s41567-019-0704-4 · Cited by 709
Self-citationEfficient 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
The Complexity of the Local Hamiltonian Problem
Kempe, J., Kitaev, A., & Regev, O. (2006) · SIAM Journal on Computing · doi:10.1137/s0097539704445226 · Cited by 648
Quantum Computer Science: An Introduction
Mermin, N. D. (2007) · doi:10.1017/cbo9780511813870 · Cited by 592
The Bravyi-Kitaev transformation for quantum computation of electronic structure
Seeley, J. T., Richard, M. J., & Love, P. J. (2012) · The Journal of Chemical Physics · doi:10.1063/1.4768229 · Cited by 585
Practical Quantum Error Mitigation for Near-Future Applications
Endo, S., Benjamin, S. C., & Li, Y. (2018) · Physical Review X · doi:10.1103/physrevx.8.031027 · Cited by 562 · cited 1×
“Recent work [386–388] has shown that the accuracy of computation based off expectation values of quantum observables, such as variational quantum algorithms, can be enhanced through an extrapolation of results from a collection of varying noisy experiments.”
BackgroundAb initio quantum chemistry using the density matrix renormalization group
White, S. R., & Martin, R. L. (1999) · The Journal of Chemical Physics · doi:10.1063/1.478295 · Cited by 558
Variational ansatz-based quantum simulation of imaginary time evolution
McArdle, S., Jones, T., Endo, S., Li, Y., Benjamin, S. C., & Yuan, X. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0187-2 · Cited by 557
Chan, G. K.-L., & Head-Gordon, M. (2002) · The Journal of Chemical Physics · doi:10.1063/1.1449459 · Cited by 554
Toward 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
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 · cited 1×
“The method was originally proposed to address combinatorial optimization problems [264, 265] and later generalized to chemistry problems [266–268], as well as to a model of quantum computation, equivalent to the circuit model [38, 269, 270] and featuring interesting robustness properties against coherent and incoheren…”
MethodHybrid quantum-classical hierarchy for mitigation of decoherence and determination of excited states
McClean, J. R., Kimchi-Schwartz, M. E., Carter, J., & de Jong, W. A. (2017) · Physical Review A · doi:10.1103/physreva.95.042308 · Cited by 516
Stokes, J., Izaac, J., Killoran, N., & Carleo, G. (2020) · Quantum · doi:10.22331/q-2020-05-25-269 · Cited by 473
Simulation of electronic structure Hamiltonians using quantum computers
Whitfield, J. D., Biamonte, J., & Aspuru-Guzik, A. (2011) · Molecular Physics · doi:10.1080/00268976.2011.552441 · Cited by 472 · cited 2×
“Techniques of circuit recompilation aimed at generating optimal circuit are also intensely investigated [132, 205–207].”
BackgroundVariational Quantum Computation of Excited States
Higgott, O., Wang, D., & Brierley, S. (2019) · Quantum · doi:10.22331/q-2019-07-01-156 · Cited by 463 · cited 1×
“The VQE algorithms has been extended to the calculation of excited states [331, 332] and the optimization of molecular orbitals [41, 333] by suitable modification of the cost function; to properties other than the ground-state energy [334, 335] by evaluation of suitable operators on the VQE wavefunction; and have been…”
MethodTheory 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 2×
“…a curve in the Hilbert space of a system (corresponding to a dynamical process) by a curve of time-dependent parametrized wavefunctions, | Ψ θ t . differential i The flow of such a wavefunction is mapped to the evolution of the parameters θ t , which takes the form of a equation [301, 302].”
BackgroundMethodGeneralized Unitary Coupled Cluster Wave functions for Quantum Computation
Lee, J., Huggins, W. J., Head-Gordon, M., & Whaley, K. B. (2019) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.8b01004 · Cited by 432
Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
Kivlichan, I. D., McClean, J., Wiebe, N., Gidney, C., Aspuru-Guzik, A., Chan, G. K.-L., & Babbush, R. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.110501 · Cited by 431 · cited 2×
“The resulting scaling is O(NγM(2)) = O(M3) [173, 179].”
BackgroundSemiclassical Fourier Transform for Quantum Computation
Griffiths, R. B., & Niu, C.-S. (1996) · Physical Review Letters · doi:10.1103/physrevlett.76.3228 · Cited by 431
Tunable Coupling Scheme for Implementing High-Fidelity Two-Qubit Gates
Yan, F., Krantz, P., Sung, Y., Kjaergaard, M., Campbell, D. L., Orlando, T. P., Gustavsson, S., & Oliver, W. D. (2018) · Physical Review Applied · doi:10.1103/physrevapplied.10.054062 · Cited by 423
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 · cited 4×
“…where ˆ T : H → H e is an isometry, ˆ S : H e → H e a unitary operator such that ˆ S 2 = 1 , and Thanks to these properties, it can be proved [212, 214] that ˆ W leaves a set of 2-dimensional subspaces invariant, and has eigenvalues and eigenvectors p The operators ˆ S and ˆ T are constructed…”
BackgroundMethodInfluentialTang, H. L., Shkolnikov, V. O., Barron, G. S., Grimsley, H. R., Mayhall, N. J., Barnes, E., & Economou, S. E. (2019) · arXiv · doi:10.48550/arxiv.1911.10205 · Cited by 408
Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., & Regev, O. (2008) · SIAM Review · doi:10.1137/080734479 · Cited by 395
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
Hamiltonian 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
Barkoutsos, P. K., Gonthier, J. F., Sokolov, I., Moll, N., Salis, G., Fuhrer, A., Ganzhorn, M., Egger, D. J., Troyer, M., Mezzacapo, A., et al. (2018) · Physical Review A · doi:10.1103/physreva.98.022322 · Cited by 363 · cited 1×
“(48) can be approximated [297] by a product of exponentials of individual one- and two-body operators,”
BackgroundQuantum 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
Low-Depth Quantum Simulation of Materials
Babbush, R., Wiebe, N., McClean, J., McClain, J., Neven, H., & Chan, G. K.-L. (2018) · Physical Review X · doi:10.1103/physrevx.8.011044 · Cited by 335
Exponential improvement in precision for simulating sparse Hamiltonians
Berry, D. W., Childs, A. M., Cleve, R., Kothari, R., & Somma, R. D. (2014) · Proceedings of the forty-sixth annual ACM symposium on Theory of computing · doi:10.1145/2591796.2591854 · Cited by 324
Adiabatic quantum state generation and statistical zero knowledge
Aharonov, D., & Ta-Shma, A. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780546 · Cited by 322
Even More Efficient Quantum Computations of Chemistry Through Tensor Hypercontraction
Lee, J., Berry, D. W., Gidney, C., Huggins, W. J., McClean, J. R., Wiebe, N., & Babbush, R. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030305 · Cited by 304
Dawson, C. M., & Nielsen, M. A. (2006) · Quantum Information and Computation · doi:10.26421/qic6.1-6 · Cited by 288
Gard, B. T., Zhu, L., Barron, G. S., Mayhall, N. J., Economou, S. E., & Barnes, E. (2020) · npj Quantum Information · doi:10.1038/s41534-019-0240-1 · Cited by 266
Schuch, N., & Verstraete, F. (2009) · Nature Physics · doi:10.1038/nphys1370 · Cited by 260 · cited 1×
“(5) grows combinatorially with the size of the studied system [44, 45].”
BackgroundQuantum computing enhanced computational catalysis
von Burg, V., Low, G. H., Häner, T., Steiger, D. S., Reiher, M., Roetteler, M., & Troyer, M. (2020) · arXiv · doi:10.48550/arxiv.2007.14460 · Cited by 258
Efficient and noise resilient measurements for quantum chemistry on near-term quantum computers
Huggins, W. J., McClean, J. R., Rubin, N. C., Jiang, Z., Wiebe, N., Whaley, K. B., & Babbush, R. (2021) · npj Quantum Information · doi:10.1038/s41534-020-00341-7 · Cited by 256 · cited 1×
“When the JW representation is used in conjunction with low-rank decompositions of the Hamiltonian [201, 392], several such constants of motion quantities can be efficiently measured simultaneously with the one-and two-body contributions to the Hamiltonian, thereby projecting the electronic…”
MethodLow-cost error mitigation by symmetry verification
Bonet-Monroig, X., Sagastizabal, R., Singh, M., & O'Brien, T. E. (2018) · Physical Review A · doi:10.1103/physreva.98.062339 · Cited by 250
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
Self-citationDobšíček, M., Johansson, G., Shumeiko, V., & Wendin, G. (2007) · Physical Review A · doi:10.1103/physreva.76.030306 · Cited by 208 · cited 1×
“There are two main strategies for algorithmic QPE: the first makes use of the gate expensive inverse quantum Fourier transform (QFT) and, in an ideal quantum computer, could work with a single measurement, the second uses shallower circuits [248, 253, 254] but requires multiple measurements and classical post-processi…”
MethodQuantum 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
Mapping local Hamiltonians of fermions to local Hamiltonians of spins
Verstraete, F., & Cirac, J. I. (2005) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2005/09/p09012 · Cited by 196 · cited 1×
“Similar ideas were explored by Ball(154) and Cirac and Verstraete.(155) The latter, in particular, achieved a mapping between local Fermi and local qubit Hamiltonians by introducing extra degrees of freedom in the form of Majorana fermions, which interact locally with the original ones.”
BackgroundAdiabatic Quantum Simulation of Quantum Chemistry
Babbush, R., Love, P. J., & Aspuru-Guzik, A. (2014) · Scientific Reports · doi:10.1038/srep06603 · Cited by 191
A Multireference Quantum Krylov Algorithm for Strongly Correlated Electrons
Stair, N. H., Huang, R., & Evangelista, F. A. (2020) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.9b01125 · Cited by 183 · cited 1×
“This technique [201, 308, 311, 312] projects the Hamiltonian on a subspace spanned by a set of non-orthogonal quantum states generated via approximate time evolution, | v k = exp( ik ∆ t ˆ H ) | Ψ 0 .”
MethodPushing configuration-interaction to the limit: Towards massively parallel MCSCF calculations
Vogiatzis, K. D., Ma, D., Olsen, J., Gagliardi, L., & de Jong, W. A. (2017) · The Journal of Chemical Physics · doi:10.1063/1.4989858 · Cited by 181 · cited 1×
“Full configuration interaction (FCI) methods can describe such an interplay but systems that can be studied with FCI methods are arguably small [80, 81].”
Hardware-efficient variational quantum algorithms for time evolution
Benedetti, M., Fiorentini, M., & Lubasch, M. (2020) · arXiv · doi:10.48550/arxiv.2009.12361 · Cited by 176
How powerful is adiabatic quantum computation?
van Dam, W., Mosca, M., & Vazirani, U. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959902 · Cited by 175 · cited 1×
“The simulation time, and thus the computational cost of ASP, are especially connected with γ(s): if such a quantity remains constant, or decreases as 1/poly(M) where M is the number of spin-orbitals of the system, ASP is polynomially expensive [272, 273].”
BackgroundQuantum 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 · cited 2×
“Exponentials of number and products of number operators can be implemented [178] with Rz(φ) = exp(−iφ/2Z) and Rzz(φ) = exp(−iφ/2Z ⊗ Z) gates, as exemplified in Fig.”
BackgroundIzmaylov, A. F., Yen, T.-C., Lang, R. A., & Verteletskyi, V. (2020) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.9b00791 · Cited by 171
Noisy intermediate-scale quantum (NISQ) algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2021) · arXiv · doi:10.48550/arxiv.2101.08448 · Cited by 166
Sokolov, I. O., Barkoutsos, P. K., Ollitrault, P. J., Greenberg, D., Rice, J., Pistoia, M., & Tavernelli, I. (2020) · The Journal of Chemical Physics · doi:10.1063/1.5141835 · Cited by 164 · cited 1×
“The VQE algorithms has been extended to the calculation of excited states [331, 332] and the optimization of molecular orbitals [41, 333] by suitable modification of the cost function; to properties other than the ground-state energy [334, 335] by evaluation of suitable operators on the VQE wavefunction; and have been…”
MethodSelf-citationSawaya, 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 · cited 1×
“The standard binary, Gray and unary codes are described in detail and compared in the literature [152, 153].”
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
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
Reachability Deficits in Quantum Approximate Optimization
Akshay, V., Philathong, H., Morales, M. E. S., & Biamonte, J. D. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.090504 · Cited by 151 · cited 1×
“…by the underlying Ansatz: on the one hand it should contain an accurate approximation to the ground state, on the other hand one desires circuits that can be easily executed on a quantum computer, with a well-behaved and rapidly convergent optimization of variational parameters [291, 292].”
BackgroundA non-orthogonal variational quantum eigensolver
Huggins, W. J., Lee, J., Baek, U., O’Gorman, B., & Whaley, K. B. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab867b · Cited by 148
An Adaptive Optimizer for Measurement-Frugal Variational Algorithms
Kübler, J. M., Arrasmith, A., Cincio, L., & Coles, P. J. (2020) · Quantum · doi:10.22331/q-2020-05-11-263 · Cited by 141
Measurements of Quantum Hamiltonians with Locally-Biased Classical Shadows
Hadfield, C., Bravyi, S., Raymond, R., & Mezzacapo, A. (2020) · arXiv · doi:10.48550/arxiv.2006.15788 · Cited by 129
Measurement reduction in variational quantum algorithms
Zhao, A., Tranter, A., Kirby, W. M., Ung, S. F., Miyake, A., & Love, P. J. (2020) · Physical Review A · doi:10.1103/physreva.101.062322 · Cited by 121 · cited 1×
“…the measurement cost [347], for example by simultaneously measuring commuting subsets of the Pauli operators needed for the cost function [348–352], leveraging amplitude amplification [353], as well as adopting machine-learning techniques to extract more information from a given measurement…”
Constrained Variational Quantum Eigensolver: Quantum Computer Search Engine in the Fock Space
Ryabinkin, I. G., Genin, S. N., & Izmaylov, A. F. (2019) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.8b00943 · Cited by 120
Materials challenges for trapped-ion quantum computers
Brown, K. R., Chiaverini, J., Sage, J. M., & Häffner, H. (2021) · Nature Reviews Materials · doi:10.1038/s41578-021-00292-1 · Cited by 120 · cited 1×
“Based on a broad range of architectures, such as superconducting [372, 373] and trapped ion [374, 375] qubits, such devices are capable of carrying out quantum computations of chemical systems on a limited scale, as exemplified in Table II, for a variety of technical reasons.”
BackgroundMeasurements as a roadblock to near-term practical quantum advantage in chemistry: resource analysis
Gonthier, J. F., Radin, M. D., Buda, C., Doskocil, E. J., Abuan, C. M., & Romero, J. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.033154 · Cited by 120
Orbital optimized unitary coupled cluster theory for quantum computer
Mizukami, W., Mitarai, K., Nakagawa, Y. O., Yamamoto, T., Yan, T., & Ohnishi, Y.-Y. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033421 · Cited by 116 · cited 2×
“Theoretical and computational chemists can help the field of quantum computation by integrating techniques (e.g. optimized orbitals [41], perturbative treatments [42], explicit electronic correlation [43]) to account for more orbitals without extra qubits and gates.”
BackgroundMethodAn efficient quantum algorithm for the time evolution of parameterized circuits
Barison, S., Vicentini, F., & Carleo, G. (2021) · Quantum · doi:10.22331/q-2021-07-28-512 · Cited by 110
Quantum Algorithm for Spectral Measurement with a Lower Gate Count
Poulin, D., Kitaev, A., Steiger, D. S., Hastings, M. B., & Troyer, M. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.010501 · Cited by 108
Continuous Symmetries and Approximate Quantum Error Correction
Faist, P., Nezami, S., Albert, V. V., Salton, G., Pastawski, F., Hayden, P., & Preskill, J. (2020) · Physical Review X · doi:10.1103/physrevx.10.041018 · Cited by 107
Holographic quantum algorithms for simulating correlated spin systems
Foss-Feig, M., Hayes, D., Dreiling, J. M., Figgatt, C., Gaebler, J. P., Moses, S. A., Pino, J. M., & Potter, A. C. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033002 · Cited by 100
Practical optimization for hybrid quantum-classical algorithms
Guerreschi, G. G., & Smelyanskiy, M. (2017) · arXiv · doi:10.48550/arxiv.1701.01450 · Cited by 99
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
Precise measurement of quantum observables with neural-network estimators
Torlai, G., Mazzola, G., Carleo, G., & Mezzacapo, A. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.022060 · Cited by 80
Minimizing Estimation Runtime on Noisy Quantum Computers
Wang, G., Koh, D. E., Johnson, P. D., & Cao, Y. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010346 · Cited by 77
Theory of analytical energy derivatives for the variational quantum eigensolver
Mitarai, K., Nakagawa, Y. O., & Mizukami, W. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.013129 · Cited by 76
Veis, L., Višňák, J., Nishizawa, H., Nakai, H., & Pittner, J. (2016) · International Journal of Quantum Chemistry · doi:10.1002/qua.25176 · Cited by 55 · cited 3×
“…significantly dependent on the application at hand, due to the complicated and delicate interplay between Hamming distances, sparsity patterns, bosonic truncation, and other properties of the Hamiltonian and other operators, and it is sensitive to the number d of levels of the system [143–151].”
BackgroundMethodEstimating Franck-Condon factors using an NMR quantum processor
Joshi, S., Shukla, A., Katiyar, H., Hazra, A., & Mahesh, T. S. (2014) · Physical Review A · doi:10.1103/physreva.90.022303 · Cited by 20
Cited by
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
Quantum computing for near-term applications in generative chemistry and drug discovery.
Pyrkov, A., Aliper, A., Bezrukov, D., Lin, Y.-C., Polykovskiy, D., Kamya, P., Ren, F., & Zhavoronkov, A. (2023) · Drug Discovery Today · doi:10.1016/j.drudis.2023.103675 · Cited by 100
Evaluating the impact of noise on the performance of the Variational Quantum Eigensolver
Oliv, M., Matic, A., Messerer, T., & Lorenz, J. M. (2022) · arXiv · doi:10.48550/arxiv.2209.12803 · Cited by 6
Quantum error correction and fault tolerance: A comprehensive tutorial
Spencer, D. J., Jain, S. P., Tanggara, A., Sun, Z., Haug, T., Khu, D., & Bharti, K. (2026) · arXiv
Metadata
- Authors
- Motta, M., & Rice, J. E.
- Venue
- WIREs Computational Molecular Science
- Publisher
- Wiley
- Published
- 2021-12-08
- Volume
- 12
- Issue
- 3
- ISSN
- 1759-0876 (ISSN-L)
- 1759-0884
- OpenAlex
- W3198799154
- Cited by
- 173
- References
- 120
- FWCI
- 9.88
- Type
- journal article
- Language
- en
- Open access
- green
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.