Article | Open | Published:

Adiabatic Quantum Simulation of Quantum Chemistry

Scientific Reports volume 4, Article number: 6603 (2014) | Download Citation

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.

Introduction

The ability to make exact quantum chemical calculations on nontrivial systems would revolutionize chemistry. While seemingly intractable for classical algorithms, quantum computers can efficiently perform such computations. There has been substantial interest in quantum algorithms for quantum chemistry involving a combination of Trotterization and phase estimation1,2,3,4,5,6. However, we are still technologically far from when such gate-model approaches are experimentally feasible for practical chemistry problems. Here, we propose a radically different approach based on the quantum adiabatic algorithm. In this rapidly advancing paradigm of quantum computation, there is no need for Trotterization, phase estimation or logic gates. More generally, we show the first scalable quantum simulation scheme for fermionic systems using adiabatic quantum computing.

Adiabatic quantum computing works by changing the Hamiltonian of a controllable quantum system from an initial Hamiltonian whose ground state is easy to prepare into a Hamiltonian whose ground state encodes the solution of a computationally interesting problem7,8. The speed of this algorithm is determined by the adiabatic theorem of quantum mechanics which states that an eigenstate remains at the same position in the eigenspectrum if a perturbation acts on the system sufficiently slowly7,9,10. Simply embedding a computational problem in a Hamiltonian suitable for AQC does not ensure an efficient solution. The required runtime for the adiabatic evolution depends on the energy gap between the ground state and first excited state at the smallest avoided crossing7.

AQC has been applied to classical optimization problems that lie in the complexity class NP. For example, studies have been performed on satisfiability11,12,13, Exact Cover7,8, 3-regular 3-XORSAT and 3-regular Max-Cut14, random instances of classical Ising spin glasses15, protein folding16,17 and machine learning18,19. AQC has also been applied to structured and unstructured search20,21, search engine ranking22 and artificial intelligence problems arising in space exploration23. Many of these applications follow naturally from the NP-Completeness of determining the ground state energy of classical Ising spin glasses24. This creates an equivalence between a large set of computational problems (the class NP) and a set of models in classical physics (classical Ising models with random coupling strengths). The advent of AQC provides a powerful motivation to study the detailed implications of this mapping. In general, we do not expect that quantum computing, including AQC, can provide efficient solutions to NP-Complete problems in the worst case25. However, there may exist sets of instances of some NP-Complete problems for which AQC can find the ground state efficiently, but which defy efficient classical solution by any means. If this is the case then AQC is certainly of considerable scientific interest, and likely of great industrial importance.

The potential value of a positive answer to this conjecture has motivated a commercial effort to construct an adiabatic quantum computer26,27,28,29,30,31. Currently, these experimental implementations of AQC are not strictly confined to the ground state at zero temperature but have considerable thermal mixing of higher lying states. Such intermediate implementations are referred to as quantum annealing devices. Quantum annealing machines with up to 509 qubits have been commercially manufactured by D-Wave Systems32,33,34. They are currently the subject of serious scientific investigation to determine whether their operation depends significantly on their quantum properties, and if so, whether it provides a speedup for any class of instances15,33,35,36,37,38.

Quantum computers have been rigorously proved to provide an algorithmic advantage over the best known classical approaches for a small set of problems39,40,41. Adiabatic quantum computation applied to classical Ising Hamiltonians (equivalently, all problems in NP) also gives an approach to a very large class of problems where the advantage (if any) is currently unknown. The construction of medium scale (500 qubit) quantum annealing machines provides a hardware platform where the properties of AQC can be investigated experimentally. Such investigations have already been performed for many problems. At present, optimized codes on classical hardware can find the ground state of many instances in comparable time to the D-Wave device15. However, even if no interesting set of instances is found on which quantum annealing on the classical Ising model outperforms classical approaches, the hardware constructed to date represents an important step towards the construction of large scale quantum information technology. If quantum annealing of the classical Ising model is the first step, what is the natural next step?

Quantum simulation has provided a rich set of questions and methods in quantum computation since Feynman's suggestion that quantum devices would be best suited to computation of quantum properties42. This observation has been fleshed out through early work on specific systems43,44,45,46,47,48 and through quantum algorithms for computation of eigenvalues, dynamics and other properties49,50,51,52,53,54,55. Recently, there have been many proposals for the simulation of quantum lattice models using trapped ions, trapped atoms and photonic systems56,57,58,59,60. There has been rapid experimental progress in the quantum simulation of a number of systems61,62,63,64,65,66. A natural target for these simulations is the phase diagram of the Fermi-Hubbard model - believed to inform our understanding of high-Tc superconductivity. For this reason many of these approaches are aimed at simulating systems of interacting fermions.

Lattice systems are a natural target for trapped ion and atom quantum simulators, with the trapping mechanism taking the place of the crystal lattice and interactions restricted to neighbors on the lattice. However, quantum chemistry applied to molecular systems is perhaps the broadest class of problems on which quantum simulation of interacting fermions could have an impact. Finding the energy of electrons interacting in the Coulomb potential of a set of fixed nuclei of an atom or molecule defines the electronic structure problem. This problem appears to be hard for classical computers because the cost of directly solving for the eigenvalues of the exact electronic Hamiltonian grows exponentially with the problem size. In spite of much progress over the last 60 years developing approximate classical algorithms for this problem, exact calculations remain out of reach for many systems of interest. Figure 1 shows several of the proposals for the efficient quantum simulation of chemical Hamiltonians.

Figure 1: A diagram relating several different approaches to the quantum simulation of quantum chemistry with the procedures and approximations implicit in each approach.
Figure 1

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.

One may divide quantum simulation algorithms into two classes: those that address statics and compute ground state properties, and those that address dynamics, and simulate time evolution of the wavefunction. It is clear that the simulation of time evolution is exponentially more efficient on quantum computers, with significant implications for the simulation of chemically reactive scattering, in particular67. The computation of ground state properties naturally requires preparation of the ground state. This can be done adiabatically1,88, or by preparation of an ansatz for the ground state71. Adiabatic preparation of the ground state within a gate model simulation requires time evolution of the wavefunction, which is efficient. However, the length of time for which one must evolve is determined, as for all adiabatic algorithms, by the minimum energy gap between ground and first excited states along the adiabatic path. This is unknown in general. Similarly, a successful ansatz state must have significant overlap with the true ground state, and guarantees of this are unavailable in general.

