Abstract
Imaginary time evolution is a powerful tool for studying quantum systems. While it is possible to simulate with a classical computer, the time and memory requirements generally scale exponentially with the system size. Conversely, quantum computers can efficiently simulate quantum systems, but not nonunitary imaginary time evolution. We propose a variational algorithm for simulating imaginary time evolution on a hybrid quantum computer. We use this algorithm to find the groundstate energy of manyparticle systems; specifically molecular hydrogen and lithium hydride, finding the ground state with high probability. Our method can also be applied to general optimisation problems and quantum machine learning. As our algorithm is hybrid, suitable for error mitigation and can exploit shallow quantum circuits, it can be implemented with current quantum computers.
Similar content being viewed by others
Introduction
Imaginary time is an unphysical, yet powerful, mathematical concept. It has been utilised in numerous physical domains, including quantum mechanics, statistical mechanics and cosmology. Often referred to as performing a ‘Wick rotation’,^{1} replacing real time with imaginary time connects Euclidean and Minkowski space,^{2} quantum and statistical mechanics^{3} and static problems to problems of dynamics.^{4} In quantum mechanics, propagating a wavefunction in imaginary time enables: the study of finite temperature properties,^{5,6,7} finding the groundstate wavefunction and energy (such as in density matrix renormalisation group),^{8,9,10,11} and simulating realtime dynamics (such as timedependent Hartree).^{12,13} For a system with Hamiltonian, H, evolving in real time, t, the propagator is given by e^{−iHt}. The corresponding propagator in imaginary time, τ = it, is given by e^{−Hτ}; a nonunitary operator.
Using a classical computer, we can simulate imaginary time evolution by evaluating the propagator and applying it to the system wavefunction. There also exist various related classical methods, such as quantum Monte Carlo^{14,15} and density matrix renormalisation group^{16,17} for solving different problems. However, because the dimension of the wavefunction grows exponentially with the number of particles, classical simulation of manybody quantum systems is generally hard.^{18} While efficient variational trial states have been developed for a number of applications,^{19} powerful trial wavefunctions typically require classical computational resources which scale exponentially with the system size.^{11}
Quantum computing can naturally and efficiently store manybody quantum states, and hence is suitable for simulating quantum systems.^{20} We can map the system Hamiltonian to a qubit Hamiltonian, and simulate realtime evolution (as described by the Schrödinger equation) by realising the corresponding unitary evolution with a quantum circuit.^{21} Using Trotterization,^{22} the realtime propagator can be decomposed into a sequence of single and twoqubit gates.^{23} The ability to represent the realtime propagator with a sequence of gates stems from its unitarity. In contrast, because the imaginary time operator is nonunitary, it is not straightforward to decompose it into a sequence of unitary gates using Trotterization, and thus directly realise it with a quantum circuit. As a result, alternative methods are required to implement imaginary time evolution using a quantum computer.
Classically, we can simulate real (imaginary) time evolution of parametrised trial states by repeatedly solving the (Wick rotated) Schrödinger equation over a small timestep, and updating the parameters for the next timestep.^{8,9,11,24,25,26,27} This method has recently been extended to quantum computing, where it was used to simulate realtime dynamics.^{28} Closely related are the variational quantum eigensolver (VQE)^{29,30,31,32,33,34,35} and the quantum approximate optimisation algorithm (QAOA),^{36} which update the parameters using a classical optimisation routine, to find the minimum energy eigenvalue of a given Hamiltonian. As ‘hybrid quantumclassical methods’, these algorithms use a small quantum computer to carry out a classically intractable subroutine, and a classical computer to solve the higherlevel problem. The quantum subroutine may only require a small number of qubits and a lowdepth circuit, presenting a potential use for noisy intermediatescale quantum hardware.^{37}
In this paper, we propose a method to simulate imaginary time evolution on a quantum computer, using a hybrid quantumclassical variational algorithm. The proposed method thus combines the power of quantum computers to efficiently represent manybody quantum states, with classical computers’ ability to simulate arbitrary (including unphysical) processes. We discuss using this method to find the groundstate energy of manybody quantum systems, and to solve optimisation problems. We then numerically test the performance of our algorithm at finding the groundstate energy of both the hydrogen molecule (H_{2}) and lithium hydride (LiH). We compare our results for LiH to those obtained using the VQE with gradient descent. As our algorithm only requires a lowdepth circuit, it can be realised with current and nearterm quantum processors.
Results
Variational imaginary time evolution
We focus on manybody systems that are described by Hamiltonians \(H = \mathop {\sum}\nolimits_i {\lambda _i} h_i\), with real coefficients, λ_{i}, and observables, h_{i}, that are tensor products of Pauli matrices. We assume that the number of terms in this Hamiltonian scales polynomially with the system size, which is true for many physical systems, such as molecules or the FermiHubbard model. Given an initial state ψ〉, the normalised imaginary time evolution is defined by
where \(A(\tau ) = 1/\sqrt {\left\langle {\psi (0)} \righte^{  2H\tau }\left {\psi (0)} \right\rangle }\) is a normalisation factor. In the instance that the initial state is a maximally mixed state, the state at time τ is a thermal or Gibbs state ρ_{T=1/τ} = e^{−Hτ}/Tr[e^{−Hτ}], with temperature T = 1/τ. When the initial state has a nonzero overlap with the ground state, the state at τ → ∞ is the ground state of H. Equivalently, the Wick rotated Schrödinger equation is,
where the term E_{τ} = 〈ψ(τ)Hψ(τ)〉 results from enforcing normalisation. Even if ψ(τ)〉 can be represented by a quantum computer, the nonunitary imaginary time evolution cannot be naively mapped to a quantum circuit.
In our variational method, instead of directly encoding the quantum state ψ(τ)〉 at time τ, we approximate it using a parametrised trial state \( {\phi (\vec \theta (\tau ))} \rangle\), with \(\vec \theta (\tau ) = (\theta _1(\tau ),\theta _2(\tau ), \ldots ,\theta _N(\tau ))\). This stems from the intuition that the physically relevant states are contained in a small subspace of the full Hilbert space.^{38} The trial state is referred to as the ansatz. In condensed matter physics and computational chemistry, a wide variety of ansätze have been proposed for both classical and quantum variational methods.^{11,20,39,40}
Using a quantum circuit, we prepare the trial state, \( {\phi (\vec \theta )} \rangle\), by applying a sequence of parametrised unitary gates, \(V(\vec \theta ) = U_N(\theta _N) \ldots U_k(\theta _k) \ldots U_1(\theta _1)\) to our initial state, \(\left {\bar 0} \right\rangle\). We express this as \( {\phi (\vec \theta )} \rangle = V(\vec \theta ) {\bar 0} \rangle\) and remark that \(V(\vec \theta )\) is also referred to as the ansatz. We refer to all possible states that could be created by the circuit V as the ‘ansatz space’. Here, U_{k}(θ_{k}) is the k^{th} unitary gate, controlled by parameter θ_{k}, and the gate can be regarded as a single or twoqubit gate.
To simulate the imaginary time evolution of the trial state, we use McLachlan’s variational principle,^{41,42}
where \(\parallel \rho \parallel = {\mathrm{Tr}}[\sqrt {\rho \rho ^\dagger } ]\) denotes the trace norm of a state. By replacing ψ(τ)〉 with \( {\phi (\tau )} \rangle =  {\phi (\vec \theta (\tau ))} \rangle\), we effectively project the desired imaginary time evolution onto the manifold of the ansatz space. The evolution of the parameters is obtained from the resulting differential equation
where
and h_{α} and λ_{α} are the Pauli terms and coefficients of the Hamiltonian, as described above. The derivation of Eq. (4) can be found in the Supplementary Materials. As both A_{ij} and C_{i} are real, the derivative \(\dot \theta _j\) is also real, as required for parametrising a quantum circuit. Interestingly, although the average energy term E_{τ} appears in Eq. (2), it does not appear in Eq. (4). This is because the ansatz applied maintains normalisation, as it is composed of unitary operators.
Imaginary time evolution with quantum circuits
By following a similar method to that introduced in ref., ^{28} we can efficiently measure A_{ij} and C_{i} using a quantum computer. We assume that the derivative of a unitary gate U_{i}(θ_{i}) can be expressed as \(\partial U_i(\theta _i)/\partial \theta _i = \mathop {\sum}{_k {f_{k,i}}} U_i(\theta _i)\sigma _{k,i}\), with unitary operator σ_{k,i}. The derivative of the trial state is given by \(\partial \left {\phi (\tau )} \right\rangle /\partial \theta _i = \mathop {\sum} {_k {f_{k,i}}} \tilde V_{k,i}\left {\bar 0} \right\rangle\), with \(\tilde V_{k,i} = U_N(\theta _N) \ldots U_{i + 1}(\theta _{i + 1})U_i(\theta _i)\sigma _{k,i} \ldots U_1(\theta _1)\). There are typically only one or two terms resulting from each derivative. As an example, when U_{i}(θ_{i}) is a singlequbit rotation \(R_z(\theta _i) = e^{  i\theta _i\sigma _z/2}\), the derivative \(\partial U_i(\theta _i)/\partial \theta _i =  i/2 \times \sigma _ze^{  i\theta _i\sigma _z/2}\). The coefficients A_{ij} and C_{i} are given by
All of these terms are of the form \(a\Re \left( {e^{i\theta }\left\langle {\bar 0} \rightU\left {\bar 0} \right\rangle } \right)\) and can be evaluated using the circuits shown in the Supplementary Materials.
With A(τ) and \(\vec C(\tau )\) at time τ, the imaginary time evolution over a small interval δτ can be simulated by evaluating \(\vec{\dot{\theta}}(\tau ) = A^{  1}(\tau )\cdot \vec C(\tau )\), and using a suitable update rule, such as the Euler method,
By repeating this process N_{T} = τ_{total}/δτ times, we can simulate imaginary time evolution over a duration τ_{total}. Often, the satisfying parameter evolution is not unique and Eq. (4) is underdetermined. In that case, we can employ truncated singular value decomposition to approximately invert A, or Tikhonov regularisation to additionally constrain the parameters to vary smoothly. We elaborate upon these strategies in the Supplementary Materials.
A limitation of our variational method is that the ansatz may not be able to faithfully describe all states on the desired trajectory, much like its realtime counterpart.^{28} Even though such states lie in a small subspace of the full Hilbert space,^{38} it is difficult to prove that they can be generated by a given ansatz, despite promising numerical results.^{28} However, our numerical results are similarly promising for imaginary time, and demonstrate it to be a robust routine for energy minimisation. Moreover, we believe that when tasked with finding the ground state using imaginary time evolution, a small deviation from the true evolution is less problematic than when trying to simulate realtime evolution. This is because imaginary time evolution always drives a state towards the ground state (or one of the lowest eigenstates), whereas the realtime evolution of two closely separated states may be very different. Consequently, as long as errors due to an imperfect ansatz do not cause the simulation to become trapped in local minima, we do not mind if the evolution deviates from the path of true imaginary time evolution, as ultimately, it will still be driven towards the ground state. Nevertheless, designing ansätze that are well suited to imaginary time evolution is an interesting open problem.
Groundstate energy via imaginary time evolution
We apply our method to the problem of finding the groundstate energy of a manybody Hamiltonian, H. As with the VQE, our goal is to find the values of the parameters, \(\vec \theta\), which minimise the expectation value of the Hamiltonian
where \( {\phi (\vec \theta )} \rangle = V(\vec \theta ) {\bar 0} \rangle\) is our variational trial state. The VQE solves this problem by using a quantum computer to construct a good ansatz and measure the expectation value of the Hamiltonian, and a classical optimisation routine to obtain new values of the parameters. In order to preserve the exponential speedup of the VQE over classical methods, the trial state is constructed using a number of parameters that scales polynomially with the system size. However, because we may need to consider many possible values for each parameter, the total size of the parameter space still scales exponentially with the system size. Moreover, many optimisation algorithms, such as gradient descent, are liable to becoming trapped in local minima. This combination can make the classical optimisation step of the VQE very difficult.^{43}
As described above, if the initial state has a nonzero overlap with the ground state, true propagation in imaginary time will evolve the system into the ground state, in the limit that τ → ∞. Classically, this has been leveraged as a powerful tool to find the groundstate energy of quantum systems.^{8,9,11} Using our method, we can efficiently simulate ansatzbased imaginary time evolution to find the ground state, using a quantum computer. In the numerical simulations described below, we use the Euler method to solve differential equations, which corresponds to the update rule for the parameters shown in Eq. (7). We prove in the Supplementary Materials that when δτ is sufficiently small, the average energy of the trial state, \(E(\tau)=\langle\phi(\tau)\vert {H}\vert {\phi}(\tau)\rangle\), always decreases when following the Euler update rule: E(τ + δτ) ≤ E(τ).
In this work, we consider gradient descent, a canonical classical optimisation method
where \(\vec G(\tau ) =  \nabla E(\tau )\) is the gradient of E(τ) and \(\vec C(\tau ) \equiv  \nabla E(\tau )\) is the same vector in Eq. (4). Classical optimisation methods only consider information about the average energy, and not about the ansatz itself, which is encoded in the matrix A, used only in variational imaginary time evolution.
Toy example
Here, we present two simple toy examples which highlight the difference between variational imaginary time evolution and gradient descent for finding the groundstate energy of Hamiltonians. Consider the following Hamiltonians
with ansätze
prepared by circuits ((A) and (B), respectively).Here, \(CR_Y^{0,1}\) is a controlled Y rotation with control qubit 0 and target qubit 1, \(R_X^q(\theta _1)\) is a rotation of qubit q around the xaxis, and the rotation about the jaxis is \(R_{\sigma _j}(\theta ) = e^{  i\theta \sigma _j/2}\) with Pauli matrices σ_{j}. Note that θ_{3} is a fictitious parameter which corresponds to the global phase. This is present only so that the evolution of the other parameters are not constrained to produce an oscillating global phase in time, as recently studied in ref. ^{44}.
We study the ability of variational imaginary time and gradient descent to navigate the energy landscapes of the toy systems A and B, and present the results in Fig. 1. Figure 1a shows imaginary time robustly discovering the global minima of the energy landscape of system A, while gradient descent becomes trapped in local minima. Figure 1b shows imaginary time performing comparably with gradient descent for system B, despite it being only slightly more complicated than system A. This shows that it is still possible for imaginary time evolution to become trapped in local minima, when the ansatz is not sufficiently powerful for certain Hamiltonians.
Simulation of H_{2} and LiH
We use our method to find the groundstate energy of the H_{2} and LiH molecules in their minimal spin–orbital basis sets. We map the molecular fermionic Hamiltonians to qubit Hamiltonians using the procedure described in the Supplementary Materials. The H_{2} Hamiltonian acts on two qubits, and considers the space of two electrons in four spin–orbitals. The LiH Hamiltonian acts on eight qubits, and considers an active space of two electrons in eight spin–orbitals. There are numerous possible choices for the ansatz circuit; we use a universal ansatz for H_{2}^{29} and an ansatz inspired by the lowdepth circuit ansatz^{45} for LiH, as shown in the Supplementary Materials. The simulation results for H_{2} are shown in Fig. 2. We have used a universal ansatz, which is capable of representing all states along the imaginary time trajectory to confirm that our method can recover true imaginary time evolution, when the ansatz is sufficiently powerful. We attribute deviation from the true evolution to the use of an Euler update rule, and finite step size. Our simulations were able to converge to the ground state in all trials.
We compare the LiH results to those obtained using the VQE, with gradient descent as the classical optimisation routine. We use the lowdepth circuit ansatz shown in the Supplementary Materials for our simulation, with 137 parameters. This is approximately a quarter of the number needed in a universal ansatz. We consider starting from a good initial state (the Hartree–Fock state for LiH), and also random initial states. We believe that the latter simulations provide a more thorough test of both methods.
We use the maximum stable step size δτ for each method such that energy monotonically decreases in the first 200 iterations. The stable timestep for imaginary time was 0.225, and for gradient descent it was 0.886. Figure 3 shows the imaginary time method outperforming gradient descent. It is able to locate the ground state more quickly, and accurately. This advantage is most noticeable for the case of random start states, where the obtained convergence rate is significantly higher than gradient descent. This may be most relevant for solving optimisation problems using the QAOA algorithm, where it is often harder to motivate a good initial starting state.
It is natural to question whether the resource requirements of variational imaginary time evolution are comparable with those of gradient descent. We assess this by performing a simple resource estimation, and by examining its sensitivity to shot noise and to gate errors within the quantum computer. At each iteration, populating the gradient vector requires \({\cal{O}}(N_CN_HN_p)\) measurements, where N_{C} is the number of measurements required to ascertain a Hamiltonian term to the required precision, N_{H} is the number of terms in the Hamiltonian, and N_{p} is the number of parameters used in the ansatz. For imaginary time, the total cost is \({\cal{O}}(N_CN_HN_p + N_p^2N_A)\), where N_{A} is the number of measurements required to ascertain an element of the A matrix to the required precision. Sensible ansätze typically have fewer parameters N_{p} than there are Hamiltonian terms N_{H} (in our LiH simulations, N_{p} = 137 and N_{H} = 181). If the number of Hamiltonian terms is considerably larger than the number of parameters used, then the additional cost \({\cal{O}}(N_p^2N_A)\) of imaginary time can be dominated by the cost of calculating the gradient vector. While this is not true for our LiH simulations, we find that it is possible to further reduce the cost of imaginary time by using fewer measurements for each term in the A matrix than for each element of the gradient vector (N_{A} ≪ N_{C}), while still maintaining imaginary time’s superior performance. We demonstrate this in Fig. 4, where we vary the number of measurements used to populate A, and simulate the methods under the effect of decoherence. The results show that imaginary time can perform significantly better than gradient descent under the presence of noise, even when significantly fewer measurements are made. However, if the gradient is not known to sufficient accuracy (N_{C} < 2 × 10^{4}), the reliability of imaginary time evolution cannot be improved by increasing N_{A}, and can even perform less effectively than gradient descent. Combined with imaginary time’s faster convergence and the tendency of gradientbased methods to become trapped in local minima, we expect finding the ground state to require substantially fewer measurements using imaginary time than gradient descent.
Discussion
In this work, we have proposed a method to efficiently simulate imaginary time evolution using hybrid quantumclassical computing. We have applied our method to finding the groundstate energy of quantum systems, and have tested its performance on H_{2} and LiH. As imaginary time evolution outperformed gradient descent at this task, we believe our method provides a competitive alternative to conventional classical optimisation routines. We will examine this further in future work. We expect that our method would also be suitable for solving general optimisation problems, in conjunction with the QAOA, especially given its performance with randomly chosen initial states.
Our method can also be used to prepare a thermal (Gibbs) state, ρ_{T} = e^{−H/T}/Tr[e^{−H/T}] of Hamiltonian H at temperature T. Sampling from a Gibbs distribution is an important aspect of many machinelearning algorithms, and so we believe that our method is applicable to problems in quantum machine learning. Moreover, while previous methods to prepare the Gibbs state^{46,47} require long gate sequences (and hence, fault tolerance), our method can be implemented using a shallow circuit. Our algorithm can also be combined with recently proposed error mitigation techniques,^{28,48,49,50} and so is suitable for current quantum hardware.
Although exact imaginary time evolution deterministically propagates a good initial state to the ground state in the limit that τ → ∞, our variational method may still converge to higherenergy states, if the chosen ansatz is not sufficiently powerful. In future work, we will investigate how our method may be optimally applied to a variety of tasks in chemistry, optimisation and machine learning. This will include developing suitable ansätze for a range of problems.
Data availability
The data that support the findings of this study are available from the corresponding author upon reasonable request.
Code availability
The code that supports the findings of this study are available from the corresponding author upon reasonable request.
References
Wick, G. C. Properties of bethesalpeter wave functions. Phys. Rev. 96, 1124–1134 (1954).
Poincaré, M. H. Sur la dynamique de l’électron. Rend. del. Circolo Mat. di Palermo (1884–1940) 21, 129–175 (1906).
Sakurai, J. J. & Napolitano, J. Modern Quantum Mechanics (Cambridge University Press, 2017).
Baez, J. C. & Pollard, B. S. Quantropy. Entropy 17, 772–789 (2015).
Verstraete, F., GarcíaRipoll, J. J. & Cirac, J. I. Matrix product density operators: simulation of finitetemperature and dissipative systems. Phys. Rev. Lett. 93, 207204 (2004).
Zwolak, M. & Vidal, G. Mixedstate dynamics in onedimensional quantum lattice systems: a timedependent superoperator renormalization algorithm. Phys. Rev. Lett. 93, 207205 (2004).
Wolf, F. A., Go, A., McCulloch, I. P., Millis, A. J. & Schollwöck, U. Imaginarytime matrix product state impurity solver for dynamical meanfield theory. Phys. Rev. X 5, 041032 (2015).
Lehtovaara, L., Toivanen, J. & Eloranta, J. Solution of timeindependent schrödinger equation by the imaginary time propagation method. J. Comput. Phys. 221, 148–157 (2007).
Kraus, C. V. & Cirac, J. I. Generalized hartreefock theory for interacting fermions in lattices: numerical methods. New J. Phys. 12, 113004 (2010).
McClean, J. R. & AspuruGuzik, A. Compact wavefunctions from compressed imaginary time evolution. RSC Adv. 5, 102277–102283 (2015a).
Shi, T., Demler, E. & Cirac, J. I. Variational study of fermionic and bosonic systems with nongaussian states: Theory and applications. Ann. Phys. 390, 245–302 (2018).
McClean, J. R., Parkhill, J. A. & AspuruGuzik, A. Feynman’s clock, a new variational principle, and parallelintime quantum dynamics. PNAS 110, E3901–E3909 (2013).
McClean, J. R. & AspuruGuzik, A. Clock quantum Monte Carlo technique: an imaginarytime method for realtime quantum dynamics. Phys. Rev. A 91, 012311 (2015b).
AlSaidi, W. A., Zhang, S. & Krakauer, H. Auxiliaryfield quantum monte carlo calculations of molecular systems with a gaussian basis. J. Chem. Phys. 124, 224101 (2006).
Motta, M. & Zhang, S. Ab initio computations of molecular systems by the auxiliaryfield quantum monte carlo method. Wiley Interdiscip. Rev.: Comput. Mol. Sci. 8, e1364 (2018).
Chan, G. K.L. & Sharma, S. The density matrix renormalization group in quantum chemistry. Annu. Rev. Phys. Chem. 62, 465–481 (2011).
Stoudenmire, E. M. & White, S. R. Sliced basis density matrix renormalization group for electronic structure. Phys. Rev. Lett. 119, 046401 (2017).
Feynman, R. P. Simulating physics with computers. Int. J. Theor. Phys. 21, 467–488 (1982).
Dalfovo, F., Giorgini, S., Pitaevskii, L. P. & Stringari, S. Theory of boseeinstein condensation in trapped gases. Rev. Mod. Phys. 71, 463–512 (1999).
Georgescu, I. M., Ashhab, S. & Nori, F. Quantum simulation. Rev. Mod. Phys. 86, 153–185 (2014).
Nielsen, M. A. & Chuang, I. L. Quantum Computation and Quantum Information. Cambridge Series on Information and the Natural Sciences, https://books.google.co.uk/books?id=aaiP4V9GJ8C (Cambridge University Press, New York, 2000).
Trotter, H. F. On the product of semigroups of operators. Proc. Am. Math. Soc. 10, 545–551 (1959).
Abrams, D. S. & Lloyd, S. Simulation of manybody fermi systems on a universal quantum computer. Phys. Rev. Lett. 79, 2586–2589 (1997).
Jackiw, R. & Kerman, A. Timedependent variational principle and the effective action. Phys. Lett. A 71, 158–162 (1979).
Kramer, P. A review of the timedependent variational principle. J. Phys.: Conf. Ser. 99, 01 (2009).
Haegeman, J. et al. Timedependent variational principle for quantum lattices. Phys. Rev. Lett. 107, 070601 (2011).
Ashida, Y., Shi, T., Bañuls, M. C., Cirac, J. I. & Demler, E. Variational principle for quantum impurity systems in and out of equilibrium: application to kondo problems. Preprint at https://arxiv.org/pdf/1802.03861 (2018).
Li, Y. & Benjamin, S. C. Efficient variational quantum simulator incorporating active error minimization. Phys. Rev. X 7, 021050 (2017).
Peruzzo, A. et al. A variational eigenvalue solver on a photonic quantum processor. Nat. Commun. 5, 4213 (2014).
Wang, Y. et al. Quantum simulation of helium hydride cation in a solidstate spin register. ACS Nano 9, 7769–7774 (2015).
O’Malley, P. J. J. et al. Scalable quantum simulation of molecular energies. Phys. Rev. X 6, 031007 (2016).
Shen, Y. et al. Quantum implementation of the unitary coupled cluster for simulating molecular electronic structure. Phys. Rev. A 95, 020501 (2017).
McClean, J. R., Romero, J., Babbush, R. & AspuruGuzik, A. The theory of variational hybrid quantumclassical algorithms. New J. Phys. 18, 023023 (2016).
Paesani, S. et al. Experimental bayesian quantum phase estimation on a silicon photonic chip. Phys. Rev. Lett. 118, 100503 (2017).
Kandala, A. et al. Hardwareefficient variational quantum eigensolver for small molecules and quantum magnets. Nature 549, 242 (2017).
Farhi, E., Goldstone, J. & Gutmann, S. A quantum approximate optimization algorithm. Preprint at https://arxiv.org/pdf/1411.4028 (2014).
Preskill, J. Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018).
Poulin, D., Qarry, A., Somma, R. & Verstraete, F. Quantum simulation of timedependent hamiltonians and the convenient illusion of hilbert space. Phys. Rev. Lett. 106, 170501 (2011).
Verstraete, F., Murg, V. & Cirac, J. I. Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems. Adv. Phys. 57, 143–224 (2008).
Whaley, K. B., Dinner, A. R. & Rice, S. A. Quantum Information and Computation for Chemistry (John Wiley & Sons, 2014).
McLachlan, A. D. A variational solution of the timedependent schrodinger equation. Mol. Phys. 8, 39–44 (1964).
Broeckhove, J., Lathouwers, L., Kesteloot, E. & Van Leuven, P. On the equivalence of timedependent variational principles. Chem. Phys. Lett. 149, 547–550 (1988).
Wecker, D., Hastings, M. B. & Troyer, M. Progress towards practical quantum variational algorithms. Phys. Rev. A 92, 042303 (2015).
Yuan, X., Endo, S., Zhao, Q., Benjamin, S. & Li, Y. Theory of variational quantum simulation. Eprints at http://arxiv.org/abs/1812.08767 (2018).
DallaireDemers, P.L., Romero, J., Veis, L., Sim, S. & AspuruGuzik, A. Lowdepth circuit ansatz for preparing correlated fermionic states on a quantum computer. Preprint at https://arxiv.org/pdf/1801.01053 (2018).
Temme, K., Osborne, T. J., Vollbrecht, K. G., Poulin, D. & Verstraete, F. Quantum metropolis sampling. Nature 471, 87 (2011).
Riera, A., Gogolin, C. & Eisert, J. Thermalization in nature and on a quantum computer. Phys. Rev. Lett. 108, 080402 (2012).
Temme, K., Bravyi, S. & Gambetta, J. M. Error mitigation for shortdepth quantum circuits. Phys. Rev. Lett. 119, 180509 (2017).
Endo, S., Benjamin, S. C. & Li, Y. Practical quantum error mitigation for nearfuture applications. Phys. Rev. X 8, 031027 (2018).
McArdle, S., Yuan, X. & Benjamin, S. Error mitigated digital quantum simulation. Phys. Rev. Lett. 122 180501 (2019).
Acknowledgements
This work was supported by BP plc and by the EPSRC National Quantum Technology Hub in Networked Quantum Information Technology (EP/M013243/1). Y.L. is supported by National Natural Science Foundation of China (Grant no. 11875050) and NSAF (Grant no. U1730449). S.B. and Y.L. thank Sergey Bravyi for suggesting an investigation into the imaginary time variant of the algorithm in Ref. ^{28}. S.E. is supported by Japan Student Services Organization (JASSO) Student Exchange Support Program (Graduate Scholarship for Degree Seeking Students).
Author information
Authors and Affiliations
Contributions
S.M. and X.Y. conceived the idea, developed the theory and wrote the paper. T.J., S.M. and X.Y. carried out the numerical simulation. S.E. and Y.L. contributed to the theory. S.B. and X.Y. supervised the project. All authors discussed the results and contributed to the writing of the paper.
Corresponding author
Ethics declarations
Competing interests
The authors declare no competing interests.
Additional information
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
McArdle, S., Jones, T., Endo, S. et al. Variational ansatzbased quantum simulation of imaginary time evolution. npj Quantum Inf 5, 75 (2019). https://doi.org/10.1038/s4153401901872
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s4153401901872
This article is cited by

Convergence of the quantum dynamics framework for optimization algorithm
Quantum Information Processing (2024)

Determination of molecular energies via variationalbased quantum imaginary time evolution in a superconducting qubit system
Science China Physics, Mechanics & Astronomy (2024)

Variational quantum algorithms: fundamental concepts, applications and challenges
Quantum Information Processing (2024)

A quantum algorithm for linear differential equations with layerwise parameterized quantum circuits
AAPPS Bulletin (2024)

Euclidean time method in generalized eigenvalue equation
Quantum Information Processing (2024)