CoChat

Adiabatic Quantum Simulation of Quantum Chemistry

Open access
Babbush, Ryan, Love, Peter J., Aspuru-Guzik, Alán · 2014 · Scientific Reports

The DOI matches its Crossref record; 141 of the 141 references it cites were found in a registry or an index.

Abstract

We show how to apply the quantum adiabatic algorithm directly to the quantum computation of molecular properties. We describe a procedure to map electronic structure Hamiltonians to 2-body qubit Hamiltonians with a small set of physically realizable couplings. By combining the Bravyi-Kitaev construction to map fermions to qubits with perturbative gadgets to reduce the Hamiltonian to 2-body, we obtain precision requirements on the coupling strengths and a number of ancilla qubits that scale polynomially in the problem size. Hence our mapping is efficient. The required set of controllable interactions includes only two types of interaction beyond the Ising interactions required to apply the quantum adiabatic algorithm to combinatorial optimization problems. Our mapping may also be of interest to chemists directly as it defines a dictionary from electronic structure to spin Hamiltonians with physical interactions.

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.

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

Integrity signals

Registry

Crossref · 10.1038/srep06603

Cites

141 of 141 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 A diagram relating several different approaches to the quantum simulation of quantum chemistry with the procedures and approximations implicit in each approach. Some of these approaches have been demonstrated experimentally using quantum information processors. References 68,69,70, 72 and 81,82,83,84,85,86,87 are cited in the figure above.
Figure 1 A diagram relating several different approaches to the quantum simulation of quantum chemistry with the procedures and approximations implicit in each approach. Some of these approaches have been demonstrated experimentally using quantum information processors. References 68,69,70, 72 and 81,82,83,84,85,86,87 are cited in the figure above.CC BY · PubMed Central
Figure 2 Numerics comparing the minimum spectral gaps required to reduce the term αX1Y2Z3 to 2-local with an error in the eigenspectrum of at most . On the left, is fixed at 0.001 and gaps are plotted as a function of α. On the right, α is fixed at 0.1 and gaps are plotted as a function of . Here we compare the bit-flip construction7778, the Oliveira and Terhal construction79 and an improved variant on Oliveira and Terhal by Cao et al.80.
Figure 2 Numerics comparing the minimum spectral gaps required to reduce the term αX1Y2Z3 to 2-local with an error in the eigenspectrum of at most . On the left, is fixed at 0.001 and gaps are plotted as a function of α. On the right, α is fixed at 0.1 and gaps are plotted as a function of . Here we compare the bit-flip construction7778, the Oliveira and Terhal construction79 and an improved variant on Oliveira and Terhal by Cao et al.80.CC BY · PubMed Central
Figure 3 The six equivalent bit-flip processes at third order which produce the effective interaction A · B · C. Each of these diagrams also occurs backwards on the part of the ground state in |111〉.
Figure 3 The six equivalent bit-flip processes at third order which produce the effective interaction A · B · C. Each of these diagrams also occurs backwards on the part of the ground state in |111〉.CC BY · PubMed Central
Figure 4 Diagrams showing an example of each of the four processes at fourth order. In the upper left is the process B1 (Helse + Λ)2 B1. In the upper right is the process . In the lower left is the process D2B1D2B1. In the lower right is the process A2B2C2D2.
Figure 4 Diagrams showing an example of each of the four processes at fourth order. In the upper left is the process B1 (Helse + Λ)2 B1. In the upper right is the process . In the lower left is the process D2B1D2B1. In the lower right is the process A2B2C2D2.CC BY · PubMed Central
Figure 5 The three bit-flip processes at second order. These occur for each term. Note that each of these diagrams occurs in reverse for the part of the ground state in |111〉.
Figure 5 The three bit-flip processes at second order. These occur for each term. Note that each of these diagrams occurs in reverse for the part of the ground state in |111〉.CC BY · PubMed Central
Figure 6 Diagrams for the competing process encountered at third order. Note that each of these diagrams can also occur backwards if the system starts in |111〉.
Figure 6 Diagrams for the competing process encountered at third order. Note that each of these diagrams can also occur backwards if the system starts in |111〉.CC BY · PubMed Central
Figure 7 Interaction graph for embedded molecular hydrogen Hamiltonian. Each node represents a qubit. The solid, black edges represent ZZ terms and the black loops represent local Z terms. The dashed, red edges represent XX terms and the red loops represent local X terms. The dotted, blue edges represent XZ terms. It is easy to see the unperturbed Hamiltonians corresponding to the six 3-operator terms (the black triangles).
Figure 7 Interaction graph for embedded molecular hydrogen Hamiltonian. Each node represents a qubit. The solid, black edges represent ZZ terms and the black loops represent local Z terms. The dashed, red edges represent XX terms and the red loops represent local X terms. The dotted, blue edges represent XZ terms. It is easy to see the unperturbed Hamiltonians corresponding to the six 3-operator terms (the black triangles).CC BY · PubMed Central

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.

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?

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

Show all 141 references

Research works printed but not linked: 1

  1. Abrams D. S. & Lloyd S. Quantum Algorithm Providing Exponential Speed Increase for Finding Eigenvalues and Eigenvectors. Phys. Rev. Lett. 83, 5162– 5165; 10.1103/PhysRevLett.83.5162 (1999). · DOI · Paper page

Cited by

Items 101–191 of 191

Metadata

Authors
Babbush, R., Love, P. J., & Aspuru-Guzik, A.
Affiliations
  • Harvard University (US)
  • Haverford College (US)
Venue
Scientific Reports
Published
2014-10-13
Volume
4
Issue
1
Pages
6603-6603
ISSN
2045-2322 (ISSN-L)
OpenAlex
W2053275122
Cited by
191
References
137
Citations by year
2026: 6 · 2025: 15 · 2024: 12 · 2023: 35 · 2022: 21 · 2021: 21 · 2020: 23 · 2019: 13 · 2018: 10 · 2017: 12 · 2016: 15 · 2015: 3 · 2014: 4
FWCI
11.30
Type
journal article
Language
en
Open access
Licence
Locations
  • Scientific Reports (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Digital Access to Scholarship at Harvard (DASH) (Harvard University) (submittedVersion, cc-by)
  • arXiv (Cornell University)
Funders
  • National Science Foundation (0955518, 1152291)
  • U.S. Department of Defense (FA9550)
  • Division of Chemistry (CHE-1152291)
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 › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Advanced Chemical Physics Studies
Keywords
adiabatic quantum computation, Ising interaction, ancilla qubits

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.