The worst case complexity of generic model chemistries (e.g. local fermionic problems studied with density functional theory) has been shown to be in the quantum mechanical equivalent of NP-Complete, QMA-Complete89,90. However, the subset of these generic models which correspond to stable molecules, or to unstable configurations of chemical interest such as transition states, is small and structured. Just as with adiabatic optimization, it does not matter if molecular electronic structure is QMA-Complete so long as the average instance can be solved (or even approximated) efficiently. In this case we also have considerable heuristic evidence that molecules are able to find their ground state configurations rapidly: these are the configurations in which they naturally occur. Similarly, unstable transition states of interest occur in natural processes. Given that simulation of time evolution on a quantum computer is efficient, we conjecture that simulation of the natural processes that give rise to these states will also be practical.

The proofs that Local Hamiltonian (a decision problem capturing the complexity of finding the ground state energy) is QMA-Complete relies on the construction of various specific Hamiltonians that can represent any possible instance of any problem in QMA. In general, these Hamiltonians possess couplings between more than two qubits. Hamiltonians which contain many-body interactions of order k and lower are referred to as k-local Hamiltonians; experimentally programmable couplings are 2-local. The original formulation by Kitaev was (log n)-local, he then reduced this to 5-local and that result was subsequently reduced to 3-local. To reduce 3-local Hamiltonians to 2-local Hamiltonians “perturbative gadgets” were introduced by Kempe et al.77, which can embed a k-local Hamiltonian in a subspace of a 2-local Hamiltonian using ancilla qubits. In the past decade, a growing body of work has pushed the development of different gadgets which embed various target Hamiltonians with various tradeoffs in the resources required78,79,80,91,92,93,94.

Embedding problems in realizable Hamiltonians requires careful consideration of the availability of experimental resources. One consideration is that many-body qubit interactions cannot be directly realized experimentally. Another factor is the “control precision” of the Hamiltonian which is the dynamic range of field values which a device must be able to resolve in order to embed the intended eigenspectrum to a desired accuracy. This resource is especially important for molecular electronic structure Hamiltonians as chemists are typically interested in acquiring chemical accuracy (0.04 eV). Control precision is often the limiting factor when a Hamiltonian contains terms with coefficients which vary by several orders of magnitude. Other considerations include the number of qubits available as well as the connectivity and type of qubit couplings.

In this paper, we describe a scalable method which allows for the application of the quantum adiabatic algorithm to a programmable physical system encoding the molecular electronic Hamiltonian. Our method begins with the second quantized representation of molecular electronic structure in which the Hamiltonian is represented with fermionic creation and annihilation operators. The first step in our protocol is to convert the fermionic Hamiltonian to a qubit Hamiltonian using the Bravyi-Kitaev transformation73,74. We show that using the Bravyi-Kitaev transformation instead of the Jordan-Wigner transformation is necessary for avoiding exponential control precision requirements in an experimental setting. Next, we show a new formulation of perturbative gadgets motivated by77,80 that allows us to remove all terms involving YY couplings in a single gadget application (note that throughout this paper we use X, Y and Z to denote the Pauli matrices and these operators are defined to act as identity on unlabeled registers so that the dot product YiYj is understood to represent the tensor product Yi Yj). Finally, we apply the gadgets described in78 to produce a 2-local Hamiltonian with only ZZ, XX and ZX couplings.

The paper is organized as follows. In the first section we review the second quantized formulation of the electronic structure problem. Next we give the mapping of this problem to qubits. In the third section we introduce the gadgets that we will use for locality reduction. Finally, we apply our procedure to a simple example: molecular hydrogen in a minimal basis. We close the paper with some discussion and directions for future work.

Second Quantization

We begin by writing down the full configuration interaction (FCI) Hamiltonian in the occupation number basis. We define spin orbitals as the product of a spin function (representing either spin up or spin down) and a single-electron spatial function (usually molecular orbitals produced from a Hartree-Fock calculation). For example, in the case of molecular hydrogen there are two electrons and thus, two single-electron molecular orbitals, |ψ1〉 and |ψ2〉. Electrons have two possible spin states, |α〉 (spin up) and |β〉 (spin down). The four spin orbitals for molecular hydrogen are therefore, |χ0〉 = |ψ1〉|α〉, |χ1〉 = |ψ1〉|β〉, |χ2〉 = |ψ2〉|α〉, and |χ3〉 = |ψ2〉|β〉.

The occupation number basis is formed from all possible configurations of n spin orbitals which are each either empty or occupied. We represent these vectors as a tensor product of individual spin orbitals written as |fn−1f0〉 where indicates the occupation of spin orbital |χj〉. Any interaction between electrons can be represented as some combination of creation and annihilation operators and aj for . Because fermionic wavefunctions must be antisymmetric with respect to particle label exchange, these operators must obey the fermionic anti-commutation relations, With these definitions we write the second-quantized molecular electronic Hamiltonian, The coefficients hij and hijkl are single and double electron overlap integrals which are precomputed classically. The number of distinct integrals scale as O (n4) in the number of molecular orbitals n.

Qubit Representation

The next step in our reduction will be to represent our fermionic wavefunction in terms of qubits. We use the direct mapping introduced in1 that maps an occupancy state to a qubit basis state. Using Pauli operators we can represent qubit raising and lowering operators as, However, these operators do not obey the fermionic commutation relations given in Eq. 1. To write qubit operators that obey the commutation relations in Eq. 1, we could use the Jordan-Wigner transformation1,75,76.

Unfortunately, the Jordan-Wigner transformation is not a scalable way to reduce electronic structure to an experimentally realizable Hamiltonian for AQC. This is because the Jordan-Wigner transformation introduces k-local interaction terms into the Hamiltonian and k grows linearly in the system size. Prima facie, this is not a major problem because there exist theoretical tools known as perturbative gadgets which allow for reductions in interaction order. However, in all known formulations of perturbative gadgets, control precision increases exponentially in k. Thus, the linear locality overhead introduced by the Jordan-Wigner transformation translates into an exponential control precision requirement in the reduction.

