Cited by 474Quantum Computing Algorithms and ArchitectureAdvanced Chemical Physics StudiesQuantum many-body systems

Simulation of electronic structure Hamiltonians using quantum computers

Open access
Whitfield, James D., Biamonte, Jacob, Aspuru-Guzik, Alán·2011·Molecular Physics

Abstract

Over the last century, a large number of physical and mathematical developments paired with rapidly advancing technology have allowed the field of quantum chemistry to advance dramatically. However, the lack of computationally efficient methods for the exact simulation of quantum systems on classical computers presents a limitation of current computational approaches. We report, in detail, how a set of pre-computed molecular integrals can be used to explicitly create a quantum circuit, i.e. a sequence of elementary quantum operations, that, when run on a quantum computer, obtains the energy of a molecular system with fixed nuclear geometry using the quantum phase estimation algorithm. We extend several known results related to this idea and discuss the adiabatic state preparation procedure for preparing the input states used in the algorithm. With current and near future quantum devices in mind, we provide a complete example using the hydrogen molecule of how a chemical Hamiltonian can be simulated using a quantum computer.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1080/00268976.2011.552441

Cites

39 of 39 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

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 time the quantum computer must remain coherent in QPE is determined by the necessity of O(p−1) successive applications, each of which can require on the order of millions or billions of quantum gates for practical applications, as compared to the tens to hundreds of gates achievable in the short term.

    “The time the quantum computer must remain coherent is determined by the necessity of O(p−1) successive applications of , each of which can require on the order of millions or billions of quantum gates for practical applications1719, as compared to the tens to hundreds of gates achievable in the short term.”

    From A variational eigenvalue solver on a photonic quantum processor (2014) · cites this paper as [17]

    Split into 2 atoms — 1 confirmed, 1 partially supported, 0 disputed, 0 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.

    Experimental — accuracy not yet measured
  • There are already proposals for NISQ algorithms based on variational principles.

    “Indeed, there are already proposals 200 for NISQ algorithms based on variational principles 201,202 .”

    From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [201]

  • The standard quantum-circuit treatment for implementing each non-local operator involves as many as 2N two-qubit gates for simulating N fermionic modes; in our protocol one needs only two Mølmer-Sørensen gates.

    “It is remarkable that the standard quantum-circuit treatment (e.g. see Ref.47) for implementing each involves as many as 2N two-qubit gates for simulating N fermionic modes; in our protocol one needs only two Mølmer-Sørensen gates, which are straightforwardly implementable with current trapped-ion technology.”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Part of this paper’s reference list could not be split into single entries.

Flagged first, then by citations

Research works printed but not linked: 12

  1. [5][5]R. Feynman, Optics News (now OPN) 11 (11), 11-22 (1982). -
  2. [9][9]I. Kassal, S.P. Jordan, P.J. Love, M. Mohseni and A. Aspuru-Guzik, Proc. Natl. Acad. Sci. 105 , 18681 (2008). -
  3. [12][12]I. Kassal, J. Whitfield, A. Perdomo-Ortiz, M.H. Yung and A. Aspuru-Guzik, preprint, arXiv:1007.2648 (2010). < http://arxiv.org/abs/1007.2648 > . - · arXiv
  4. [13][13]M. Nielsen and I. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, UK, 2001). -
  5. [21][21]M. Feit, J. J.A. Fleck and A. Steiger, Journal of Computational Physics, J. Comp. Phys. 47 , 412-433 (1982). -
  6. [22][22]S.A. M. Ceotto, G.F. Tantardini and A. Aspuru-Guzik, Multiple coherent states for firstprinciples semiclassical initial value representation molecular dynamicsThe Journal Chemical Physics, J. Chem. Phys. 130 , 234113 (2009). -
  7. [25][25]D.P. DiVincenzo, Fortschr. Phys. 48 , 771 (2000), also arXiv:quant-ph/0002077. - · arXiv
  8. [27][27]N. Hatano and M. Suzuki, in Quantum Annealing and Other Optimization Methods , edited by A. Das and B.K. Chakrabarti (Springer, Berlin, Germany, 2005), Lectures Notes in Physics, pp. 37-68. -
  9. [33][33]A. Kitaev, preprint, arXiv:quant-ph/9511026 (1995). < http://arxiv.org/abs/quantph/9511026 > . - · arXiv
  10. [40][40]A. Perdomo-Ortiz, S.E. Venegas-Andraca and A. Aspuru-Guzik, Quantum Information Processing pp. 1-20 (2010). -
  11. [43][43]J. Kempe, A. Kitaev and O. Regev, SIAM J. Computing 35 (5), 1070-1097 (2006). -
  12. [48][48]L. Veis and J. Pittner, preprint, arXiv:1008.3451 (2010). < http://arxiv.org/abs/1008.3451 > . - · arXiv

Cited by

Sorted by citations

Authors
Whitfield, J. D., Biamonte, J., & Aspuru-Guzik, A.
Affiliations
Harvard University (US)
Corresponding author
  • Whitfield, James D.
  • Biamonte, Jacob
Venue
Molecular Physics
Published
2011-03-10
Volume
109
Issue
5
Pages
735-750
ISSN
  • 0026-8976 (ISSN-L)
  • 1362-3028
OpenAlex
W2103373613
Cited by
472
References
36
Citations by year
2026: 33 · 2025: 54 · 2024: 54 · 2023: 64 · 2022: 49 · 2021: 36 · 2020: 43 · 2019: 23 · 2018: 29 · 2017: 13 · 2016: 14 · 2015: 14 · 2014: 19 · 2013: 11 · 2012: 12
FWCI
13.55
Type
journal article
Language
en
Open access
Locations
  • Molecular Physics (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
Engineering and Physical Sciences Research Council (EP/G003017/1)
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, quantum circuits, molecular integrals, adiabatic state preparation, molecular hydrogen, quantum chemistry, quantum computing

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