Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2014 Oct 13:4:6603.
doi: 10.1038/srep06603.

Adiabatic quantum simulation of quantum chemistry

Affiliations

Adiabatic quantum simulation of quantum chemistry

Ryan Babbush et al. Sci Rep. .

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.

PubMed Disclaimer

Figures

Figure 1
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 ,,, and ,,,,,, are cited in the figure above.
Figure 2
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, formula image 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 formula image. Here we compare the bit-flip construction, the Oliveira and Terhal construction and an improved variant on Oliveira and Terhal by Cao et al..
Figure 3
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 4
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 formula image. In the lower left is the process D2B1D2B1. In the lower right is the process A2B2C2D2.
Figure 5
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 6
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 7
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).

References

    1. Aspuru-Guzik A., Dutoi A. D., Love P. J. & Head-Gordon M. Simulated Quantum Computation of Molecular Energies. Science. 309, 20; 10.1126/science.1113479 (2006). - PubMed
    1. Wecker D., Bauer B., Clark B. K., Hastings M. B. & Troyer M. Gate-count estimates for performing quantum chemistry on small quantum computers. Phys. Rev. A 90, 022305; 10.1103/PhysRevA.90.022305 (2014).
    1. Whitfield J. D., Biamonte J. & Aspuru-Guzik A. Simulation of Electronic Structure Hamiltonians Using Quantum Computers. Mol. Phys. 2, 106–111; 10.1080/00268976.2011.552441 (2010).
    1. Poulin D. et al. The Trotter Step Size Required for Accurate Quantum Simulation of Quantum Chemistry. e-print arXiv: 1406.4920; (2014). URL http://arxiv.org/abs/1406.4920.
    1. Hastings M. B., Wecker D., Bauer B. & Troyer M. Improving Quantum Algorithms for Quantum Chemistry. e-print arXiv: 1403.1539; (2014).

Publication types

LinkOut - more resources