An alternative mapping between the occupation number basis and qubit representation, known as the Bravyi-Kitaev transformation, introduces logarithmic locality overhead73,74. Two pieces of information are required in order to correctly construct creation and annihilation operators that act on qubits and obey the fermionic commutation relations. First, the occupancy of each orbital must be stored. Second, parity information must be stored so that for a pair of orbitals, it is possible to determine the parity of the occupancy of the orbitals that lie between them. This parity determines the phase which results from exchanging the occupancy of the two orbitals.

The occupation number basis stores the occupation directly in the qubit state (hence the name). This implies that occupancy is a fully local variable in this basis; one may determine the occupancy of an orbital by measuring a single qubit. However, this also implies that the parity information is completely non-local. It is this fact that determines the structure of the qubit creation and annihilation operators in the Jordan-Wigner transformation. Each such operator changes the state of a single qubit j (updating the occupancy information) but also acts on all qubits with indices less than j to determine the parity of their occupancy. This results in qubit operators, expressed as tensor products of Pauli matrices, that contain strings of Z operators whose length grows with the number of qubits. One could consider storing the parity information locally, so that the qubit basis states store sums of orbital occupancies. Then determination of parity requires a single qubit operation. However, updating occupancy information requires updating the state of a number of qubits that again grows with the number of qubits. Hence this “parity basis” construction offers no advantage over the Jordan Wigner transformation74.

The Bravyi-Kitaev transformation offers a middle ground in which both parity and occupancy information are stored non-locally, so neither can be determined by measurement of a single qubit73,74. Both parity and occupancy information can be accessed by acting on a number of qubits that scales as the logarithm of the number of qubits. This logarithmic scaling makes the proposed mapping of electronic structure to a 2-local qubit Hamiltonian efficient.

The consequences of this mapping, originally defined in74, were computed for electronic structure in73. That work defines several subsets of qubits in which the parity and occupancy information is stored. The occupancy information is stored in the update set, whereas the parity information is stored in the parity set. These sets are distinct and their size is strictly bounded above by the logarithm base two of the number of qubits. The total number of qubits on which a qubit creation and annihilation operator may act can be a multiple of the logarithm base two of the number of qubits. However, this multiple is irrelevant from the point of view of the scalability of the construction. Using the Bravyi-Kitaev transformation, the spin Hamiltonian for molecular hydrogen in the minimal (STO-3G) basis, as reported in73, is given by where the integral values (in Hartree) are, In general, the Bravyi-Kitaev transformation applied to electronic structure produces an n-qubit Hamiltonian which is (log n)-local, and has n4 real terms. This implies that each term has an even number of Y terms, or none.

Hamiltonian Gadgets

In order to embed electronic structure in an experimentally realizable Hamiltonian, we define a scalable methodology for transforming our (log n)-local qubit Hamiltonian into a 2-local Hamiltonian with only ZZ, XX and XZ interaction terms. In this section we will describe tools known as “gadgets” which allow us to simulate the target Hamiltonian with these interactions.

Hamiltonian gadgets provide a method for embedding the eigenspectra (and sometimes eigenvectors) of an n-qubit “target” Hamiltonian, denoted by Htarget, in a restricted (typically low-energy) subspace of a more constrained (N > n)-qubit “gadget” Hamiltonian, denoted by . To illustrate the general idea of gadgets, we describe how a 2-local Hamiltonian can embed a k-local Hamiltonian. Suppose that we have a gadget Hamiltonian, , which contains only 2-local terms which act on N = n + a qubits. Then, where {fi} are scalar coefficients, and are the eigenvectors and eigenvalues of , and {Oi} are the 2-local interaction terms of the physical Hamiltonian. We choose our interaction terms to be Hilbert-Schmidt orthogonal so that Tr [OiOj] = 2nδi,j. We now define an effective Hamiltonian which has support on the lowest 2n states of the gadget, Here Π is a projector onto a particular state (usually the lowest energy state) of the a ancilla qubits and the {Oi} are a Hilbert-Schmidt orthogonal operator basis for operators on the space of the n logical qubits. In other words, the most general representation of Heff is an expansion of all possible tensor products acting on the logical qubits. In general, there is no reason why fi = 0 on all non-2-local terms. Therefore a 2-local gadget on N = n + a qubits can embed a (k > 2)-local, n-qubit Hamiltonian using a ancilla bits.

The use of perturbation theory to derive Hamiltonian gadgets was introduced by Kempe et al. in their canonical proof showing that 2-Local Hamiltonian is QMA-Complete77. Their construction, which we refer to as the “bit-flip construction” for reasons that will become obvious later on, was analyzed by Jordan and Farhi using a formulation of perturbation theory due to Bloch78. Other perturbative gadget constructions were introduced by Oliveira and Terhal to prove the QMA-Completeness of Hamiltonian on a square lattice79. Following this work, Biamonte and Love used gadgets to show that XX and ZZ, or XZ couplings alone, suffice for the QMA-Completeness of 2-local Hamiltonian92. Several other papers improve these gadgets from an experimental perspective and introduce novel constructions which are compatible with the protocol developed here80,91,93,94. We note that different types of gadgets may have specific advantages when designing Hamiltonians for specific hardware. Results from80 suggest that there is a rough tradeoff between the number of ancillae required and the amount of control precision required. For instance, Figure 2 indicates that bit-flip gadgets require less control precision than other gadget constructions (but generally more ancillae). In this paper we focus on the bit-flip family of gadgets.

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 .
Figure 2

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 construction77,78, the Oliveira and Terhal construction79 and an improved variant on Oliveira and Terhal by Cao et al.80.

Although we employ the perturbation theory approach here, it does require a high degree of control precision and should be avoided when possible. We point out that when the Hamiltonian is entirely diagonal there are exact gadgets94 which can embed the ground state with far less control precision and often far fewer ancillae but in a way that does not necessarily conserve the gap scaling. Moreover, “frustration-free” gadgets have been used extensively in proofs of the QMA-Completeness of various forms of quantum satisfiability, and in restricting the necessary Hamiltonian terms for universal adiabatic quantum computing95,96,97,98.

While several types of perturbation theory have been used to derive these gadgets, we closely follow the approach and notation of Kempe et al.77. We wish to analyze the spectrum of the gadget Hamiltonian, for the case that the norm of the perturbation Hamiltonian, V, is small compared to the spectral gap between the ground state and first excited state of the unperturbed Hamiltonian, H. To accomplish this we use the Green's function of , We also define G(z) using the same expression except with H instead of . Further, let be the Hilbert space of where is the “high-energy” subspace spanned by eigenvectors of with eigenvalues and is the complementary “low-energy” subspace, spanned by eigenvectors of corresponding to eigenvalues of . Let Π± correspond to projectors onto the support of . In a representation of , all the aforementioned operators V, H, , G(z), are block-diagonal so we employ the notation that A±± = Π±A Π± and, Finally, we define the operator function known as the self-energy, We use this notation to restate the “gadget theorem”.

