Abstract
Quantum simulation of chemical systems is one of the most promising nearterm applications of quantum computers. The variational quantum eigensolver, a leading algorithm for molecular simulations on quantum hardware, has a serious limitation in that it typically relies on a preselected wavefunction ansatz that results in approximate wavefunctions and energies. Here we present an arbitrarily accurate variational algorithm that, instead of fixing an ansatz upfront, grows it systematically one operator at a time in a way dictated by the molecule being simulated. This generates an ansatz with a small number of parameters, leading to shallowdepth circuits. We present numerical simulations, including for a prototypical strongly correlated molecule, which show that our algorithm performs much better than a unitary coupled cluster approach, in terms of both circuit depth and chemical accuracy. Our results highlight the potential of our adaptive algorithm for exact simulations with presentday and nearterm quantum hardware.
Introduction
Anticipation that a useful quantum computer will be realized in the near future has motivated intense research into developing quantum algorithms which can potentially make progress on classically intractable computational problems. While many research areas expect to see transformative change with the development of such quantum devices, computational chemistry is poised to be among the first domains to significantly benefit from such new technologies. Due to the exponential growth in the size of the Hilbert space with increasing orbitals, a quantum computer with tens of qubits could potentially surpass classical algorithms^{1,2,3}. Achieving such a capability depends not only on the quality of the qubits, but also critically on the efficiency of the algorithms.
The phase estimation algorithm (PEA)^{4} was the first algorithm proposed for simulating electronic structure problems on a quantum computer^{1,5}. PEA provides a path for obtaining the exact ground state electronic energy for a molecule by evolving in time a quantum state with significant overlap with the ground state using the molecular Hamiltonian of interest. Due to the very long circuit depths and complex quantum gates required by PEA, the coherence times needed to simulate interesting electronic states would exceed the coherence times available on any existing or nearterm quantum device. Improvements to PEA still require significant resources and experimental demonstrations to date only involve a few qubits^{6,7,8}.
In order to reduce the significant hardware demands required by PEA and exploit the capabilities of noisy intermediatescale quantum (NISQ) devices^{9}, the variational quantum eigensolver (VQE) algorithm was proposed and demonstrated using photonic qubits by Peruzzo et al.^{10}. This was followed by several theoretical studies on VQE^{7,11,12,13,14,15,16,17} and demonstrations on other hardware such as superconducting qubits^{7,16,18} and trapped ions^{19,20}. Other approaches have been pursued as well, including methods for adiabatic quantum computation^{21} and quantum machine learning^{22}.
VQE is a hybrid quantumclassical algorithm, because the computational work is shared between classical and quantum hardware. VQE starts with an assumption about the form of the target wavefunction. Based on this form, an ansatz with several tunable parameters is constructed, and a quantum circuit capable of producing this ansatz is designed. The ansatz parameters are variationally adjusted until they minimize the expectation value of the molecular Hamiltonian. Classical hardware is used to precompute all the Hamiltonian terms and to update the parameters during the circuit optimization. The quantum hardware is only used to prepare a state (defined by its current set of ansatz parameter values) and to perform measurements of the various interaction terms in the molecular Hamiltonian, \(\hat H = \mathop {\sum}\nolimits_i {g_i} \hat o_i\). Because the individual operator terms, \(\hat o_i\), generally do not commute, the state preparation has to be repeated multiple times, until all the individual operators have been measured enough times to get sufficient statistics on their mean value. Details on all these steps can be found in ref. ^{12}.
Compared to PEA, VQE is much more suitable for NISQ devices, trading in the long circuit depths for shorter state preparation circuits, at the expense of a much higher number of measurements. Although VQE has been demonstrated to be more efficient and errortolerant^{7,12,16}, this comes with the compromise that the ansatz generally only allows one to obtain approximations to the ground state. Because the choice of ansatz determines the variational flexibility of the trial state, the quality of a VQE simulation is only as good as the ansatz.
Several approaches have been explored with the goal of creating a compact ansatz which provides high accuracy with few parameters and shallow circuits. The first ansatz explored^{10} was based on the unitary variant of coupled cluster theory truncated at single and double excitations (UCCSD), inspired by early efforts in computational chemistry to improve coupled cluster theory^{23,24,25,26}. In UCCSD, trial states are generated by applying to a reference state a unitary operator in the form of an exponential of a sum of single and double fermion operators with their coefficients taken as free parameters. More recent proposals based on UCCSD include the unitary Bogoliubov coupled cluster theory which takes a generalized Hartree–Fock (HF) state as the reference^{27} and the kUpCCGSD approach of Lee et al.^{17} which uses k products of unitary paired generalized doubles excitations, along with the full set of generalized single excitations. The kUpCCGSD approach builds on early work by Nakatsuji^{28,29,30,31} and Nooijen^{32} studying the use of generalized excitation terms in classical quantum chemistry algorithms, but prunes the expansive operator list by restricting the twoparticle terms to only paired interactions, which provides a systematic way to converge to FCI without introducing higher excitation rank operators. Ryabinkin et al.^{33} recently proposed a coupled clusterlike ansatz which is constructed directly in the qubit representation with the goal of achieving shallower circuits. While not directly a variation of the UCCSD ansatz itself, ref. ^{16} developed an approach (termed the quantum subspace expansion) to extract not just the expectation value of \(\hat H\) but all the matrix elements \(\langle {\rm{I}}\hat HJ\rangle\) in a small subspace consisting of single excitations from the trial state. This Hamiltonian matrix is then diagonalized on a classical computer, which reduces the impact of decoherence and gives access to excited states. Even further from the original UCC ansatz, Kandala et al.^{18} have used an alternative ansatz for their VQE experiments based on the native entangling gate in their superconducting qubit device, referred to as a “hardwareefficient ansatz”. This allows entanglement to be created directly from a devicewide unitary instead of through a more traditional gate decomposition of a fermionic operator.
Despite these considerable improvements to the UCCSD ansatz for VQE, this remains an approximate approach that works best for systems that are not strongly correlated. However, strongly correlated systems are the hardest to simulate classically, and this is precisely the motivation for performing simulations using quantum computers. While an exact VQE simulation could in principle be performed by adding higher rank excitations to the ansatz, this would be prohibitively expensive for both the classical subroutines and NISQ devices. To overcome these challenges, we need to avoid imposing an ad hoc ansatz and instead allow the system to determine its own compact, quasioptimal ansatz.
In this paper, we achieve this by introducing a simple algorithm termed Adaptive DerivativeAssembled PseudoTrotter ansatz Variational Quantum Eigensolver (ADAPTVQE). ADAPTVQE determines a quasioptimal ansatz with the minimal number of operators for a desired level of accuracy. The key idea is to systematically grow the ansatz by adding fermionic operators oneatatime, such that the maximal amount of correlation energy is recovered at each step. This results in a wavefunction ansatz that is discovered by the algorithm, and which cannot be predicted a priori from a traditional excitationbased scheme like UCCSD. While intuitive, this approach can also be derived more rigorously as a particular optimization procedure for Full Configuration Interaction (FCI) VQE and is more thoroughly discussed in Section 1 of the Supplement. We demonstrate the power of ADAPTVQE through numerical simulations of three molecules of increasing complexity: LiH, BeH_{2}, and H_{6}. In each case, we find vastly improved performance compared to UCCSD, both in terms of the number of operators needed to form the trial states and in terms of chemical accuracy. Therefore, we believe that ADAPTVQE is an ideal hybrid algorithm for NISQ devices.
Results
Specification of the adopted notation
In order to define the approach, several definitions and notations need to be established. First, molecular orbital indices i and j denote occupied orbitals, a and b denote virtual orbitals, and p, q, r, and s denote arbitrary molecular orbitals. In coupled cluster theory, in particular CCSD, an expansion based on the HF state ψ^{HF}〉 is created by using an exponential ansatz involving single and double excitation operators:
where the excitation operators are defined as:
For closed shell molecules near equilibrium, CCSD provides a robust ansatz for molecular simulations. Early efforts to combine size extensivity and variationality were pioneered by Bartlett, Kutzelnigg, and coworkers^{23,24,25}. In this context, a unitary variant of coupled cluster theory (UCCSD) was defined by replacing the excitation operators with an antiHermitian sum of excitation and deexcitation operators:
Because UCCSD is based on a unitary operator, the adjoint is the inverse, and the expectation value of the UCCSD wavefunction can be expanded using the Baker–Campbell–Hausdorff (BCH) formula to obtain a normalized Hamiltonian expectation value (Rayleigh quotient) for variational optimization. Unfortunately, the BCH expansion does not truncate at finite order, making UCCSD computationally intractable on classical hardware. However, the unitary nature of UCCSD is actually a benefit for quantum algorithms as it corresponds to a coherent time evolution, and this was the original motivation for using UCCSD in VQE^{10}.
In addition to a unitary form, CCSD can also be generalized by including excitation operators which immediately annihilate the HF state. These would include excitations from occupied to occupied, virtual to virtual, etc. Generalized excitations or interactions of this form have been considered previously, and have been used in the context of VQE recently by Lee and coworkers^{17}. In this case the cluster operators are further generalized to remove the HFbased subspace restriction: \(\hat \tau _{ij}^{ab} \to \hat \tau _{pq}^{rs}\), where p, q, r, and s refer to any arbitrary orbital.
Although UCCSD is perhaps a natural ansatz for VQE, it cannot be implemented directly as written or as explored previously in the quantum chemistry context. Because the gate model of quantum computation is realistically bound to using gates acting on only a few qubits at a time, the UCCSD operator must be broken up into a timeordered sequence of few (one or two) particle operators. This is achieved by using a Trotter expansion of a matrix exponential^{34},
Because the generalized single and double excitation operators do not commute, the use of a truncated Trotter expansion represents an approximation to the underlying UCCSD ansatz, and recent work has shown clearly that this does not strongly affect the results because the variational flexibility is sufficient to absorb this error^{7}, and that even a single Trotter number (n = 1) is sufficient to reproduce the results of UCCSD. As a result, a unitary, generalized, Trotterized ansatz becomes:
where notation is introduced such that the generalized singles index, s, runs over all unique pairs of p, q and the doubles index, d, over unique combinations of p, q, r, s.
ADAPTVQE algorithm
The above discussion described the Trotter expansion as an approximation to UCCGSD. However, as recognized previously^{7,35}, if the parameters are optimized after the Trotterization, this is not so much an approximation to UCC as it is a wholly unique ansatz. In fact, the exact FCI solution could be obtained by simply going to an nth order Trotterized form of UCCSD and allowing the different parameter replicas to vary independently. This is due to the fact that nbody interactions can be described as products of one and twobody interactions. The exact (FCI) quantum state can thus be represented as an arbitrarily long product of one and twobody operators,
where \(\hat \tau _{pq}^{rs}(k)\) is the kth instance, or “replica”, of the operators in \(\hat t_{pq}^{rs}  \hat t_{rs}^{pq}\). It is important to note that this is not a Trotter approximation to any simple twobody ansatz, as each replica can assume different parameter values, e.g., \(\tau _{pq}^{rs}(k) \, \ne \, \tau _{pq}^{rs}(j)\).
The main goal in this paper is to approximate FCI with arbitrary accuracy using a maximally compact sequence of unitary operators. The basic outline of the algorithm is drawn schematically in Fig. 1 and is as follows:

