Abstract
We propose a quantum inverse iteration algorithm, which can be used to estimate ground state properties of a programmable quantum device. The method relies on the inverse power iteration technique, where the sequential application of the Hamiltonian inverse to an initial state prepares the approximate ground state. To apply the inverse Hamiltonian operation, we write it as a sum of unitary evolution operators using the Fourier approximation approach. This allows to reformulate the protocol as separate measurements for the overlap of initial and propagated wavefunction. The algorithm thus crucially depends on the ability to run Hamiltonian dynamics with an available quantum device, and can be used for analog quantum simulators. We benchmark the performance using paradigmatic examples of quantum chemistry, corresponding to molecular hydrogen and beryllium hydride. Finally, we show its use for studying the ground state properties of relevant material science models, which can be simulated with existing devices, considering an example of the BoseHubbard atomic simulator.
Introduction
Quantum computing offers drastic speed up for certain computational problems, and has evolved as a unique direction in the theoretical information science.^{1} However, the field of experimental quantum computing is yet at its infancy. The typical size of quantum chips for the reliable gate based quantum computation ranges from one to several tens of physical qubits, with the main limits posed by decoherence. Despite the imperfections, the algorithms of everincreasing complexity were implemented on different platforms, with circuit depth exceeding a thousand gates,^{2,3} ultimately allowing for quantum supremacy demonstration.^{4}
At the same time, the vox populi of quantum engineers says that while experimental setups are developed and mastered rapidly, the theorists in the field lag behind. Whereas by now textbook examples of quantum algorithms with exponential and quadratic speed up for factoring and search serve as a great motivation,^{1} the estimates of gate counts are daunting, making them distant goals for the future faulttolerant quantum computers.^{5} Recent developments in this fast evolving field call for new short depth algorithms which can solve useful problems in the era of noisy intermediate scale quantum (NISQ) devices,^{6} and in future lead to quantum advantage.
One of the most promising directions for quantum computation is the field of quantum chemistry and materials.^{5,7} Targeting the access to ground state properties of molecules and strongly correlated matter, it can offer huge gain for various technological applications, for instance helping to find a catalyst for the nitrogen fixation.^{8} To date, different quantum theoretical protocols were developed, and several proofofprinciple experiments on various platforms were performed in the simplest cases. Examples include simulation of molecular hydrogen with the linear optical setup,^{9} superconducting circuits,^{10,11,12,13} and trapped ions.^{14} Finally, the variational simulation for larger molecules (LiH and BeH_{2}) were reported recently.^{11} From the material science perspective, the use of cold atom quantum simulators has shown great promise, where simulations of FermiHubbard lattice dynamics,^{15} large scale quantum Rydberg chain^{16} and Ising model,^{17} and twodimensional manybody localization^{18} have been performed. However, in the latter cases the analog approach to simulation is taken, given an access to unitary dynamics, while precluding the study of ground state properties.
To access the ground state properties of quantum chemical Hamiltonian, several routines can be used (see refs ^{19,20} for the review). First option corresponds to the quantum phase estimation algorithm (PEA),^{21} which exploits unitary dynamics of the system controlled by register qubits. Although this algorithm is efficient, giving logarithmic error and polynomial gate scaling, its implementation requires substantial circuit depth for currently available circuits.^{10} Moreover, the controlled type of operations require the digitization of the circuit, thus complicating the use of analog quantum simulators for PEA. Another approach is adiabatic quantum computing, which was already applied to quantum chemistry problems.^{22} However, the required adiabaticity of dynamics typically results in the effectively long circuit depth. Finally, an alternative route to quantum chemistry and materials is offered by hybridclassical variational approaches, which were proposed recently.^{23} They rely on termbyterm energy measurement for the prepared trial quantum state (ansatz) with consequent classical optimization, and are referred to as Variational Quantum Eigensolvers (VQE).^{19,20,24} VQE can use a chemically inspired ansatz,^{24} Hamiltonian variational ansatz,^{25} or rely on the variational imaginary time evolution.^{26} The search for a simple and efficient ansatz represents an important ongoing research direction.^{27,28} In this case the depth of the quantum circuit is greatly reduced, though at the expense of increased number of measurements, being favorable strategy for NISQ devices. For VQE the number of variational parameters scales as O[(3N)^{k}], where N is a number of qubits and k represents an approximation order.^{24} While for quantum chemistry applications k = 2 suffices to give useful results, these approaches are yet to be tested for larger system sizes, where the multivariable optimization may raise problems for the genuine ground state estimation.^{29}
In the following, we propose the quantum inverse iteration algorithm for the estimation of the ground state energy (GSE) of a quantum system. It is inspired by the classical inverse power iteration algorithm for finding the dominant eigenstate of the matrix, where the computationally demanding part of matrix inversion and multiplication is performed by a quantum circuit. Previously, a direct iteration approach was considered as a general purpose quantum algorithm,^{30} aiming for large scale faulttolerant implementation. Here, we present the protocol of the hybrid quantumclassical nature. It relies on performing quantum evolution for different propagation times and classical postprocessing of the measured observables. The approach is applied to quantum chemistry examples (H_{2} and BeH_{2} molecules), showing favourable scaling with system parameters. Finally, when applied to the BoseHubbard quantum simulator, it allows to study its ground state properties, showing promise as a protocol for analog quantum simulators and nearterm quantum devices.
Results
We start by considering a generic interacting system, which can be described by the second quantized Hamiltonian. It can be written as sum of twobody and fourbody parts
where \({\hat{a}}_{i}^{\dagger }\) (\({\hat{a}}_{i}\)) can correspond to fermionic or bosonic creation (annihilation) operators, and cover broad range of models. In the fermionic case, Hamiltonian (1) can describe the full configuration interaction problems in quantum chemistry, with operator \({\hat{a}}_{j}\) corresponding to molecular orbital j. Using the existing mappings between fermionic and spin1/2 systems, one can rewrite Eq. (1) in the form of a local Hamiltonian \(\hat{{\mathcal{H}}}\) for interacting qubits, which involves strings of Pauli operators. The task is then to find the lowest eigenvalue of large matrix \(\hat{{\mathcal{H}}}\), corresponding to GSE.
Inverse iteration
We propose the procedure which can be seen as a quantum version of the inverse power iteration algorithm for finding the dominant eigenvalue of the matrix, represented by the inverse of Hamiltonian matrix \({\hat{{\mathcal{H}}}}^{1}\), which is treated as a dimensionless matrix in this section. Given that \(\hat{{\mathcal{H}}}\) is invertible, the order of eigenvalues is reversed and, with the appropriate shift of the diagonal to make eigenvalues positive, the power iteration allows to find GSE. Namely, starting with an initial state \({\psi}_{0}\rangle\), which has nonzero overlap with the sought ground state \({\psi}_{gs}\rangle\), by repetitive application of the inverted matrix one can prepare (unnormalized) state, \(\left{\widetilde{\psi }}_{k}\right\rangle ={({\hat{{\mathcal{H}}}}^{1})}^{k}\left{\psi }_{0}\right\rangle\), such that \({\left\left\langle {\psi }_{{\rm{gs}}} {\psi }_{k}\right\rangle \right}^{2}\,<\,\epsilon\) for sufficiently large number of iterations k ≥ K,^{31} where \(\left{\psi }_{k}\right\rangle =\left{\widetilde{\psi }}_{k}\right\rangle /\parallel \left{\widetilde{\psi }}_{k}\right\rangle \parallel\) (Fig. 1). We note that generally this method has favorable logarithmic complexity in the iteration depth, being K = log[ϵ sin^{−2}(θ_{0})∕(λ_{1} − λ_{n})]∕[2 log(λ_{2}∕λ_{1})], where λ_{1}, λ_{2}, and λ_{n} correspond to dominant, subdominant, and smallest eigenvalue of \({\hat{{\mathcal{H}}}}^{1}\). Here sin^{2}θ_{0} parametrizes the overlap between \({\psi}_{0}\rangle\) and \({\psi}_{gs}\rangle\), marking that convergence of the procedure depends on the initial guess, and generally can be made nonzero taking \({\psi}_{0}\rangle\) as a random state. While classical power iteration methods generally have good convergence in the number of iterations, the main caveat comes from the complexity scaling with the system size N. The requirement for K matrix multiplications leads to O[K2^{2N}] operations (for dense matrices), yielding exponential scaling. Even worse situation is for the inverse matrix algorithm, where an overhead comes from the \({\hat{{\mathcal{H}}}}^{1}\) calculation, requiring extra O[2^{N}] operations.
Fourier approximation
In the following we show that we can exploit the iterative procedure with logarithmic iteration depth in ϵ, while providing exponential speed up for the inverse Hamiltonian multiplication process. The latter comes from the approximation theory,^{32} observing that the inverse can be represented as an integral \({x}^{1}={\int }_{0}^{+\infty }\mathrm{exp}(xy)dy\), which by applying the trapezoidal rule can be written as a sparse sum of exponents. For quantum systems a similar idea was proposed in ref., ^{33} where Fourier approximation of the Hamiltonian inverse was presented as a double integral of the unitary propagator. This was further used to design an efficient solver for the quantum linear equation system problem.^{33,34} Here we extend the Fourier approximation to the kth power of the inverse (k ≥ 1), which formally reads
and \({\mathcal{N}}_{k}\) is a normalization factor. The integral can be then discretized as
where Δ_{y,z} correspond to the discretization steps for integration variables, and M_{y,z} represent cutoffs for integration. Notably, once applied to the physical Hamiltonian inverse, the discretization variable Δ_{z} remains dimensionless, while Δ_{y} has the units of inverse energy, serving akin to discrete time variable. The success of approximation (3) depends on the condition number of the Hermitian matrix \(\hat{{\mathcal{H}}}\), given by the ratio of its largest to smallest eigenvalue, \(\kappa ={\lambda }_{n}^{\hat{{\mathcal{H}}}}/{\lambda }_{1}^{\hat{{\mathcal{H}}}}\). Finally, Eq. (3) can be conveniently redefined as
where we have rewritten the double summation in Eq. (3) using the superindex ℓ(j_{y}, j_{z}), ϕ_{k,ℓ} = (j_{y}Δ_{y})(j_{z}Δ_{z}) is a phase of evolution for parameters chosen to discretize kth inverse, and L_{k} = M_{y}(2M_{z} + 1). Here c_{k,ℓ} represent purely imaginary coefficients for the series, and ∣c_{k,ℓ}∣ define corresponding weights. The required size and number of discretization steps Δ_{y,z} and M_{y,z} depends on ϵ and κ (see Methods, section A, for the details). Importantly, they set the maximal evolution phase ϕ_{max} = (M_{y}Δ_{y})(M_{z}Δ_{z}), which serves as an equivalent of the total gate count for analog quantum simulation.
As we need to prepare the approximate ground state by applying generally nonunitary operator \({\hat{{\mathcal{H}}}}^{K}\) to the initial state \({\psi}_{0}\rangle\), we shall either introduce an ancillary register to perform it, or properly account for the normalization of the resulting wavefunction. The former option is an excellent strategy for the future faulttolerant devices, and has beneficial scaling (Methods, Section A). It has deep connection to linear composition of unitaries (LCU) methods and duality quantum computing.^{35} The latter is more suitable for programmable quantum simulators. In the following we present the strategy, which can be applied to estimate the ground state properties by sequential evaluation of terms in the series. Similarly to VQE approaches, this relies on performing large number of measurements, and thus adds an extra complexity as compared to the generic implementation of the inverse operator. At the same time, termbyterm readout offers better resilience to errors where even imperfect procedure can yield reasonable GSE estimate for quantum simulators.
Sequential energy estimation
Our final goal is to estimate system observables, provided that the approximate ground state is prepared. For any operator \(\hat{{\mathcal{A}}}\) it can be retrieved from the measurement \(A=\langle {\psi }_{{\rm{gs}}} \hat{{\mathcal{A}}} {\psi }_{{\rm{gs}}}\rangle /\langle {\psi }_{{\rm{gs}}} {\psi }_{{\rm{gs}}}\rangle\), where the normalization is accounted for explicitly. In particular, we are interested in calculating the ground state energy λ_{gs} ≈ λ_{k}, choosing the operator \(\hat{{\mathcal{A}}}\) as \(\hat{{\mathcal{H}}}\). This amounts to measurement of Hamiltonian expectation value for \(\left{\psi }_{k}\right\rangle ={\hat{{\mathcal{H}}}}^{k}\left{\psi }_{0}\right\rangle\) in the form
We proceed by considering each propagated wavefunction separately, such that λ_{k} can be related to wavefunction overlaps (see flowchart in Fig. 1). This is motivated by the Hamiltonian averaging procedure^{36} used in VQE to reduce the circuit depth at the expense of larger number of sequential measurements. Using Fourier expansion of the inverse Hamiltonian (4), the estimated energy reads
Note that expression (6) now includes overlaps between initial and evolved wavefunction for the fixed phase, which shall be calculated separately for the numerator (“energy”) and denominator (“norm”). Finally, we note that the wavefunction overlap can be inferred using different approaches. One option corresponds to using the SWAP test,^{37,38} which represents a common quantum measurement strategy and requires system doubling. It can be conveniently realized in some nearterm setups, being successfully demonstrated for cold atom lattices by manybody interferometry of two copies of a quantum state.^{39} The overlap measurement schemes continue to improve.^{40} Additionally, in the Methods, section B, we describe an alternative approach, which does not require extra qubits and relies on the measurements of observables, once the reference state for the system is chosen.
In the previous section we described the general algorithm and discussed its key properties, namely the scaling and sequential operation. To show its use for the ground state estimation and characterize the required resources for realistic problems, we apply it to quantum chemistry.
Applications: molecular hydrogen
We start with by now the standard example of molecular hydrogen, H_{2}. As a test task we consider the spinful case. This allows to examine the protocol for a system of higher complexity (N = 4), comparable to lithium hydrate fourqubit simulation considered in ref. ^{11} The details of mapping of quantum chemical structure into qubits are presented in Methods, section C. In the following we work with fourqubit molecular hydrogen Hamiltonian \({\hat{{\mathcal{H}}}}_{{{\rm{H}}}_{2}}\), with all eigenenergies shifted to positive values. Starting from the HartreeFock (HF) energy λ_{0}, the task is to estimate GSE λ_{gs}, using the protocol described in the preceding section. This shall be done within the chemical precision ϵ, which is equal to ϵ = 0.0016 Hartree, and thus defines the relevant cutoff for the iteration procedure.
We start by benchmarking the inverse power procedure in its general form, and define how many iteration steps one needs to come close to the ground state. For this, we first perform the inverse Hamiltonian iteration in the ideal setting, assuming that an exact inverse is known. Then, we compare it to the quantum inverse iteration, which uses the Fourier approximation (4). GSE is estimated using the measurement of propagated and initial wavefunction overlaps. To quantify the performance two characteristics are employed. The first, and the most natural one, corresponds to the difference between estimated energy value λ_{k} and true GSE λ_{gs}, being Δλ∕J ≡ (λ_{k} − λ_{gs})∕J. It allows to observe the convergence and provides an indication of how well the procedure works for a given system. The second quantity corresponds to the trace distance between an idealized inverse iteration matrix \({\hat{{\mathcal{H}}}}^{k}\) and its approximation \({\hat{{\mathcal{H}}}}_{a}^{k}\), defined as a half of trace norm for the difference of two matrices. It reveals the actual success of mimicking the ideal inverse in full generality. At the same time, this is the quantity which cannot be straightforwardly observed in the experiment, and only serves for the analysis.
The results of the inverse power iteration for molecular hydrogen Hamiltonian \({\hat{{\mathcal{H}}}}_{{{\rm{H}}}_{2}}\) are shown in Fig. 2a as a function of iteration step k. The ideal version of inverse iteration is plotted in red and reveals exponential convergence to GSE. The chemical precision is achieved already at the second iteration step, as depicted by the blue shaded area starting at Δλ = 1.6 × 10^{−3}J. The idealized case is then compared to the quantum inverse iteration procedure with combined measurement of wavefunction overlaps as stated in Eq. (6). Here, we assumed that the genuine unitary evolution with Hamiltonian \({\hat{{\mathcal{H}}}}_{{{\rm{H}}}_{2}}\) is run in the analog simulation fashion. The case of digital evolution with associated Trotterization technique and its benchmarking is considered in the Supplemental Material, where we also present the circuit scheme for digital evolution. The approximation was performed using equal number of steps M_{z} = M_{y} = 30, and the discretization values Δ_{z} = Δ_{y}J were adjusted to match the maximal propagation phases of ϕ_{max}∕2π = J(M_{y}Δ_{y})(M_{z}Δ_{z})∕2π = {0.3, 0.35, 0.6, 0.95, 1.35} (here, the propagation phase is taken to be dimensionless by absorbing energy unit prefactor J from the Hamiltonian). The corresponding curves show the improvement of the quantum power iteration estimation for increasing number of iteration steps. The convergence rate also depends on the maximal phase of the propagation. For small phases (top curves in Fig. 2a), the initial estimator does not give successful convergence, but comes closer to GSE for large k. As the propagation phase grows, the approximation \({\lambda }_{k}^{{\rm{(a)}}}\) starts to resemble the idealized iteration procedure. However, this only happens up to a certain value of k past which the approximate energy grows, thus deviating from the ideal solution. From the point of view of process fidelity, the trace distance \({\rm{Tr}}[{\hat{{\mathcal{H}}}}^{k},{\hat{{\mathcal{H}}}}_{{\rm{a}}}^{k}]\) between ideal and approximate inverse operators increases monotonically with k (Fig. 2b). The increase of ϕ_{max} allows to reduce \({\rm{Tr}}[{\hat{{\mathcal{H}}}}^{k},{\hat{{\mathcal{H}}}}_{{\rm{a}}}^{k}]\) at each k.
The performance of the quantum inverse iteration procedure is further analyzed in Fig. 2c, d where energy distance to ground state and trace distance are shown as a function ϕ_{max} for several fixed iteration steps (k = 2, 4, 7). Calculations were performed accounting for two different ways of arranging the phase. First, the approximation grid was fixed setting M_{y} = M_{z} = 30 while changing Δ_{z} = Δ_{y}J (solid curves in Fig. 2c, d). In the second case the fixed step size Δ_{z} = Δ_{y}J = 0.05 was combined with the increment of M_{z,y} (dashed curves in Fig. 2c, d). For both energy distance (Fig. 2c) and trace distance (Fig. 2d) we observe no difference between two approximation procedures, but clear indication of the importance of maximal propagation phase (time). For Δλ one sees a nonmonotonic dependence on ϕ_{max}, which starts with a decrease of the energy difference for increasing maximal phase (ϕ_{max}∕2π < 0.4). At larger phases the dependence experiences pronounced dips (note the log scale), which are more visible for many iterations. Overall the difference remains wellwithin chemical precision and experiences saturation. When the trace distance is considered, one sees that success of the approximation monotonically improves with ϕ_{max}. At the same time, for fixed approximation parameters {M_{z,y}, Δ_{z,y}} it is more difficult to represent inverse iteration operator faithfully, inline with scaling analysis discussed in Methods. Finally, the comparison of results in Fig. 2c, d allows to suggest that nonmonotonicity in the spectroscopic signatures can come from the particular structure of the Hamiltonian and the initial state, where certain phases might be preferable (i.e., not all elements of the Hamiltonian matrix contribute equally to the inverse iteration procedure).
To decide on the optimal way to approximate the inverse, we consider different discretization steps for y and z auxiliary variables, characterized by the skewness parameter Δ_{y}J∕Δ_{z}. The calculation is done for M_{z} = M_{y} = 30 with the maximal phase fixed to ϕ_{max}∕2π = 0.92. The results are shown in Fig. 2e, f as a function of skew. The energy difference parameter shows that for approximating the inverse for small iteration numbers (k = 2 curve in Fig. 2e) larger skew factors are preferable, with z variable requiring finer approximation. However, for increased iteration number the optimum flows to Δ_{y}J∕Δ_{z} ~ 1 values, suggesting closetoequal spacing can work well for varied k. Examining the trace distance, we see that in unbiased setting the skew ratio of Δ_{y}J∕Δ_{z} ~ 2 is preferable.
Finally, the very important issue to address is an influence of noise on the operation of quantum inverse iteration protocol. For this we have performed the analysis including relevant dephasing processes, which influence the estimate for overlaps (see details in the Supplemental Material). Although noise makes the estimation of energies at large iteration step k less reliable, it is possible to estimate the energy within chemical precision using simple noise mitigation techniques.
Applications: beryllium hydride
To test the scalability of the approach, we consider a molecule of bigger size, which requires larger Hilbert space simulation. For this, we choose to simulate beryllium hydride (BeH_{2}) in the full spinful version using N = 8 qubits (see Methods, section D, for the details).
We proceed in the same manner as for H_{2} molecule, and quantify the operation of the quantum inverse iteration procedure for BeH_{2}. The approximation parameters were chosen as Δ_{y}J = Δ_{z} = 0.05, with the number of discretization points M_{y,z} adjusted accordingly to maintain maximal propagation phase. The results of the simulation are shown in Fig. 3. The first plot (Fig. 3a) shows that ideal iteration works well for the beryllium hydride, with chemically precise GSE obtained already at k = 1 iteration step. The Fourier approximation for the inverse at small phases does not reach required accuracy, while for the increased iteration step number and ϕ_{max}∕2π > 1 chemically accurate ground state estimate can be attained. Figure 3b shows this behavior as a function of phase for several representative k’s, and yields the same conclusion. The increase of the required propagation phase is attributed to the increased condition number for BeH_{2} Hamiltonian matrix, being 39.2 as compared to 3.38 for H_{2}.
Applications: BoseHubbard simulator
Finally, to provide an example where quantum inverse iteration algorithm can be largely beneficial, we consider the bosonic version of the Hubbard model (see sketch in Fig. 4a). The corresponding system Hamiltonian reads
where \({\hat{a}}_{i}^{\dagger }\) (\({\hat{a}}_{i}\)) corresponds to the bosonic creation (annihilation) operator at lattice site i. Here, \({\hat{n}}_{i}={\hat{a}}_{i}^{\dagger }{\hat{a}}_{i}\) corresponds to the number operator. The first term in the Hamiltonian (7) describes the tunneling of bosons with rate J, which leads to their delocalization at the lattice. For simplicity we consider a onedimensional lattice, and that tunneling happens only between neighbouring sites 〈i, j〉. The second term in Eq. (7) denotes the contact interaction between bosons with strength U. The last term corresponds to the chemical potential μ. Importantly, the BoseHubbard model corresponds to the paradigmatic example of hard material science problem,^{41} and received considerable attention from both theoretical^{42,43} and experimental perspective.^{44} In particular, the model was shown to be easily solvable in the socalled Mott insulating regime where U ≫ J and ground state corresponds to the product state of one atom per site, \({\psi}_{Mott}\rangle\) = ∏_{i}\(1\rangle\)_{i}. However, going into the superfluid regime, where J becomes comparable to U, the ground state is entangled, and it is generally difficult to study the low energy properties of this system.
We show that quantum inverse iteration algorithm can be applied to study the ground state properties of the BoseHubbard Hamiltonian in the wide range of parameters. For this, we consider an initial state corresponding to the Mott state, \({\psi}_{0}\rangle\;=\;{\psi}_{Mott}\rangle\), and perform the iteration as detailed in the “Protocol” subsection of Results. The numerical results for the energy deviation are shown in Fig. 4b, where Δλ∕U ≡ ∣λ_{k} − λ_{gs}∣∕U is plotted as a function of iteration step k. We consider N = 5 lattice with μ∕U = 0.5, different values of tunneling rate J, and similarly to H_{2} and BeH_{2} examples the energies were adjusted by trivial overall shift E_{0} to ensure positive eigenvalues. The Fourier approximation is performed using M_{y} = M_{z} = 40 and Δ_{z} = Δ_{y}U = 0.075. While for relatively small tunneling J = 0.01U the product state is a good ground state approximation, thus giving small energy deviation (lowest curve in Fig. 4b), for larger J ~ 0.1U the system enters a superfluid phase (critical value for μ = 0.5U approximately corresponds to J_{crit}∕U ≈ 0.13^{42}). Despite the qualitatively different initial state, the algorithm allows to distill correct energy properties even for large J.
Going beyond the ground state energy estimation, quantum inverse iteration can be also used to measure the correlations in the ground state of the model. We considered the correlation function of the form \(\langle {\psi }_{k} {\hat{a}}_{c+r}^{\dagger }{\hat{a}}_{c} {\psi }_{k}\rangle\), where \({\psi}_{k}\rangle\) corresponds to the propagated state, and overall procedure is similar to the one described in Eq. (6). We fix c = 3 to be the central site in the lattice, and look for intra and intersite correlations with r = 0, 1, 2. The results are shown in Fig. 4c, d, e where in the Mott insulator regime correlations falloff rapidly (Fig. 4c), while in the superfluid case the quantum inverse iteration method allows to restore genuine correlations (blue dots and curve) at increased k (Fig. 4e).
Importantly, the described BoseHubbard simulation can be performed experimentally using available controllable devices.^{39,44} First, it allows to run unitary dynamics for sufficiently long times and large particle numbers. Second, the manybody interference technique enables the convenient measurement of the wavefunction overlap, where part of the system is evolved and later is interfered with the initial copy.^{39} We note that our approach also bears similarities with recently introduced Quantum Virtual Cooling.^{45} This study demonstrated the reduction of the temperature in half, while the inverse iteration offers the access to closetozero temperature. Finally, the intriguing possibility is an application of quantum inverse iteration to 2D models^{18} and FermiHubbard model,^{15} which shall be possible with improved interference techniques.^{45}
Discussion
We have presented the algorithm for the ground state energy (GSE) estimation of a quantum Hamiltonian. It is based on the iterative application of the Hamiltonian inverse to the initial state, and can be represented as a sum of unitary evolution operators. Targeting nearterm quantum simulators, we described the protocol as a separate estimation of GSE contributions from the wavefunction overlap measurements. Then, the results from the quantum dynamical simulation are postprocessed classically, and provide energy estimate for each iteration step.
The algorithm was applied to several quantum chemistry examples, being molecular hydrogen and beryllium hydride. Using the fourqubit H_{2} simulator, we benchmarked the performance of iteration and inverse approximation, showing that the most valuable resource for GSE estimation is a maximal available time for unitary evolution. Both digital and noisy operation was considered, and found to be sufficient for a GSE calculation with chemical accuracy.
As an outlook, we highlight that the approach can be beneficial for analog quantum simulators such as cold atoms lattices,^{18} Rydberg atom simulators,^{16} trapped ions,^{17} and superconducting devices.^{46} For instance, the analogtype fermionic quantum chemistry simulator^{47} would be much valued for the task. Future applications also include material science problems, with the main target being FermiHubbard model.^{15} For instance, we note that recently proposed approach of Quantum Virtual Cooling,^{45} which was experimentally applied to BoseHubbard model, has similar iterative structure and requires interferometric measurements. This poses the question of connection between the measurementbased cooling scheme and the dynamic protocol described in the current study. Finally, we note growing interest to protocols, which exploit wavefunction overlap measurements.^{48,49} This can be seen as an emergence of hybrid algorithms, which mimic nonunitary operation, and together can form the base for dynamical quantum computing.
Methods
Scaling and faulttolerant implementation
In this section we consider the scaling for the quantum inverse iteration algorithm. For k = 1 it was shown in ref. ^{50} that the inverse Hamiltonian can be approximated up to an error ϵ setting the discretization steps to Δ_{y} = Θ (ϵ∕log(κ∕ϵ)), Δ_{z} = Θ (1∕κ log(κ∕ϵ)), and summing up to M_{y} = Θ (log(κ∕ϵ)κ∕ϵ), M_{z} = Θ (κ log(κ∕ϵ)) (κ is a condition number). The maximal evolution phase then scales as ϕ_{max} = (M_{y}Δ_{y})(M_{z}Δ_{z}) = O(κ log(κ∕ϵ)), and is an equivalent of the total gate count for analog quantum simulation. Generalizing the result to kth inverse iteration, the upper limit on the maximal required phase shall be multiplied by K, where truncation of the inverse iteration introduces an additional error. In the study we considered particular examples, and quantified the validity of Fourier approximation as a function of {M_{y}, Δ_{y}, M_{z}, Δ_{z}} parameters.
Considering the faulttolerant implementation, the approximate ground state can be prepared by applying generally nonunitary operator \({\hat{{\mathcal{H}}}}^{K}\) to the initial state \({\psi}_{0}\rangle\) using an ancillary qubit register. One possible option here is the amplitude amplification approach,^{51} which addresses the task of implementing the sum of unitary operators, of the same type as the one in Eq. (4). Moreover, since we also require simulation of Hamiltonian dynamics for \(exp(i{\phi }_{k,\ell }\hat{{\mathcal{H}}})\), which may be not accessible in analogtype simulation, the subsequent use of Hamiltonian simulation^{52} or qubitization^{53} methods would lead to favourable resource scaling. The algorithm will require O(log(L)log(cϕ_{max}∕ϵ)∕log[log(cϕ_{max}∕ϵ)]) auxiliary qubits (c ≡ ∑_{ℓ}∣c_{ℓ}∣, L = M_{y}(2M_{z} + 1)) and same order of controlled unitaries. This scaling can be compared to the iterative modification of the quantum phase estimation procedure (IPEA), based on a small fixed register^{54} or a single auxiliary qubit.^{55} The latest represents conceptually the closest algorithm to the one described in the paper, and thus will serve as benchmark. The complexity of IPEA was discussed in ref., ^{55} showing the requirement of O[log(ϵ)log(log(ϵ)∕ϵ)] phase iterations to approach an error of ϵ = 2^{−m} (energy is rescaled such that \(\parallel \hat{H}\parallel\,<\,2\pi\), and m is the number of relevant bits of precision, typically limited to <20 for quantum chemistry applications). Each kth IPEA step then requires implementation of the cU^{k} operation, defined as implementation of \({({e}^{i\hat{H}})}^{k}\), controlled on the register qubit. This leads to O[N^{4} log(ϵ)log(log(ϵ)∕ϵ)] gate count, comparable to the inverse iteration procedure described above.
Given the favorable scaling, the cost of the general purpose quantum inverse iteration algorithm can be small for future large scale quantum devices. However, generally there is no simple procedure to perform cU operation, and it requires decomposition into a set of universal gates or multilayer SWAP technique.^{56} This enlarges the actual circuit depth (while being polynomial), and precludes the implementation of \(U=exp(i\phi \hat{H})\) in analog fashion. Therefore, we target programmable devices with possible analogtype implementation and use sequential estimation strategy described in the main text.
Overlap measurement
To measure the overlap between the evolved and initial wavefunction, we propose to exploit a single eigenstate \({\psi}_{R}\rangle\) of the system as a reference, and measure the overlap with respect to its energy λ_{R} (usually set to zero). This nicely fits the task of GSE estimation for the fermionic Hamiltonian, as its Hilbert space includes a vacuum state with no fermions present (unless space reduction procedure was performed). Similar technique was used for extracting spectroscopic signatures of photon localization.^{57} The main steps for the measurement are as follows. The task is formulated as finding 〈ψ_{0}∣ψ_{0}(t)〉, where \({\psi}_{0}\rangle\) is the initial state (typically corresponding to the HartreeFock solution). The state \(\left{\psi }_{j}(t)\right\rangle =\hat{{\mathcal{U}}}(t)\left{\psi }_{j}\right\rangle\) is a timepropagated state with some unitary \(\hat{{\mathcal{U}}}\) defined by the expansion. The HF state can be prepared from the reference \({\psi}_{R}\rangle\) (vacuum or other product state) using the product of local operators, and we note that these states are orthogonal. Then, the overlap probability is measured as an expectation value of the operator \({\hat{M}}_{0}=\left{\psi }_{0}\right\rangle \left\langle {\psi }_{0}\right\) for timeevolved wavefunction, which reads
Next, the superposition of the vacuum and initial state shall be prepared as \(\left{\psi }_{+}\right\rangle =(\left{\psi }_{{\rm{R}}}\right\rangle +\left{\psi }_{0}\right\rangle )/\sqrt{2}\) and evolved to \({\psi}_{+}(t)\rangle\). Its overlap probability is measured as an expectation value of \({\hat{M}}_{+}=\left{\psi }_{+}\right\rangle \left\langle {\psi }_{+}\right\) operator. This can be written as
and provides an information about real and imaginary parts of \({{\mathcal{O}}}_{0,t}\). The same procedure is performed for measuring an expectation value of the operator \({\hat{M}}_{i}=\left{\psi }_{i}\right\rangle \left\langle {\psi }_{i}\right\), where \(\left{\psi }_{i}\right\rangle =(\left{\psi }_{{\rm{R}}}\right\rangle +i\left{\psi }_{0}\right\rangle )/\sqrt{2}\). An additional information is gained with
and both real and imaginary part of \({{\mathcal{O}}}_{0,t}\) can be found for the known reference λ_{R} from the system of Eqs. (8)–(10) as
Note that we are mostly interested in the real part of the sought overlap \({\rm{Re}}\{\langle {\psi }_{0} \psi (t)\rangle \}\), as both the “norm” and “energy” terms of λ_{k} are real, and imaginary parts of the overlap cancel out. This can be also shown formally if an exact form of expansion (3) is considered. The numerator of Eq. (6) can written termbyterm such that terms with equal \({j}_{z}=j^{\prime}_z\) are considered, accompanied by associated exponents \({e}^{i\delta \phi \hat{{\mathcal{H}}}}\) and \({e}^{i\delta \phi \hat{{\mathcal{H}}}}\). Similarly, the terms with \({j}_{z}=j^{\prime}_z\) can be grouped. Combined this leads to \({\lambda }_{k}\propto \langle {\psi }_{0} {\mathrm{cos}}(\delta \phi \hat{{\mathcal{H}}}) {\psi }_{0}\rangle\) dependence, while odd imaginary terms have vanished. Thus, it is also possible to deduce the real part indirectly as
and its sign can be inferred from the measurement in Eq. (11). We note that in principle these are two related ways to estimate the real part of the overlap, corresponding to Eqs. (11) and (13). While being equivalent in the noiseless case, the effects of decoherence make two approaches distinct (see Supplemental Material for the details). For the practical purposes we thus refer to the overlap estimate in (11) as direct estimation approach and refer to (13) as the indirect estimation.
Physically, the measurement procedure resembles the Belltype measurement, where in the simple case of twoqubits a single CNOT operation and the Hadamard gate are required. For the larger system the measurement is generalized to GHZtype, and consequently requires increasing number of two qubit operators, which depends on how much an initial HF state is different from the reference state.
Finally, we note that direct measurement is possible in atomic setups, where manybody interferometry is applied to two copies. This can be used in the analog circuits where system size doubling plays lesser role, and can compensate the absence of fully addressable individual gate operation.
Molecular hydrogen Hamiltonian
The fermionic Hamiltonian \({\hat{{\mathcal{H}}}}_{{{\rm{H}}}_{2}}\) is first written in the form of Eq. (1) (main text), where coefficients v_{ij} and V_{ijkl} are calculated by conventional quantum chemistry methods. Here, we exploited the OpenFermion package for Python,^{58} which allows to extract the interfermionic interactions for four Gaussian orbitals fit via STO3G method and perform the fermionstoqubits transformation. For the small N = 4 system we have chosen to use the JordanWigner transformation, although other options may be used as the system size increases. Specifically, we consider the bond length for H_{2} to be 0.7414 (measured in Ångström) and consider full excitation space. For concreteness, we provide the full form for the Hamiltonian, being
where X_{j}, Y_{j}, Z_{j} denote Pauli matrices for qubit j. The coefficients read ξ_{0}∕J = −0.098864, ξ_{1}∕J = 0.171198, ξ_{2}∕J = 0.222786, ξ_{3}∕J = 0.168622, ξ_{4}∕J = 0.120545, ξ_{5}∕J = 0.165867, ξ_{6}∕J = 0.174348, ξ_{7}∕J = 0.045322. The energy scale J for the actual H_{2} Hamiltonian corresponds to Hartree units, while for the quantum simulator J corresponds to the effective qubit coupling. Throughout the text, we measure energy in units of J, and the time is measured in J^{−1} units. The digital implementation for the unitary evolution with Hamiltonian (14) is presented in the Supplemental Material. The HartreeFock (HF) solution for the problem is given by the approximate ground state ψ_{0} = (↓, ↓, ↑, ↑)^{T}, and associated HF energy is −1.116684J. As required by the Fourier approximation approach, the reference energy is then shifted towards positive values by adding constant term equal to E_{0}∕J = 2, and we refer to the shifted Hamiltonian as \({\hat{{\mathcal{H}}}}_{{{\rm{H}}}_{2}}\) in the main text. Its HF energy is λ_{0} = 0.883316J after the shift. The task is then to estimate the ground state energy λ_{gs} of the Hamiltonian \({\hat{{\mathcal{H}}}}_{{{\rm{H}}}_{2}}\), achieved by preparation of approximate ground state \({\psi}_{k}\rangle\). This shall be done within the chemical precision ϵ, which is equal to ϵ = 0.0016 Hartree, and thus defines the relevant cutoff for the iteration procedure.
Beryllium hydride Hamiltonian
The molecular data structure of beryllium hydride (BeH_{2}) was generated using Psi4 quantum chemistry package^{59} considering equal Be−H distances equal to 1.33 Ångström. While generically described by six spin orbitals, we set lowest and second excited orbital to be occupied, and set multiplicity of unity, such that the ground state energy lies close to the full configurational space solution (STO3G basis). The fermionic Hamiltonian is then obtained using OpenFermion package, and as in the case of H_{2} the JordanWigner transformation was used to rewrite it in the qubit form.^{59} The problem then can be solved using N = 8 qubits. The GSE from the exact diagonalization of original BeH_{2} Hamiltonian reads −1.806750 Hartree, and analogously to the molecular hydrogen the Hamiltonian matrix is shifted by constant energy term of 2 Hartree. The product state corresponding to HartreeFock solution reads ψ_{0} = (↓, ↓, ↑, ↑, ↑, ↑, ↑, ↑)^{T}, with associated energy for the shifted Hamiltonian being λ_{0}∕J = 0.203323.
Data availability
The author declares that the data supporting the findings of this study are available within the paper and its supplementary information file.
References
Nielsen, M. A. & Chuang, I. L. Quantum Computation and Quantum Information, (Cambridge Univ. Press, 2010).
Barends, R. et al. Digitized adiabatic quantum computing with a superconducting circuit. Nature (London) 534, 222 (2016).
Martinez, E. A. et al. Realtime dynamics of lattice gauge theories with a fewqubit quantum computer. Nature (London) 534, 516 (2016).
Arute, F. et al. Quantum supremacy using a programmable superconducting processor. Nature 574, 505–510 (2019).
Wecker, D., Bauer, B., Clark, B. K., Hastings, M. B. & Troyer, M. Gatecount estimates for performing quantum chemistry on small quantum computers. Phys. Rev. A 90, 022305 (2014).
Preskill, J. Quantum Computing in the NISQ era and beyond. Quantum 2, 79 (2018).
Wecker, D. et al. Solving strongly correlated electron models on a quantum computer. Phys. Rev. A 92, 062318 (2015).
Reiher, M., Wiebe, N., Svore, K. M., Wecker, D. & Troyer, M. Elucidating reaction mechanisms on quantum computers. PNAS 114, 7555 (2017).
Lanyon, B. P. et al. Towards quantum chemistry on a quantum computer. Nat. Chem. 2, 106 (2010).
O’Malley, P. J. J. et al. Scalable quantum simulation of molecular energies. Phys. Rev. X 6, 031007 (2016).
Kandala, A. et al. Hardwareefficient variational quantum eigensolver for small molecules and quantum magnets. Nature (London) 549, 242 (2017).
Colless, J. I. et al. Computation of molecular spectra on a quantum processor with an errorresilient algorithm. Phys. Rev. X 8, 011021 (2018).
Ganzhorn, M. et al. Gateefficient simulation of molecular eigenstates on a quantum computer, arXiv:1809.05057 (2018).
Hempel, C. et al. Quantum chemistry calculations on a trappedion quantum simulator. Phys. Rev. X 8, 031022 (2018).
Mazurenko, A. et al. A coldatom FermiHubbard antiferromagnet. Nature (London) 545, 462 (2017).
Bernien, H. et al. Probing manybody dynamics on a 51atom quantum simulator. Nature (London) 551, 579 (2017).
Zhang, J. et al. Observation of a manybody dynamical phase transition with a 53qubit quantum simulator. Nature (London) 551, 601 (2017).
Jaeyoon Choi, S. et al. Exploring the manybody localization transition in two dimensions. Science 352, 1547 (2016).
McArdle, S. Endo, S., AspuruGuzik, A., Benjamin, S. & Yuan, X. Quantum computational chemistry, arXiv:1808.10402 (2018).
Yudong Cao, J. et al., Quantum Chemistry in the Age of Quantum Computing, arXiv:1812.09976 (2018).
Kitaev, A. Y. Quantum computations: algorithms and error correction. Russ. Math. Surv. 52, 1191 (1997).
Babbush, R., Love, P. J. & AspuruGuzik, A. Adiabatic quantum simulation of quantum chemistry. Sci. Rep. 4, 6603 (2014).
Peruzzo, A. et al. A variational eigenvalue solver on a photonic quantum processor. Nat. Commun. 5, 4213 (2014).
McClean, J., Romero, J., Babbush, R. & AspuruGuzik, A. The theory of variational hybrid quantumclassical algorithms. N. J. Phys. 18, 023023 (2016).
Wecker, D., Hastings, M. B. & Troyer, M. Progress towards practical quantum variational algorithms. Phys. Rev. A 92, 042303 (2015).
McArdle, S. et al. Variational quantum simulation of imaginary time evolution, arXiv:1804.03023 (2018).
Ryabinkin, I. G., Yen, T. C., Genin, S. N. & Izmaylov, A. F. Iterative Qubit Coupled Cluster approach with efficient screening of generators. J. Chem. Theory Comput. 14, 6317 (2019).
Herasymenko, Y. & O’Brien, T. E. A diagrammatic approach to variational quantum ansatz construction, arXiv:1907.08157 (2019).
McClean, J. R., Boixo, S., Smelyanskiy, V. N., Babbush, R. & Neven, H. Barren plateaus in quantum neural network training landscapes, arXiv:1803.11173 (2018).
Yimin Ge, Y., Tura, J. & Cirac, J. I. Faster ground state preparation and highprecision ground energy estimation on a quantum computer, arXiv:1712.03193 (2017).
Panju, M. Iterative methods for computing eigenvalues and eigenvectors. Waterloo Math. Rev. 1, 9 (2011).
Sachdeva, S. & N. Vishnoi, N. Approximation Theory and the Design of Fast Algorithms, arXiv:1309.4882 (2013).
Childs, A. M., Kothari, R. & Somma, R. D. Quantum algorithm for systems of linear equations with exponentially improved dependence on precision. SIAM J. Comput. 46, 1920 (2017).
Harrow, A. W., Hassidim, A. & Lloyd, S. Quantum algorithm for linear systems of equations. Phys. Rev. Lett. 103, 150502 (2009).
Long, Guilu & Liu, Yang Duality quantum computing. Front. Comput. Sci. China 2, 167 (2008).
Romero, J. et al., Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz, arXiv:1701.02691 (2017).
Ekert, A. K. et al. Direct estimations of linear and nonlinear functionals of a quantum state. Phys. Rev. Lett. 88, 217901 (2002).
Higgott, O., Wang, D. & Brierley, S. Variational Quantum Computation of Excited States, arXiv:1805.08138 (2018).
Islam, R. et al. Measuring entanglement entropy in a quantum manybody system. Nature (London) 528, 77 (2015).
Mitarai, K. & Fujii, K. Methodology for replacing indirect measurements with direct measurements. Phys. Rev. Res. 1, 013006 (2019).
Childs, A. M., Gosset, D. & Webb, Z. The BoseHubbard model is QMAcomplete, Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), pp. 308–319 (2014); arXiv:1311.3297.
Freericks, J. K. & Monien, H. Phase diagram of the BoseHubbard Model. EPL 26, 545 (1994).
Kühner, T. D., White, S. R. & Monien, H. Onedimensional BoseHubbard model with nearestneighbor interaction. Phys. Rev. B 61, 12474 (1999).
Bloch, I., Dalibard, J. & Nascimbéne, S. Quantum simulations with ultracold quantum gases. Nat. Phys. 8, 267 (2012).
Cotler, J. et al. Quantum virtual cooling. Phys. Rev. X 9, 031013 (2019).
Ma, R. et al. A Dissipatively Stabilized Mott Insulator of Photons, arXiv:1807.11342 (2018).
ArgüelloLuengo, J., GonzálezTudela, A., Shi, T., Zoller, P. & Cirac, J. I. Analog quantum chemistry simulation, arXiv:1807.09228 (2018).
Huggins, W. J., Lee, J., Baek, U., O’Gorman, B. & Whaley, K. B. A nonorthogonal variational quantum eigensolver, arXiv:1909.09114 (2019).
Huang, H.Y., Bharti, K. & Rebentrost, P. Nearterm quantum algorithms for linear systems of equations, arXiv:1909.07344 (2019).
Childs, A. M., Kothari, R. & Somma, R. D. Quantum algorithm for systems of linear equations with exponentially improved dependence on precision. SIAM J. Comput. 46, 1920 (2017).
Brassard, G., Hoyer, P., Mosca, M. & Tapp, A. Quantum Amplitude Amplification and Estimation, Quantum Computation and Quantum Information, (ed. Lomonaco, S. J. Jr.), AMS Contemporary Mathematics, 305:53–74 (2002).
Berry, D. W., Childs, A. M., Cleve, R., Kothari, R. & Somma, R. D. Simulating hamiltonian dynamics with a truncated taylor series. Phys. Rev. Lett. 114, 090502 (2015).
Low, G. H. & Chuang, I. L. Optimal hamiltonian simulation by quantum signal processing. Phys. Rev. Lett. 118, 010501 (2017).
AspuruGuzik, A., Dutoi, A. D., Love, P. J. & HeadGordon, M. Simulated quantum computation of molecular energies. Science 309, 1704 (2005).
Dobsicek, M., Johansson, G., Shumeiko, V. & Wendin, G. Arbitrary accuracy iterative quantum phase estimation algorithm using a single ancillary qubit: a twoqubit benchmark. Phys. Rev. A 76, 030306(R) (2007).
Zhou, X.Q. et al. Adding control to arbitrary unknown quantum operations. Nat. Commun. 2, 413 (2011).
Roushan, P. et al. Spectroscopic signatures of localization with interacting photons in superconducting qubits. Science 358, 1175 (2017).
McClean, J. R. et al. OpenFermion: the electronic structure package for quantum computers, arXiv:1710.07629 (2017).
Parrish, R. M. et al. Psi4 1.1: an opensource electronic structure program emphasizing automation, advanced libraries, and interoperability. J. Chem. Theory Comput. 13, 3185 (2017).
Acknowledgements
I would like to thank Anders S. Sørensen for useful discussions and suggestions, and Bart Olsthoorn for technical advise and reading the manuscript. The work was partially supported by the Megagrant 14.Y26.31.0015, and ITMO Fellowship and Professorship Program. Open access funding provided by Stockholm University.
Author information
Authors and Affiliations
Contributions
O.K. proposed the original idea, preformed calculations, analyzed results, and written the manuscript.
Corresponding author
Ethics declarations
Competing interests
The author declares 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
Kyriienko, O. Quantum inverse iteration algorithm for programmable quantum simulators. npj Quantum Inf 6, 7 (2020). https://doi.org/10.1038/s4153401902397
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s4153401902397
Further reading

Collective neutrino oscillations on a quantum computer
Quantum Information Processing (2022)

Moulding hydrodynamic 2Dcrystals upon parametric Faraday waves in shearfunctionalized water surfaces
Nature Communications (2021)