Theorem 1 Theorem 6.2 in77. Assume that H has a spectral gap Δ around the cutoff λ*; i.e. all of its eigenvalues are in (−∞, λ] +, +∞) where λ+ = λ* + Δ/2 and λ = λ* − Δ/2. Assume that ||V|| ≤ Δ/2. Let be arbitrary. Assume there exists an operator Heff such that λ (Heff) [c, d] for some and, moreover, the inequality holds for all . Then each eigenvalue of is to the jth eigenvalue of Heff.

Theorem 1 assures us that the eigenspectrum of the self-energy provides an arbitrarily good approximation to the eigenspectrum of the low-energy subspace of the gadget Hamiltonian. This is useful because the self-energy admits a series expansion, Using G+ = (z − Δ)−1 1+ and H = 0, we focus on the range and find that, We use this effective Hamiltonian to approximate our k-local target Hamiltonian, which we now specify. The terms in our target Hamiltonian will have a locality that scales logarithmically with the number of orbitals. We may write such a term: One can always apply gadgets term by term to reduce locality; however, this may not be the optimal procedure. In addition, we are interested in replacing even tensor powers of the Y operator. For both these reasons we consider a slightly more general form of term as a target for gadgetization. We use the fact that it is only the commuting nature of the {Oi} that is important for the gadget to function. We therefore write our target term as a product of k commuting operators, which includes the special case in which it is a product of k operators acting on distinct tensor factors, Hence, we can represent the target Hamiltonian as a sum of r terms which are the product of k commuting operators, where all {Os,i} commute for a given s and Helse can be realized directly by the physical Hamiltonian. While previous formulations of bit-flip gadgets77,78,80 have gadgetized operators acting on distinct tensor factors, it is only necessary that the operators commute. Their action on distinct tensor factors is sufficient but not necessary for the gadget construction. We take advantage of this property in order to realize YY terms without access to such couplings by making the substitution, YiYj → −XiXjZiZj. Since XiXj commutes with ZiZj, we can create this effective interaction with a bit-flip gadget. For instance, suppose we have the term, Z0Y1Y2. We gadgetize the term A · B · C where A = Z0, B = −X1X2, and C = Z1Z2 and all operators A, B, C commute. We note that another approach to removing YY terms is explained in80.

We now introduce the form of the penalty Hamiltonian that acts only on the ancilla qubits. Bit-flip gadgets introduce an ancilla system which has two degenerate ground-states, usually taken to be |111…〉u and |000…〉u where u indicates that these kets refer to an ancilla space. For each of the r terms we use a separate ancilla system of the form, Again, we use u to indicate that operators act on an ancilla; e.g. the label u3,2 indicates the ancilla corresponding to O3,2 (the second operator in the third term). For each term we follow Farhi and Jordan in introducing an ancilla system connected by a complete graph with equal and negative edge weights. Thus, the ground state of the ancilla system is spanned by |111…〉u and |000…〉u.

Next, we introduce the perturbation Hamiltonian, where and Λ is a 2-local operator on logical bits which will be discussed later. The effect of this Hamiltonian on the low energy subspace is to introduce virtual excitations into the high energy space that modify the low energy effective Hamiltonian. Only terms which start and end in the ground state contribute to the perturbation series for the self-energy (see, for example, Figure 3). Thus, the gadget will produce the target term at order k in which a transition between the two degenerate ground states of the ancillae requires that each of the Xu terms in the perturbation act exactly once to flip all r · k bits from one ground state to the other. Crucially, the order in which the ancillae are flipped does not matter since the operators Os,i commute for a given s. The complete gadget is and is related to the target Hamiltonian and effective Hamiltonian by, for the appropriate choice of Λ and where Π projects onto the ancillae ground space, To illustrate the application of such a gadget and demonstrate how Λ is chosen, we scalably reduce the locality of molecular hydrogen and remove all Y terms in the next section.

Figure 3: The six equivalent bit-flip processes at third order which produce the effective interaction A · B · C.
Figure 3

Each of these diagrams also occurs backwards on the part of the ground state in |111〉.

For the example Htarget = A · B · C + Helse, the perturbation is Its components in the low energy subspace, as in the block diagonal representation of Eq. 9 is: The projection into the high energy subspace is: The projections coupling the low and high energy subspaces are: and V−+ = (V+−). Substituting these values into Eq. 12 we see that at order k = 3 a term appears with the following form, These terms arise because all ancilla qubits must be flipped and there are six ways of doing so, representing 3! (in general this will be k! for a gadget with k ancillae) combinations of the operators. These six terms are represented diagrammatically in Figure 3. Note that it is the occurrence of all orderings of the operators A, B and C that imposes the requirement that these operators commute. Hence, in order to realize our desired term we see that . A few competing processes occur which contribute unwanted terms but these terms either vanish with increasing spectral gap Δ, or they can be removed exactly by introducing terms into the compensation term Λ. A simple way to compute Λ is to evaluate the perturbation series to order k and choose Λ so that problematic terms disappear.

At higher orders we encounter “cross-gadget contamination” which means that processes occur involving multiple ancilla systems, causing operators from different terms to interact. For a 3-operator gadget, such terms will always only contribute at order O−3). In reductions which require going to higher orders, these terms do not necessarily depend on Δ, and so may introduce unwanted terms into the effective Hamiltonian. For instance, Figure 4 shows an example of the four processes which occur at fourth order for a multiple term, 4-operator reduction. The diagrams involving multiple ancilla registers are examples of cross-gadget contamination.

Figure 4: Diagrams showing an example of each of the four processes at fourth order.
Figure 4

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.