(1)
On classical hardware, compute one and twoelectron integrals, and transform the fermionic Hamiltonian into a qubit representation using an appropriate transformation: Jordan–Wigner, Bravyi–Kitaev, etc. This is a standard step in regular VQE.

(2)
Define an “Operator Pool”. This is simply a collection of operator definitions which will be used to construct the ansatz. For the examples presented in the next section, we consider the set of all unique spincomplemented one and twobody operators, but one might imagine adding a few threebody or fourbody terms as well.

(3)
Initialize qubits to an appropriate reference state, ideally one with the correct number of electrons. The HF state would be a sensible choice here. Initialize the ansatz to the identity operator.

(4)
On a quantum computer, prepare a trial state with the current ansatz. If multiple quantum computers are available, perform this step on all devices simultaneously.

(5)
Measure the commutator of the Hamiltonian with each operator in the pool to get the gradient. Repeating this multiple times and averaging gives the gradient of the expectation value of the Hamiltonian with respect to the coefficient of each operator. This can be done in parallel.

(6)
If the norm of the gradient vector is smaller than some threshold, ε, exit.

(7)
Identify the operator with the largest gradient and add this single operator to the left end of the ansatz, with a new variational parameter. Note that this does not “drain” the pool in the sense that choosing an operator does not remove it from the pool so it can be used again later.

