The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Simulated Quantum Computation of Molecular Energies
Open accessAbstract
The calculation time for the energy of atoms and molecules scales exponentially with system size on a classical computer but polynomially using quantum algorithms. We demonstrate that such algorithms can be applied to problems of chemical interest using modest numbers of quantum bits. Calculations of the water and lithium hydride molecular ground-state energies have been carried out on a quantum computer simulator using a recursive phase-estimation algorithm. The recursive algorithm reduces the number of quantum bits required for the readout register from about 20 to 4. Mappings of the molecular wave function to the quantum bits are described. An adiabatic method for the preparation of a good approximate ground-state wave function is described and demonstrated for a stretched hydrogen molecule. The number of quantum bits required scales linearly with the number of basis functions, and the number of gates required grows polynomially with the number of quantum bits.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Previous quantum algorithms to find the ground state of a given Hamiltonian H were based on adiabatic state preparation and quantum phase estimation subroutines [104, 105], both of which have circuit depth requirements beyond those available in the NISQ era.”
From Variational quantum algorithms (2021) · cites this paper as [105]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The QPE algorithm offers an exponential speedup over classical methods and requires a number of quantum operations O(p−1) to obtain an estimate with precision p (refs 13, 14, 15, 16, 17, 18).”
From A variational eigenvalue solver on a photonic quantum processor (2014) · cites this paper as [15]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The initial application for chemistry was to obtain molecular energies via quantum phase estimation on a quantum computer (Aspuru-Guzik et al. , 2005).”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Aspuru-Guzik et al. , 2005
Experimental — accuracy not yet measuredIn the citing paper
“By exploiting their quantum mechanical properties, quantum computers have been proposed to simulate quantum systems efficiently [9–13].”
From Drug design on quantum computers (2024) · cites this paper as [9]
In the citing paper
“Around the same time, Wiesner 40 and Zalka 41 also suggested using quantum computers for simulating the dynamics of many-body systems.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [41]
In the citing paper
“Early proposals 40,41 for representing wave functions of quantum systems consider a real-space representation where the spatial wave function ψ ( x ) is discretized into grid points ∑ i ψ i | i 〉 with each | i 〉 being a computational basis state.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [41]
In the citing paper
“the ability to manipulate a discretization of the wave function directly opened a floodgate of new results in quantum algorithms for quantum chemistry 37,40,41,75,233 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [41]
In the citing paper
“In his pioneering work, Zalka 41 considered discretizing the wave function and initializing simulation through a series of controlled rotations.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [41]
In the citing paper
“Therefore, the number of terms in He scales polynomially in N, and the integrals {hpq, hpqrs} can be numerically calculated by a classical computer with polynomial resources9.”
From From transistor to trapped-ion computers for quantum chemistry (2014) · cites this paper as [9]
In the citing paper
“On a fault-tolerant computer, one may directly measure the full-CI energy by first preparing a wave function ansatz on the quantum hardware (as in VQE) and then applying the Quantum Phase Estimation algorithm, which projects a prepared state into an energy eigenstate of the Hamiltonian.[111,[132][133][134][135][136]”
From Quantum Computing for Molecular Biology** (2023) · cites this paper as [132]
In the citing paper
“Indeed, the electronic structure problem is considered to be among the first practical applications of QC [91].”
From Quantum computing algorithms: getting closer to critical problems in computational biology (2022) · cites this paper as [91]
In the citing paper
“In particular, it is possible that for some classes of nUDQSs the problems of Trotterization are not as severe as in the case of UDQSs [101].”
From Can one trust quantum simulators? (2012) · cites this paper as [101]
In the citing paper
“But, due to purely dissipative nature of the process, this type of simulation has a certain intrinsic robustness and built-in 'error correction.'”
From Can one trust quantum simulators? (2012) · cites this paper as [101]
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
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088
Nobel Lecture: Electronic structure of matter—wave functions and density functionals
Kohn, W. (1999) · Reviews of Modern Physics · doi:10.1103/revmodphys.71.1253 · Cited by 2,709
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
Born, M., & Fock, V. (1928) · Zeitschrift f�r Physik · doi:10.1007/bf01343193 · Cited by 1,494
Quantum Algorithm Providing Exponential Speed Increase for Finding Eigenvalues and Eigenvectors
Abrams, D. S., & Lloyd, S. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.5162 · Cited by 817
Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
Abrams, D. S., & Lloyd, S. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.2586 · Cited by 745
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
Simulating quantum systems on a quantum computer
Zalka, C. (1998) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.1998.0162 · Cited by 420
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
Quantum circuits with uniformly controlled one-qubit gates
Bergholm, V., Vartiainen, J. J., Möttönen, M., & Salomaa, M. M. (2005) · Physical Review A · doi:10.1103/physreva.71.052330 · Cited by 159
A Numerical Study of the Performance of a Quantum Adiabatic Evolution Algorithm for SatisfiabilityPreprint
Farhi, E., Goldstone, J., & Gutmann, S. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0007071 · Cited by 50
A coupled cluster and full configuration interaction study of CN and CN−
Thøgersen, L., & Olsen, J. (2004) · Chemical Physics Letters · doi:10.1016/j.cplett.2004.06.001 · Cited by 49
Research works printed but not linked: 2
- A. Y. Kitaev arXiv e-print ; www.arxiv.org/abs/quant-ph/9511026 (1995). · arXiv
- T. Helgaker P. Jorgensen J. Olsen Molecular Electronic-Structure Theory (Wiley Sussex 2002).
Cited by
Sorted by citations
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
Machine learning for molecular and materials science
Butler, K. T., Davies, D. W., Cartwright, H., Isayev, O., & Walsh, A. (2018) · Nature · doi:10.1038/s41586-018-0337-2 · Cited by 4,968
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
Self-citationVariational quantum algorithms
Cerezo, M., Arrasmith, A., Babbush, R., Benjamin, S. C., Endo, S., Fujii, K., McClean, J. R., Mitarai, K., Yuan, X., Cincio, L., et al. (2021) · Nature Reviews Physics · doi:10.1038/s42254-021-00348-9 · Cited by 3,385
“Previous quantum algorithms to find the ground state of a given Hamiltonian H were based on adiabatic state preparation and quantum phase estimation subroutines [87, 88], both of which have circuit depth requirements beyond those available in the NISQ era.”
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
Metadata
- Authors
- Aspuru-Guzik, A., Dutoi, A. D., Love, P. J., & Head-Gordon, M.
- Affiliations
- Department of Chemistry, University of California, Berkeley, CA, USA.
- D-Wave Systems (Canada) (CA)
- Corresponding author
- Dutoi, Anthony D.
- Venue
- Science
- Published
- 2005-09-09
- Volume
- 309
- Issue
- 5741
- Pages
- 1704-1707
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2052891002
- Cited by
- 1,418
- References
- 13
- Citations by year
- 2026: 125 · 2025: 197 · 2024: 145 · 2023: 175 · 2022: 132 · 2021: 140 · 2020: 100 · 2019: 75 · 2018: 54 · 2017: 27 · 2016: 29 · 2015: 31 · 2014: 33 · 2013: 17 · 2012: 31
- FWCI
- 15.81
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Science (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Digital Access to Scholarship at Harvard (DASH) (Harvard University) (submittedVersion, cc-by)
- Scholarly Commons (University of the Pacific) (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Advanced Chemical Physics Studies
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- quantum phase estimation, ground state energy, water molecules, lithium hydride, molecular wave functions
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