However, if terms are factored into tensor products of operators that square to the identity (as is the case for products of Pauli operators, which is always possible), cross-gadget contamination can only contribute a constant shift to the energy which can be compensated for in Λ. This is because any process contributing to the perturbation series which does not transition between the two different ground states must contain an even multiple of each operator and if we choose to act on the non-ancilla qubits with operators that square to identity we obtain only a constant shift. Consider the two cross-gadget terms represented in these diagrams: and D2B1D2B1 = (D2B1)2 = 1. At even higher orders, individual cross-gadget terms might not equal a constant shift (i.e. the sixth order term A1A2A3A2A1A3) but the occurrence of all combinations of operators and the fact that all Pauli terms either commute or anti-commute will guarantee that such terms disappear. In the sixth order example, if [A1, A2] = 0 then A1A2A3A2A1A3 = A1A2A3A1 A2A3 = (A1A2A3)2 = 1, otherwise [A1, A2]+ = 0 which implies that A1A2A3A2A1A3 + A1A2A3A1A2A3 = 0.

Example Problem: Molecular Hydrogen

We begin by factoring and rewriting the k-local molecular hydrogen Hamiltonian from Eq. 4 into a 4-local part and a 2-local part so that where,

In order to reduce to a 2-local ZZ/XX/XZ-Hamiltonian we further factor H4L to remove YY terms, Within each term, the operators all commute so that [Ai, Bi] = [Ai, Ci] = [Bi, Ci] = 0. We emphasize that factoring terms into commuting operators is always possible and necessary in order for bit-flip gadgets to work correctly.

Each of the operators defined in Eq. 28 will have a corresponding ancilla qubit labelled to indicate the operator with which it is associated, e.g. the ancilla for operator B2 has label b2. Our unperturbed Hamiltonian is a sum of fully connected ancilla systems in which each ancilla system corresponds to a term, The spectral gap and Hamiltonian have the subscript “1” to associate them with the first of two applications of perturbation theory. We perturb the ancilla system with the Hamiltonian, where and Λ 1 is a 2-local compensation Hamiltonian acting on the logical qubits only. Later on, Λ 1 will be chosen to cancel extraneous terms from the perturbative expansion. The interaction terms involving A, B, and C will arise at third order (V−+V+V+−) from processes which involve a transition between the two degenerate ground states of the ancilla systems. This occurs at third order because to make the transition , we must flip all three ancilla bits in each term by applying the operators Xa, Xb, and Xc. Since these operators are coupled to A, B, and C, sequential action of bit flip operators yields our desired term. Because the operators commute, the order of the bit flipping does not matter. We now calculate the effective Hamiltonian using the perturbative expansion of the self-energy from Eq. 12.

Second Order

The only processes which start in the ground state and return to the ground state at second order are those which flip a single bit and then flip the same bit back. Thus, effective interactions are created between each operator and itself, These processes are shown in Figure 5.

Figure 5: The three bit-flip processes at second order.
Figure 5

These occur for each term. Note that each of these diagrams occurs in reverse for the part of the ground state in |111〉.

The second order effective Hamiltonian at large Δ1 is,

Third Order

The target Hamiltonian terms appears at third order from processes that transition between degenerate ground states. However, there is also an additional, unwanted process which occurs at this order. This competing process involves one interaction with H2L and Λ1 in the high-energy subspace, These processes are illustrated diagrammatically in Figure 6.

Figure 6: Diagrams for the competing process encountered at third order.
Figure 6

Note that each of these diagrams can also occur backwards if the system starts in |111〉.

The process we want occurs with the ancilla transition which flips all three bits (for each term separately since they have different ancillae). There are 3! = 6 possible ways to flip the bits for each term, (these processes are illustrated in Figure 3), Because H2L has no Δ1 dependence and µ1 is order , terms such as will vanish in the limit of large Δ1; therefore, the third order effective Hamiltonian is, with error . We see that if then the unwanted contribution at third order will go to zero in the limit of large Δ1 and the second order term will cancel exactly with Λ1. Thus, where “→” denotes an embedding. There are still 3-local terms remaining in V1, With this notation we reorganize our Hamiltonian a final time, so that ,

The third order gadget we need to reduce H3L takes exactly the same form as before except with the term labels 1, 2, 3 exchanged for the term labels 4, 5, 6. The components of the final gadget are and where and This time the spectral gap and Hamiltonian have the subscript “2” to associate them with our second application of perturbation theory. We have thus shown the embedding . We present an interaction graph for the embedded Hamiltonian in Figure 7.

Figure 7: Interaction graph for embedded molecular hydrogen Hamiltonian.
Figure 7

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).

Conclusion

We have presented a fully general method for mapping any molecular electronic structure instance to a 2-local Hamiltonian containing only ZZ, XX and XZ terms. Our method is scalable in the sense that all experimental resources (qubits, control precision, graph degree) scale polynomially in the number of orbitals. We used perturbative gadgets which embed the entire target Hamiltonian (as opposed to just the ground state), thus guaranteeing that the eigenvalue gap is conserved under our reduction. Furthermore, we showed that bit-flip gadgets can be applied to remove experimentally challenging YY terms. The resulting Hamiltonian is suitable for implementation in superconducting systems, quantum dots and other systems of artificial spins with the correct engineered interactions.

Further reduction of the types of interactions present is possible, to either ZZ and XX terms or ZZ and XZ terms, using the techniques of92. This makes the required interactions for simulating electronic structure Hamiltonians equivalent to the requirements of universal adiabatic quantum computation92. However, repeated reduction of the Hamiltonian results in more stringent precision requirements. The chosen target set of interactions strikes a balance between control precision and a reasonable set of distinct types of controllable interaction. The techniques developed here could also be applied to interacting fermion problems on the lattice. However, in that case it is possible to improve beyond the Bravyi-Kitaev mapping and exploit the locality of the interactions to directly obtain Hamiltonians whose locality is independent of the number of orbitals99.

We propose to read out energy eigenvalues using the tunneling spectroscopy of a probe qubit. This technique has already been demonstrated experimentally with rf SQUID flux qubits in32. In this scheme, a probe qubit is coupled to a single qubit of the simulation. Tunneling transitions allow the probe qubit to flip when the energy bias of the probe is close to an eigenvalue of the original system. Hence detection of these transitions reveals the eigenspectrum of the original system. In this way, we would be able to directly measure the eigenspectra of the molecular systems embedded into the spin Hamiltonian using the techniques developed in the present paper. Alternatively, one could evaluate the energy by determining the expectation value of each term in the Hamiltonian via projective measurements.