(8)
Perform a VQE experiment to reoptimize all parameters in the ansatz.

(9)
Go to step 4.
As described above and illustrated in Fig. 1, each iteration starts as a series of uncoupled experiments to obtain the parameter gradients via measurements of operator commutators (the gradient expression in step 5 is derived in section IB of the Supplemental Information). The purpose of these gradient measurements is to determine the best operator with which to grow the ansatz, as the operator with the largest gradient is likely to recover the most correlation energy in the subsequent VQE minimization. This process is continued iteratively, until a convergence threshold is met. In the classical numerical examples presented below, we chose to consider the L^{2} norm of the gradient vector to determine convergence. This is just one possibility, and alternative convergence indicators could be used instead in step 6. At convergence, the ADAPTVQE algorithm obtains the following ansatz:
where the identity of each \(\hat \tau _i\) is determined by the algorithm.
The reoptimization subroutine in step 8 can be implemented on either a classical or quantum processor using any of the gradient or nongradientbased optimization routines that have been proposed or demonstrated for VQE^{12,15,16,18}. Note that this subroutine is distinct from the gradient computed in step 5 of the algorithm. Additional possible modifications to the algorithm are mentioned in the “Discussion” section.
The evaluation of all the gradient terms could in principle be achieved in a NISQfriendly, highly parallel manner with a large number of uncoupled quantum computers all tasked with preparing the same state and measuring a different operator. This is the same potential for parallelization that the underlying VQE subroutine has. Just as with the original motivation for VQE, ADAPTVQE decreases the circuit depth at the expense of a larger number of measurements. In our case a sequence of VQE experiments is performed, with the most resourcedemanding experimental steps happening at the end. This constitutes a rather large prefactor which would scale with the size of the system, but the crucial advantage is controllability over the ansatz accuracy (in principle approaching FCI). Because the number of nonzero parameters equals the number of iterations, in order to discover an ansatz for a large system, an equal number of VQE reoptimizations will need to be performed. One strategy to minimize this prefactor could simply be to add a few operators at a time.
Determining resource requirements for adaptive procedures is rather difficult. The classical resources are not expected to be significant in the foreseeable future. However, as quantum technology progresses toward deeper circuits, the parameter manipulation and updating on a classical computer could become costly. However, we expect the dependence between parameters at the beginning and end of the ADAPTVQE circuit to decay with circuit depth, such that one could imagine freezing the early parameters after a certain number of iterations. This would possibly establish an approach for FCI with only a polynomial number of variables, completely avoiding any exponential cost for the classical hardware.
Molecular dissociation simulation results
In this section, we explore the convergence properties of the ADAPTVQE algorithm with a few small molecular systems, LiH, BeH_{2}, and linear H_{6}. The former two molecules have been simulated using quantum hardware^{18,20}. H_{6} is included as a prototypical strongly correlated molecule, which allows us to test the ADAPTVQE approach for systems which are not well described with unitary coupled cluster.
In order to perform the simulations, an inhouse code was written, using Psi4^{36,37} for the integral calculation (via the OpenFermionPsi4^{38} interface) and OpenFermion was used for the Jordan–Wigner operator transformation. All calculations used the Broyden–Fletcher–Goldfarb–Shannon (BFGS) minimization implemented within Scipy^{39}. To classically simulate the reoptimization subroutine in step 8 of ADAPTVQE, we could use a standard numerical gradient method. However, in order to improve the efficiency and allow precise gradients for tight convergence, we derived and implemented an efficient analytic gradient function, which is detailed in Section D of the Supplement. By reusing intermediates between individual parameter gradients, this algorithm obtains the full gradient vector for all parameters at a cost which is only roughly 2× that of the base energy evaluation. A table with timing data is included in Table 1 of the Supplement.
As discussed in the previous section, the ADAPT ansatz uses a convergence threshold to determine when the calculation should terminate (step 6). Here we use the norm of the gradient vector and compare it to threshold ε_{m}, which we define as
For example, an ADAPTVQE calculation where the norm of the operator pool gradient is converged to less than 0.001 would be denoted as ADAPT(ε_{3}). In what follows we present numerical results for bonddissociation curves for LiH, BeH_{2}, and H_{6} for three different choices of the threshold (m = 1, 2, 3). We also investigate alternate protocols for the ansatz growth and demonstrate the superiority of the ADAPT ansatz.
Here, we study the LiH bond dissociation computed using several methods, including FCI, UCCSD (unTrotterized), HF, ADAPT(ε_{1}), ADAPT(ε_{2}), and ADAPT(ε_{3}), all with the STO3G basis set. In this basis set, LiH has 6 spatial orbitals and a Hilbert space of dimension 4096. By starting with the HF state with two α (spinup) and two β (spindown) electrons and using only number conserving operators, the relevant subspace to explore has a dimension of \(\left( {\begin{array}{*{20}{c}} 6 \\ 2 \end{array}} \right) \cdot \left( {\begin{array}{*{20}{c}} 6 \\ 2 \end{array}} \right) = 225\). In this basis, the occupied orbitals are {1, 2}, and the virtual orbitals are {3, 4, 5, 6}.
The bond dissociation curves are shown in Fig. 2a, where all the curves, with the exception of HF, cannot really be distinguished on this scale. However, as shown in Fig. 2b, when the FCI energy is subtracted and the scale is adjusted, significant differences become evident. Shading is used to indicate chemical accuracy, which is achieved in all cases other than HF. LiH has only a single pair of electrons (a σ bond) breaking along the dissociation coordinate, and UCCSD exhibits chemical accuracy throughout the curve. While ADAPT(ε_{1}) is not as accurate as UCCSD, ADAPT(ε_{2}) is comparable to UCCSD at short bond distances and comfortably outperforms it at longer distances. This is also evident in Table 1, where the average error across the potential energy surface (PES) is shown. Remarkably, ADAPT(ε_{3}) outperforms UCCSD throughout the whole curve by at least an order of magnitude and in some cases up to four orders of magnitude.
Even more impressive is how few parameters are needed to achieve this level of accuracy. As shown in Fig. 2c, in all three cases and for all bond distances, ADAPT is much more compact than UCCSD. UCCSD has 92 parameters, which can be reduced to 64 by combining spincomplements. In all three ADAPT calculations, fewer than half of the parameters are needed compared to UCCSD. Although UCCSD is noticeably more accurate than the simplest ADAPT calculation with a gradient norm threshold of 0.1, the ADAPT(ε_{1}) ansatz is incredibly compact, consisting of fewer than 10 parameters across the curve. For example, the ADAPT(ε_{1}) ansatz for LiH at bond distance 2.39 Å is
which includes a mixture of both double excitations and correlated single excitations \(\left( {\hat n_j\hat a_a^\dagger \hat a_i} \right)\). The indices denote spatial orbitals, overbar on an index denotes β spin, and spincomplemented interactions are implied. For example \(\hat \tau _{01}^{06}\) is really \(\hat \tau _{01}^{06} + \hat \tau _{\bar 0\bar 1}^{\bar 0\bar 6}\). An interesting feature of the ansatz returned by ADAPTVQE, Eq. (10), is that the HOMO–LUMO double excitation \(\left( {e^{\hat \tau _{2\bar 2}^{3\bar 3}}} \right)\) is not the first operator, but instead the third. This is different from what one might expect if classical MP2 or CCSD amplitudes were used to order the ansatz. The reason is that in choosing the next operator no state energy information is used, for instance in the form of a denominator penalizing high energy terms. Interestingly, at convergence it is not the HOMO–LUMO term or the first operator with the largest amplitude, but rather the second operator, \(e^{\hat \tau _{2\bar 2}^{3\bar 6}}\).
In Fig. 2d–f, the dissociation curves for BeH_{2} are shown. In the STO3G basis, BeH_{2} has 7 spatial orbitals, for a total Hilbert space dimension of 16,384, and a neutral molecule subspace of dimension \(\left( {\begin{array}{*{20}{c}} 7 \\ 3 \end{array}} \right) \cdot \left( {\begin{array}{*{20}{c}} 7 \\ 3 \end{array}} \right) = 1225\). Unlike with LiH, UCCSD does not provide chemically accurate results across the full PES. UCCSD and ADAPT(ε_{1}) are comparable at smaller bond distances. Beyond ~3 Å, they both go above 1 kcal/mol in absolute error. However, still with a small fraction of the number of parameters in UCCSD, both ADAPT(ε_{2}) and ADAPT(ε_{3}) provide nearly exact results, with average deviations from FCI listed in Table 1.
Now we move our focus to the H_{6} data. At bondbreaking, the previous two molecules involved strong correlation between only two and four electrons, respectively. In order to evaluate the ability of ADAPTVQE to converge to FCI in the presence of much stronger correlations, we have computed the simultaneous stretching of H_{6}, with the results presented in Fig. 2g–i.
The complexity of this strongly correlated system is reflected in two obvious ways: (1) the failure of UCCSD to achieve chemical accuracy across the curve in Fig. 2h, and (2) the increased number of parameters selected in the ADAPT calculations in Fig. 2i. Despite being strongly correlated, such that higher excitation rank operators should be needed, both ADAPT(ε_{2}) and ADAPT(ε_{3}) provide accurate results with only one and twobody operators. Moreover, in the case of ADAPT(ε_{2}) this is achieved with fewer operators than UCCSD for most bond distances. ADAPT(ε_{3}) also uses fewer parameters than UCCSD up to the distance where UCCSD fails to reach chemical accuracy.
Because the algorithm is adaptive, during the course of a chemical event (bond breaking, isomerization, etc.) the number of parameters can change abruptly, leading to discontinuous potential energy curves. Two notable examples of this can be seen in Fig. 2h, first at R(HH) = 1.8 Å where ADAPT(ε_{1}) experiences a large jump in energy, and second at 2.5 Å where ADAPT(ε_{2}) increases in energy. Figure 2i shows that these energy jumps correspond to sudden drops in parameter counts.
The cause of the discontinuities in the H_{6} data can be explained from the convergence data provided in the Supplement (see Supplement Fig. 1). For larger bond lengths, as additional operators are added to the ansatz, the energy flattens out before dropping substantially again. If the convergence criterion is too lenient, then the ADAPTVQE optimization will abort at such “false gradient troughs”. In the ADAPT(ε_{2}) data of Fig. 2h, i, the jump in energy error and drop in parameter number, respectively, are caused by the 2.5 Å optimization aborting at a false gradient trough, while the optimizations at other bond lengths do not. Of course, if a tighter threshold is used (such as 0.001), the ADAPTVQE algorithm does not prematurely abort, and ultimately yields highaccuracy results, even for this strongly correlated system. More sophisticated convergence checks in step 6 might avoid these situations and will be one focus of future work.
Dependence of convergence on operator ordering
To demonstrate the importance of the gradientbased operator ordering chosen by ADAPTVQE, we compare it to a few alternate procedures for growing the ansatz: (a) Random (ijab): Randomly select from a pool of \(\tau _{ij}^{ab}\), where the indices are restricted to those which do not annihilate the HF reference state. (b) Random (pqrs): Randomly select from a pool of \(\tau _{pq}^{rs}\), where the indices are not restricted. (c) Lexical (ijab): Select from an ordered pool of \(\tau _{ij}^{ab}\), where the indices are restricted to those which do not annihilate the HF reference state. (d) Lexical (pqrs): Select from an ordered pool of \(\tau _{pq}^{rs}\), where the indices are not restricted.
In Fig. 3, we show the convergence of each of these orderings and compare them to ADAPT using BeH_{2} as a typical example. What stands out is that the ADAPT ansatz converges dramatically faster than the other four cases considered. While the two randomgrowth ansätze converge relatively similar to each other regardless of whether restricted indices are used or not, the lexically ordered ansatz shows a clear distinction between the restricted index (singles and doubles) and unrestricted index (generalized singles and doubles) ordering. This is due to the fact that the first operators in the ansatz involve creation operators on the occupied orbitals, and these do not contribute until the wavefunction has become entangled. The unTrotterized UCCSD result is also marked for reference. Overall, the data in Fig. 3 demonstrate that an iterative gradient minimization algorithm yields a highly compact ansatz for a given state.
Discussion
An obvious metric for evaluating the performance of any simulation algorithm can be simply described as some accuracy measure vs. some cost measure. While the accuracy measure in a simulation is often easy to define, the cost measure is more nuanced. For variational quantum simulations, there are two factors which largely determine the overall cost: circuit depth and number of measurements (or shot count). Shot count is important as it determines the time to solution. It is possible that due to the sheer number of measurements, a particular quantum simulation becomes intractable. However, for NISQ devices in which coherence times (and thus number of gates) are limited, circuit depth is usually the most critical cost metric, as it determines whether or not a simulation can occur at all. By taking circuit depth as the most important cost metric to address, the original VQE has been successful by minimizing circuit depth at the cost of increased number of measurements. Similar to the original VQE, our new ADAPTVQE algorithm seeks to further minimize the circuit depth with an increased number of measurements.
In this direction, the data clearly demonstrates that ADAPTVQE succeeds in creating a more compact and accurate wavefunction ansatz than UCCSD. The algorithm achieves this by systematically identifying the optimal set and ordering of operators to use in the wavefunction ansatz for a given problem. The efficiency of ADAPTVQE makes it very promising for quantum chemistry simulations on NISQ devices, where circuit depth limitations remain a significant challenge.
In terms of shotcount, ADAPTVQE will likely have an increased number of measurements compared to UCCSDbased VQE due to the necessary gradient measurements. However, this is perhaps an easier problem to address (compared to circuit depth) as the individual runs can in principle occur simultaneously if several devices exist. Further, the shot count also depends on the number of iterations required for the classical optimization of the ansatz parameters. For strongly correlated systems where perturbation theory fails, the existing approach of using classical MP2 amplitudes to initialize the UCCSD parameters^{12} is not likely to provide much improvement in the UCCSDbased VQE. Alternatively, each iteration of ADAPTVQE only adds a single new parameter, with the previously optimized parameters already being initialized to rather sensible values. This might ultimately decrease the number of iterations needed for the VQE subroutine in ADAPTVQE, thus decreasing the shot count (although this is not likely to fully compensate for the large number of measurements for the gradient). As hardware capabilities continue to increase, in terms of both the size and number of quantum processors available, ADAPTVQE will offer an ideal quantumparallel approach to performing nontrivial quantum chemistry simulations. We therefore expect this algorithm to have a strong impact on these efforts in the near term.
As the name suggests, ADAPTVQE could be classified as one member of a family of adaptivebasis strategies that has seen success in constructing compact manyelectron wavefunctions^{40,41,42,43,44,45,46} and singleelectron wavefunctions^{47,48,49,50,51,52,53}, or as a relative of methods using sequential transformations which have been explored in the context of multireference coupledcluster theory^{54,55}. Of these, the ADAPT ansatz is perhaps most closely related to the @CC method of Lyakh and Bartlett^{47}, in which a compact set of cluster operators is iteratively determined to describe the state of interest on a classical computer. Our approach is distinct in that it is not only designed for a quantum computer implementation, but also defined for a different wavefunction form (product of unitary operators vs. coupled cluster) and a different importance metric (operator gradient of the manyelectron state vs. a single electrondefined importance function, see ref. ^{47}) for determining new parameters.
An important aspect of ADAPTVQE is that several steps of the algorithm can be implemented in multiple ways, lending it still greater versatility across a wide landscape of problems and suggesting that it should perhaps be thought of as a class of algorithms rather than a specific one. In the “Results” section, we already discussed a few algorithmic options, including different ways to perform the gradientbased parameter update and to determine convergence. We also mentioned the possibility of freezing early parameters at later stages of the algorithm in order to speed up the reoptimization steps. Below, we discuss a few more modifications to explore.
Although the ADAPTVQE algorithm is notably not a perturbative approach, it still has a perturbative flavor in that the suitability of the next iteration’s best operator only involves the interaction of that operator with the Hamiltonian. As such, the algorithm may not be able to recognize the best quadruple excitation (for example) during one update. That being said, the physics described by quadruple excitations is ultimately captured after multiple iterations through the product of at least two twobody interactions. The consequence of this is that convergence will likely not be as fast for strongly correlated systems because the algorithm can only “see” two body operators at a time. Because only local knowledge of the FCI energy landscape is used to update the ADAPTVQE ansatz construction, the “true optimally compact ansatz” is not guaranteed. As a result, flat energy landscapes (associated with “false gradient troughs”) are possible. Further classical simulations and device implementations are needed to provide better insight into the numerical behavior.
Fortunately, however, multiple strategies can be pursued to address any possible slow convergence issues. One possible approach would be to add a selection of three or fourbody interactions into the operator pool, such that these could be inserted when needed. Alternatively, one might imagine trying to update the ansatz with two (or more) operators in each iteration, such that the best set of operators is added. The operator pool would still consist of only one and twobody interactions, but higherbody interactions could be incorporated through products of operators. Even further, one might imagine computing the second derivative and using Hessian matrix elements to identify cooperative effects between operators in the pool. We will explore each of these approaches in future work, with the aim of determining the fastest converging algorithm in different chemical scenarios.
In this paper, we presented ADAPTVQE, a novel variational hybrid quantumclassical algorithm designed to achieve exact results at convergence. Unlike typical ansätze, which tends to be ad hoc, our approach is based on an ansatz that is determined by the system being simulated, and it features a welldefined, builtin convergence criterion. Moreover, the parameter count, and thus the gate depth, is kept to a minimum. A detailed description of the algorithm is given, and numerical examples are provided to demonstrate the performance of the ADAPT method with both weakly and strongly correlated systems. Based on these results, we find the ADAPTVQE algorithm to be an operator and parameterefficient method capable of high accuracy, with controllable errors, that routinely outperforms UCCSD. Its compatibility with classical routines for compiling state preparation circuits and quantumparallelism should make ADAPTVQE extremely useful for simulations of molecules on both currently available and future quantum computers.
Data availability
The data for the numerical simulations is available upon reasonable request.
Code availability
The code for the numerical simulations is available upon reasonable request.
References
AspuruGuzik, A., Dutoi, A. D., Love, P. J. & HeadGordon, M. Simulated quantum computation of molecular energies. Science 309, 1704–1707 (2005).
McArdle, S., Endo, S., AspuruGuzik, A., Benjamin, S. & Yuan, X. Quantum computational chemistry. http://arxiv.org/abs/1808.10402 (2018).
Cao, Y. et al. Quantum chemistry in the age of quantum computing. http://arxiv.org/abs/1812.09976 (2018).
Kitaev, A. Y. Quantum measurements and the Abelian stabilizer problem. arXiv eprints. https://arxiv.org/abs/quantph/9511026 (1995).
Lloyd, S. Universal quantum simulators. Science 273, 1073–1078 (1996).
Lanyon, B. P. et al. Towards quantum chemistry on a quantum computer. Nat. Chem. 2, 106–111 (2010).
O’Malley, P. et al. Scalable quantum simulation of molecular energies. Phys. Rev. X 6, 031007 (2016).
Paesani, S. et al. Experimental Bayesian quantum phase estimation on a silicon photonic chip. Phys. Rev. Lett. 118, 100503 (2017).
Preskill, J. Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018).
Peruzzo, A. et al. A variational eigenvalue solver on a photonic quantum processor. Nat. Commun. 5, 4213 (2014).
Whitfield, J. D., Biamonte, J. & AspuruGuzik, A. Simulation of electronic structure Hamiltonians using quantum computers. Mol. Phys. 109, 735–750 (2011).
McClean, J. R., Romero, J., Babbush, R. & AspuruGuzik, A. The theory of variational hybrid quantumclassical algorithms. New J. Phys. 18, 023023 (2016).
McClean, J. R., KimchiSchwartz, M. E., Carter, J. & de Jong, W. A. Hybrid quantumclassical hierarchy for mitigation of decoherence and determination of excited states. Phys. Rev. A 95, 042308 (2017).
Barkoutsos, P. K. et al. Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions. Phys. Rev. A 98, 022322 (2018).
Romero, J. et al. Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz. Quantum Sci. Technol. 4, 014008 (2018).
Colless, J. I. et al. Computation of molecular spectra on a quantum processor with an errorresilient algorithm. Phys. Rev. X 8, 011021 (2018).
Lee, J., Huggins, W. J., HeadGordon, M. & Whaley, K. B. Generalized unitary coupled cluster wavefunctions for quantum computation. J. Chem. Theory Comput. 15, 311–324 (2019).
Kandala, A. et al. Hardwareefficient variational quantum eigensolver for small molecules and quantum magnets. Nature 549, 242–246 (2017).
Shen, Y. et al. Quantum implementation of the unitary coupled cluster for simulating molecular electronic structure. Phys. Rev. A 95, 020501 (2017).
Hempel, C. et al. Quantum chemistry calculations on a trappedion quantum simulator. Phys. Rev. X 8, 031022 (2018).
Xia, R., Bian, T. & Kais, S. Electronic structure calculations and the Ising Hamiltonian. J. Phys. Chem. B 122, 3384–3395 (2017).
Xia, R. & Kais, S. Quantum machine learning for electronic structure calculations. Nat. Commun. 9, 4195 (2018).
Bartlett, R. J., Kucharski, S. A. & Noga, J. Alternative coupledcluster ansätze II. The unitary coupledcluster method. Chem. Phys. Lett. 155, 133–140 (1989).
Kutzelnigg, W. Error analysis and improvements of coupledcluster theory. Theor. Chim. Acta 80, 349–386 (1991).
Taube, A. G. & Bartlett, R. J. New perspectives on unitary coupledcluster theory. Int. J. Quantum Chem. 106, 3393–3401 (2006).
Harsha, G., Shiozaki, T. & Scuseria, G. E. On the difference between variational and unitary coupled cluster theories. J. Chem. Phys. 148, 044107 (2018).
DallaireDemers, P.L., Romero, J., Veis, L., Sim, S. & AspuruGuzik, A. Lowdepth circuit ansatz for preparing correlated fermionic states on a quantum computer. http://arxiv.org/abs/1801.01053 (2018).
Nakatsuji, H. & Ehara, M. Iterative CI general singles and doubles (ICIGSD) method for calculating the exact wave functions of the ground and excited states of molecules. J. Chem. Phys. 122, 194108 (2005).
Nakatsuji, H. Structure of the exact wave function. J. Chem. Phys. 113, 2949 (2000).
Nakatsuji, H. & Ehara, M. Structure of the exact wave function. V. Iterative configuration interaction method for molecular systems within finite basis. J. Chem. Phys. 117, 9–12 (2002).
Nakatsuji, H. & Davidson, E. R. Structure of the exact wave function. II. Iterative configuration interaction method. J. Chem. Phys. 115, 2000–2006 (2001).
Nooijen, M. Can the eigenstates of a manybody Hamiltonian be represented exactly using a general twobody cluster expansion? Phys. Rev. Lett. 84, 2108–2111 (2000).
Ryabinkin, I. G., Yen, T.C., Genin, S. N. & Izmaylov, A. F. Qubit coupledcluster method: a systematic approach to quantum chemistry on a quantum computer. J. Chem. Theory Comput. 14, 6317–6326 (2018).
Hatano, N. & Suzuki, M. Finding Exponential Product Formulas of Higher Orders. 37–68 (Springer, Berlin, Heidelberg, 2005).
Barkoutsos, P. K. et al. Quantum algorithms for electronic structure calculations: particlehole Hamiltonian and optimized wavefunction expansions. Phys. Rev. A 98, 022322 (2018).
Turney, J. M. et al. Psi4: an opensource ab initio electronic structure program. Wiley Interdiscip. Rev. Comput. Mol. Sci. 2, 556–565 (2012).
Smith, D. G. A. et al. Psi4NumPy: an interactive quantum chemistry programming environment for reference implementations and rapid development. J. Chem. Theory Comput. 14, 3504–3511 (2018).
McClean, J. R. et al. OpenFermion: the electronic structure package for quantum computers. http://arxiv.org/abs/1710.07629 (2017).
Jones, E., Travis, O. & Peterson, P. SciPy: open source scientific tools for Python. http://www.scipy.org/ (2001).
Harrison, R. J. Approximating full configuration interaction with selected configuration interaction and perturbation theory. J. Chem. Phys. 94, 5021–5031 (1991).
Povill, A., Rubio, J. & Illas, F. Treating large intermediate spaces in the CIPSI method through a direct selected CI algorithm. Theor. Chim. Acta 82, 229–238 (1992).
Peris, G., Planelles, J., Malrieu, J.P. & Paldus, J. Perturbatively selected CI as an optimal source for externally corrected CCSD. J. Chem. Phys. 110, 11708 (1999).
Evangelista, F. A. Adaptive multiconfigurational wave functions. J. Chem. Phys. 140, 124114 (2014).
Schriber, J. B. & Evangelista, F. A. Communication: an adaptive configuration interaction approach for strongly correlated electrons with tunable accuracy. J. Chem. Phys. 144, 161106 (2016).
Holmes, A. A., Tubman, N. M. & Umrigar, C. J. Heatbath configuration interaction: an efficient selected configuration interaction algorithm inspired by heatbath sampling. J. Chem. Theory Comput. 12, 3674–3680 (2016).
Xu, E., Uejima, M. & TenNo, S. L. Full coupledcluster reduction for accurate description of strong electron correlation. Phys. Rev. Lett. 121, 113001 (2018).
Lyakh, D. I. & Bartlett, R. J. An adaptive coupledcluster theory: @CC approach. J. Chem. Phys. 133, 244112 (2010).
Bischoff, F. A. & Valeev, E. F. Computing molecular correlation energies with guaranteed precision. J. Chem. Phys. 139, 114106 (2013).
Laikov, D. N. Intrinsic minimal atomic basis representation of molecular electronic wavefunctions. Int. J. Quantum Chem. 111, 2851–2867 (2011).
Lu, W. C. et al. Molecule intrinsic minimal basis sets. I. Exact resolution of ab initio optimized molecular orbitals in terms of deformed atomic minimalbasis orbitals. J. Chem. Phys. 120, 2629–2637 (2004).
Berghold, G., Parrinello, M. & Hutter, J. Polarized atomic orbitals for linear scaling methods. J. Chem. Phys. 116, 1800–1810 (2002).
Lee, M. S. & HeadGordon, M. Polarized atomic orbitals for selfconsistent field electronic structure calculations. J. Chem. Phys. 107, 9085 (1998).
Schütt, O. & VandeVondele, J. Machine learning adaptive basis sets for efficient large scale density functional theory simulation. J. Chem. Theory Comput. 14, 4168–4175 (2018).
Evangelista, F. A., Hanauer, M., Köhn, A. & Gauss, J. A sequential transformation approach to the internally contracted multireference coupled cluster method. J. Chem. Phys. 136, 204108 (2012).
Evangelista, F. A. Alternative singlereference coupled cluster approaches for multireference problems: the simpler, the better. J. Chem. Phys. 134, 224102 (2011).
Acknowledgements
This research was supported by the US Department of Energy (Award No. DESC0019199) and the National Science Foundation (Award No. 1839136). S.E.E. also acknowledges support from the Department of Energy (Award No. DESC0019318).
Author information
Authors and Affiliations
Contributions
N.J.M., S.E.E., and E.B. conceived the project. H.R.G. wrote the code. H.R.G. and N.J.M. performed the calculations. N.J.M., S.E.E., and E.B. wrote the paper.
Corresponding author
Ethics declarations
Competing interests
The authors declare no competing interests.
Additional information
Peer review information: Nature Communications thanks Peter Haynes and other anonymous reviewers for their contribution to the peer review of this work.
Publisher’s note: Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Supplementary Information
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Grimsley, H.R., Economou, S.E., Barnes, E. et al. An adaptive variational algorithm for exact molecular simulations on a quantum computer. Nat Commun 10, 3007 (2019). https://doi.org/10.1038/s41467019109882
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s41467019109882
This article is cited by

Equivariant quantum circuits for learning on weighted graphs
npj Quantum Information (2023)

OverlapADAPTVQE: practical quantum chemistry on quantum computers via overlapguided compact Ansätze
Communications Physics (2023)

Towards practical and massively parallel quantum computing emulation for quantum chemistry
npj Quantum Information (2023)

Hierarchical quantum circuit representations for neural architecture search
npj Quantum Information (2023)

Orbitaloptimized paircorrelated electron simulations on trappedion quantum computers
npj Quantum Information (2023)
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.