There has been rapid recent progress in new classical algorithms, such as DMRG (density matrix renormalization group) and related tensor network methods, and proving complexity and approximability results pertaining to minimal resource model Hamiltonians. By using and understanding the techniques we have introduced in this paper, problems in chemistry can be reduced to such models and these discoveries can be leveraged to make advances in electronic structure theory. However, we note that the spin Hamiltonians that result from the mapping developed here will be non-stoquastic, and classical simulation techniques will therefore suffer from the fermionic sign problem100. This further motivates the construction of quantum hardware to address the electronic structure problem by quantum simulation of these spin Hamiltonians.

References

  1. 1.

    , , & Simulated Quantum Computation of Molecular Energies. Science. 309, 20; 10.1126/science.1113479 (2006).

  2. 2.

    , , , & Gate-count estimates for performing quantum chemistry on small quantum computers. Phys. Rev. A 90, 022305; 10.1103/PhysRevA.90.022305 (2014).

  3. 3.

    , & Simulation of Electronic Structure Hamiltonians Using Quantum Computers. Mol. Phys. 2, 106–111; 10.1080/00268976.2011.552441 (2010).

  4. 4.

    et al. The Trotter Step Size Required for Accurate Quantum Simulation of Quantum Chemistry. e-print arXiv: 1406.4920; (2014). URL .

  5. 5.

    , , & Improving Quantum Algorithms for Quantum Chemistry. e-print arXiv: 1403.1539; (2014).

  6. 6.

    , , & Exploiting locality in quantum computation for quantum chemistry. e-print arXiv: 1407.7863; (2014). URL .

  7. 7.

    , , & Quantum Computation by Adiabatic Evolution. e-print arXiv: 0001106; (2000). URL .

  8. 8.

    et al. A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem. Science 292, 472–475; 10.1126/science.1057726 (2001).

  9. 9.

    & Beweis des Adiabatensatzes. Zeitschrift für Phys. A 51, 165–180 (1928).

  10. 10.

    & Necessary Condition for the Quantum Adiabatic Approximation. Phys. Rev. A 81, 5; 10.1103/PhysRevA.81.032308 (2009).

  11. 11.

    Adiabatic quantum computing for random satisfiability problems. Phys. Rev. A 67, 22314; 10.1103/Phys-RevA.67.022314 (2003).

  12. 12.

    Adiabatic Quantum Algorithms for the NP-Complete Maximum-Weight Independent Set, Exact Cover and 3SAT Problems. e-print arXiv: 1004.2226; (2010). URL .

  13. 13.

    , , & Classical and quantum annealing in the median of three-satisfiability. Phys. Rev. A 83, 12309; 10.1103/PhysRevA.83.012309 (2011).

  14. 14.

    et al. Performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs. Phys. Rev. A 86; 10.1103/PhysRevA.86.052334 (2012).

  15. 15.

    et al. Quantum annealing with more than one hundred qubits. e-print arxiv: 1304.4595; (2013).

  16. 16.

    , , , & Finding low-energy conformations of lattice protein models by quantum annealing. Sci. Rep. 2; 10.1038/srep00571 (2012).

  17. 17.

    et al. Construction of Energy Functions for Lattice Heteropolymer Models: Efficient Encodings for Constraint Satisfaction Programming and Quantum Annealing. Adv. Chem. Phys. 155, 201–243; 10.1002/9781118755815.ch05 (2014).

  18. 18.

    , , , & Construction of non-convex polynomial loss functions for training a binary classifier with quantum annealing. e-print arXiv: 1406.4203; (2014). URL .

  19. 19.

    , , & Robust Classification with Adiabatic Quantum Optimization. e-print arXiv: 1205.1148; (2012). URL .

  20. 20.

    & Quantum search by local adiabatic evolution. Phys. Rev. A 65, 42308; 10.1103/Phys-RevA.65.042308 (2002).

  21. 21.

    & Adiabatic quantum search algorithm for structured problems. Phys. Rev. A 68, 62312; 10.1103/PhysRevA.68.062312 (2003).

  22. 22.

    , & Adiabatic Quantum Algorithm for Search Engine Ranking. Phys. Rev. Lett. 108, 230506; 10.1103/PhysRevLett.108.230506 (2012).

  23. 23.

    et al. A Near-Term Quantum Computing Approach for Hard Computational Problems in Space Exploration. Electr. Eng. 68; (2012).

  24. 24.

    On the computational complexity of Ising spin glass models. J. Phys. A. Math. Gen. 15, 3241; 10.1088/0305-4470/15/10/028 (1982).

  25. 25.

    & Quantum complexity theory. SIAM J. Comput. 26, 1411–1473 (1997).

  26. 26.

    et al. Sign-and magnitude-tunable coupler for superconducting flux qubits. Phys. Rev. Lett. 98, 177001; 10.1103/PhysRevLett.98.177001 (2007).

  27. 27.

    et al. Probing Noise in Flux Qubits via Macroscopic Resonant Tunneling. Phys. Rev. Lett. 101, 117003; 10.1103/PhysRevLett.101.117003 (2008).

  28. 28.

    et al. Synchronization of multiple coupled rf-SQUID flux qubits. New J. Phys. 11, 123022; 10.1088/1367-2630/11/12/123022 (2009).

  29. 29.

    et al. Geometrical dependence of the low-frequency noise in superconducting flux qubits. Phys. Rev. B 79, 60509; 10.1103/PhysRevB.79.060509 (2009).

  30. 30.

    et al. Landau-Zener transitions in a superconducting flux qubit. Phys. Rev. B 80, 12507; 10.1103/Phys-RevB.80.012507 (2009).

  31. 31.

    et al. A scalable readout system for a superconducting adiabatic quantum optimization system. Supercond. Sci. Technol. 23, 105014; 10.1088/0953-2048/23/10/105014 (2010).

  32. 32.

    et al. Tunneling spectroscopy using a probe qubit. Phys. Rev. B 87, 020502; 10.1103/PhysRevB.87.020502 (2013).

  33. 33.

    et al. Quantum annealing with manufactured spins. Nature 473, 194–198; 10.1038/nature10012 (2011).

  34. 34.

    et al. Thermally assisted quantum annealing of a 16-qubit problem. Nat. Commun. 4, 1903; 10.1038/ncomms2920 (2013).

  35. 35.

    , & Error-corrected quantum annealing with hundreds of qubits. Nat. Commun. 5, 3243; 10.1038/ncomms4243 (2014).

  36. 36.

    , , , & Experimental Determination of Ramsey Numbers. Phys. Rev. Lett. 111, 130505; 10.1103/PhysRevLett.111.130505 (2013).

  37. 37.

    et al. Comment on: “Classical signature of quantum annealing”. e-print arXiv: 1305.5837; (2013). URL .

  38. 38.

    & Classical signatures of quantum annealing. e-print arXiv: 1305.4904; (2013). URL .

  39. 39.

    Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 1484–1509; 10.1137/S0097539795293172 (1997).

  40. 40.

    et al. Exponential algorithmic speedup by a quantum walk. Proc. thirty-fifth Annu. ACM Symp. Theory Comput. 35, 59–68; 10.1145/780542.780552 (2003).

  41. 41.

    A fast quantum mechanical algorithm for database search. In: Proc. twenty-eighth Annu. ACM Symp. Theory Comput., STOC ′96, 212–219; 10.1145/237814.237866 (1996).

  42. 42.

    Simulating physics with computers. Int. J. Theor. Phys. 21, 467–488; 10.1007/BF02650179 (1982).

  43. 43.

    From quantum cellular automata to quantum lattice gases. J. Stat. Phys. 85, 551–574; 10.1007/BF02199356 (1996).

  44. 44.

    Simulations of many-body quantum systems by a quantum computer. e-print arXiv: 9603028; (1996). URL .

  45. 45.

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

  46. 46.

    & Simulating Ising spin glasses on a quantum computer. Phys. Rev. E (Statistical Phys. 56, 3661–3681; 10.1103/PhysRevE.56.3661 (1997).

  47. 47.

    & Simulating quantum mechanics on a quantum computer. Phys. D-Nonlinear Phenom. 120, 30–42; 10.1016/S0167-2789(98)00042-6 (1998).

  48. 48.

    Efficient Simulation of Quantum Systems by Quantum Computers. Fortschritte der Phys. 46, 877–879; 10.1002/(SICI)1521-3978(199811)46:6/8877::AID-PROP877>3.0.CO;2-A (1998).

  49. 49.

    & Quantum Algorithm Providing Exponential Speed Increase for Finding Eigenvalues and Eigenvectors. Phys. Rev. Lett. 83, 5162–5165; 10.1103/PhysRevLett.83.5162 (1999).

  50. 50.

    , , & Efficient Quantum Algorithms for Simulating Sparse Hamiltonians. Commun. Math. Phys. 270, 359–371; 10.1007/s00220-006-0150-x (2007).

  51. 51.

    , , , & Polynomial-time quantum algorithm for the simulation of chemical dynamics. Proc. Natl. Acad. Sci. 105, 18681–18686; 10.1073/pnas.0808245105 (2008).

  52. 52.

    , , & Higher Order Decompositions of Ordered Operator Exponentials. J. Phys. A Math. Theor. 43, 1–21; 10.1088/1751-8113/43/6/065203 (2010).

  53. 53.

    , & Preparation of many-body states for quantum simulation. J. Chem. Phys. 130, 194105–194114; 10.1063/1.3115177 (2008).

  54. 54.

    , & Quantum-circuit design for efficient simulations of many-body quantum dynamics. New J. Phys. 14, 3017; 10.1088/1367-2630/14/10/103017 (2012).

  55. 55.

    Efficient Algorithms for Universal Quantum Simulation. Lect. Notes Comput. Sci. 7948, 1–10; 10.1007/978-3-642-38986-31 (2013).

  56. 56.

    , , , & A Rydberg quantum simulator. Nat. Phys. 6, 382–388; 10.1038/nphys1614 (2010).

  57. 57.

    , , , & Quantum simulation of the wavefunction to probe frustrated Heisenberg spin systems. Nat. Phys. 7, 399–405; 10.1038/nphys1919 (2011).

  58. 58.

    , , & Cold Rydberg atoms for quantum simulation of exotic condensed matter interactions. J. Supercond. Nov. Magn.; 10.1007/s10948-013-2414-y (2013).

  59. 59.

    & Proposal for Verification of the Haldane Phase Using Trapped Ions. Phys. Rev. Lett. 112, 040503; 10.1103/PhysRevLett.112.040503 (2014).

  60. 60.

    , , & Quantum simulation of a lattice Schwinger model in a chain of trapped ions. Phys. Rev. X 3, 18; 10.1103/PhysRevX.3.041018 (2013).

  61. 61.

    et al. Quantum simulation of antiferromagnetic spin chains in an optical lattice. Nature 472, 307–312; 10.1038/nature09994 (2011).

  62. 62.

    et al. Two-dimensional quantum gas in a hybrid surface trap. Phys. Rev. A 80, 21602; 10.1103/Phys-RevA.80.021602 (2009).

  63. 63.

    et al. Trapped-Ion Quantum Simulator: Experimental Application to Nonlinear Interferometers. Phys. Rev. Lett. 89, 247901; 10.1103/PhysRevLett.89.247901 (2002).

  64. 64.

    , , , & Simulating a quantum magnet with trapped ions. Nat. Phys. 4, 757–761; 10.1038/nphys1032 (2008).

  65. 65.

    , & Quantum simulations with cold trapped ions. J. Phys. B At. 42, 4009; 10.1088/0953-4075/42/15/154009 (2009).

  66. 66.

    et al. Experimental performance of a quantum simulator: Optimizing adiabatic evolution and identifying many-body ground states. Phys. Rev. A 88, 12334; 10.1103/PhysRevA.88.012334 (2013).

  67. 67.

    , , , & Simulating chemistry using quantum computers. Annu. Rev. Phys. Chem. 62, 185–207; 10.1146/annurev-physchem-032210-103512 (2010).

  68. 68.

    , , & Efficient quantum circuits for diagonal unitaries without ancillas. New J. Phys. 16, 033040; 10.1088/1367-2630/16/3/033040 (2014).

  69. 69.

    Spin-free quantum computational simulations and symmetry adapted states. J. Chem. Phys. 139; 10.1063/1.4812566 (2013).

  70. 70.

    et al. Simulation of chemical isomerization reaction dynamics on a NMR quantum simulator. Phys. Rev. Lett. 107, 020501; 10.1103/PhysRevLett.107.020501 (2011).

  71. 71.

    et al. A variational eigenvalue solver on a photonic quantum processor. Nat. Commun. 5; 10.1038/ncomms5213 (2014).

  72. 72.

    et al. From transistor to trapped-ion computers for quantum chemistry. e-print arXiv: 1311.3297; (2013). URL .

  73. 73.

    , & The Bravyi-Kitaev transformation for quantum computation of electronic structure. J. Chem. Phys. 137; 10.1063/1.4768229 (2012).

  74. 74.

    & Fermionic quantum computation. Ann. Phys. (N. Y). 298, 18; 10.1006/aphy.2002.6254 (2000).

  75. 75.

    & über das paulische äquivalenzverbot. Zeitschrift für Phys. 47, 631–651 (1928).

  76. 76.

    , , , & Simulating physical phenomena by quantum networks. Phys. Rev. A 65, 17; 10.1103/PhysRevA.65.042323 (2002).

  77. 77.

    , & The Complexity of the Local Hamiltonian Problem. SIAM J. Comput. 35, 30; 10.1137/S0097539704445226 (2004).

  78. 78.

    & Perturbative Gadgets at Arbitrary Orders. Phys. Rev. A 77, 1–8 (2008).

  79. 79.

    & The complexity of quantum spin systems on a two-dimensional square lattice. Quant Inf Comp 8, 19 (2005).

  80. 80.

    , , & Towards Experimentally Realizable Hamiltonian Gadgets. e-print arXiv: 1311.3297; (2013). URL .

  81. 81.

    , , & Adiabatic quantum simulators. AIP Adv. 1; 10.1063/1.3598408 (2011).

  82. 82.

    , , & Quantum algorithm for obtaining the energy spectrum of molecular systems. Phys. Chem. Chem. Phys. 10, 5388–5393; 10.1039/B804804E (2008).

  83. 83.

    & Quantum computing applied to calculations of molecular energies: CH2 benchmark. J. Chem. Phys. 133, 194106; 10.1063/1.3503767 (2010).

  84. 84.

    & Quantum Algorithms for Quantum Chemistry based on the sparsity of the CI-matrix. e-print arXiv: 1311.3297; (2013). URL .

  85. 85.

    et al. Towards Quantum Chemistry on a Quantum Computer. Nat. Chem. 2, 20; 10.1038/nchem.483 (2009).

  86. 86.

    et al. Solving Quantum Ground-State Problems with Nuclear Magnetic Resonance. Sci. Rep. 1; 10.1038/srep00088 (2011).

  87. 87.

    et al. NMR implementation of a molecular hydrogen quantum simulation with adiabatic state preparation. Phys. Rev. Lett. 104, 030502; 10.1103/PhysRevLett.104.030502 (2010).

  88. 88.

    & Adiabatic state preparation study of methylene. J. Chem. Phys. 140, 214111; 10.1063/1.4880755 (2014).

  89. 89.

    & Computational complexity of interacting electrons and fundamental limitations of density functional theory. Nat. Phys. 5, 732–735; 10.1038/nphys1370 (2009).

  90. 90.

    , & Computational complexity in electronic structure. Phys. Chem. Chem. Phys. 15, 397–411; 10.1039/c2cp42695a (2013).

  91. 91.

    , , & Quantum simulation of many-body Hamiltonians using perturbation theory with bounded-strength interactions. Phys. Rev. Lett. 101, 070503; 10.1103/PhysRevLett.101.070503 (2008).

  92. 92.

    & Realizable Hamiltonians for Universal Adiabatic Quantum Computers. Phys. Rev. A 78, 1–7; 10.1103/PhysRevA.78.012352 (2007).

  93. 93.

    & Realization of Universal Adiabatic Quantum Computation with Fewer Physical Resources. Phys. Rev. A 84, 4; 10.1103/PhysRevA.84.042332 (2011).

  94. 94.

    , & Resource Efficient Gadgets for Compiling Adiabatic Quantum Optimization Problems. Ann. Phys. 525, 877–888; 10.1002/andp.201300120 (2013).

  95. 95.

    & New construction for a QMA complete three-local Hamiltonian. J. Math. Phys. 48, 2104; 10.1063/1.2748377 (2007).

  96. 96.

    Fast universal quantum computation with railroad-switch local Hamiltonians. J. Math. Phys. 51, 2201; 10.1063/1.3384661 (2010).

  97. 97.

    & Quantum 3-SAT is QMA1-complete. e-print arXiv: 1302.0290; (2013). URL .

  98. 98.

    , & The Bose-Hubbard model is QMA-complete. e-print arXiv: 1311.3297; (2013).

  99. 99.

    & Mapping local Hamiltonians of fermions to local Hamiltonians of spins. J. Stat. Mech. Theory Exp. P09012; 10.1088/1742-5468/2005/09/P09012 (2005).

  100. 100.

    , , & The Complexity of Stoquastic Local Hamiltonian Problems. Quantum Inf. Comput. 8, 361–385 (2008).

Download references

Acknowledgements

The authors thank Sarah Mostame for helpful comments during revision. R.B. thanks Yudong Cao and Jacob Biamonte for many helpful conversations about perturbative gadgets. A. A.-G. acknowledges funding from National Science Foundation grant CHE-1152291 and the Air Force Office of Scientific Research under contract FA9550-12-1-0046. P.J.L. acknowledges National Science Foundation grant PHY-0955518. A.A.-G. and R. B. thank the Corning Foundation for their generous support. Research sponsored by the United States Department of Defense. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressly or implied, of the United States Government.

Author information

Affiliations

  1. Department of Chemistry and Chemical Biology, Harvard University, Cambridge, MA 02138 USA

    • Ryan Babbush
    •  & Alán Aspuru-Guzik
  2. Department of Physics, Haverford College, Haverford, PA 19041, USA

    • Peter J. Love

Authors

  1. Search for Ryan Babbush in:

  2. Search for Peter J. Love in:

  3. Search for Alán Aspuru-Guzik in:

Contributions

All authors worked closely to develop the main ideas presented in this paper. Computations were carried out by R.B. and P.L. Figures were prepared by R.B. and A.A.-G. All authors contributed equally to the production of the manuscript.

Competing interests

The authors declare no competing financial interests.

Corresponding author

Correspondence to Alán Aspuru-Guzik.

About this article

Publication history

Received

Accepted

Published

DOI

https://doi.org/10.1038/srep06603

Further reading

Comments

By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.