This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Variational quantum eigensolvers by variance minimization

Dan-Bo Zhang [email protected] Guangdong Provincial Key Laboratory of Quantum Engineering and Quantum Materials, GPETR Center for Quantum Precision Measurement and SPTE, South China Normal University, Guangzhou 510006, China Frontier Research Institute for Physics, South China Normal University, Guangzhou 510006, China    Zhan-Hao Yuan School of Physics, Nanjing University, Nanjing 210093, China    Tao Yin [email protected] Yuntao Quantum Technologies, Shenzhen, 518000, China
Abstract

Variational quantum eigensolver (VQE) typically minimizes energy with hybrid quantum-classical optimization, which aims to find the ground state. Here, we propose a VQE by minimizing energy variance, which is called as variance-VQE (VVQE). The VVQE can be viewed as an self-verifying eigensolver for arbitrary eigenstate by designing, since an eigenstate for a Hamiltonian should have zero energy variance. We demonstrate properties and advantages of VVQE for solving a set of excited states with quantum chemistry problems. Remarkably, we show that optimization of a combination of energy and variance may be more efficient to find low-energy excited states than those of minimizing energy or variance alone. We further reveal that the optimization can be boosted with stochastic gradient descent by Hamiltonian sampling, which uses only a few terms of the Hamiltonian and thus significantly reduces the quantum resource for evaluating variance and its gradients.

I Introduction

The variational principle is instrumental for understanding physical theories and also becomes a powerful tool for solving computational physics problems. In recent years, the power of quantum computing of near-term noisy quantum processors is expected to be exploited with variational methods Yung et al. (2014); Farhi et al. (2014); McClean et al. (2016); O’Malley et al. (2016); Li and Benjamin (2017); McClean et al. (2017); Shen et al. (2017); Kandala et al. (2017); Hempel et al. (2018); Anschuetz et al. (2018); Mitarai et al. (2018); Moll et al. (2018); Endo et al. (2018); Kokail et al. (2019); Takeshita et al. (2020); McArdle et al. (2019); Higgott et al. (2019); Wu and Hsieh (2019); Verdon et al. (2019); Liu et al. (2019a, b); Benedetti et al. (2019); Grimsley et al. (2019); Chowdhury et al. (2020); Wang et al. (2020); Zhang and Yin (2020), which refers to hybrid quantum-classical algorithms for optimization. A representative example is variational quantum eigensolver (VQE) Yung et al. (2014); McClean et al. (2016); O’Malley et al. (2016); Kandala et al. (2017); McArdle et al. (2019); Liu et al. (2019a); Grimsley et al. (2019), aiming to solve eigenstates for a quantum system that receives special interests due to its fundamental roles in quantum chemistry Yung et al. (2014); McClean et al. (2016); O’Malley et al. (2016); Kandala et al. (2017); Grimsley et al. (2019); Arute et al. (2020), quantum many-body systems Liu et al. (2019a); Kokail et al. (2019); Dallaire-Demers et al. (2020), and many other applications Anschuetz et al. (2018); Xu et al. (2019); Lubasch et al. (2020).

Interestingly, while called as eigensolver, VQE typically solve the ground state of a Hamiltonian, using the energy as a cost function to optimize. From the variational principle, such a cost function can gives an upper bound to the ground state energy. For being an eigensolver, many variants of VQE have been developed to solve excited states, which can be understood as minimizing energy in a subspace, constrained by symmetries Greene-Diniz and Ramo (2019), enforced by orthogonality Nakanishi et al. (2019), or obtained by eliminating the space of lower energy states Higgott et al. (2019), or using quantum subspace expansion McClean et al. (2017).

While those variants of VQE can be successful to some extent, an alternative approach is to directly access whether a state is an eigenstate and use this criteria as a cost function to optimize. A simple answer for this is to use zero energy variance to justify an eigenstate since an eigenstate should have zero energy variance. Variational methods based on the zero-energy variance principle Bartlett et al. (1935); Siringo and Marotta (2005); Umrigar et al. (1988); Umrigar and Filippi (2005); Khemani et al. (2016); Pollmann et al. (2016); Vicentini et al. (2019), in fact, can be originated to the early age of quantum mechanics for solving the Helium atom Bartlett et al. (1935). Remarkably, zero variance puts a very strong constraint of the wavefunction structure, and it can be powerful for solving quantum many-body problems when well-approximated wavefunction is required Pollmann et al. (2016). The variance principal has been applied experimentally to self-verify if a quantum simulator can prepare a ground state for a Hamiltonian Kokail et al. (2019). It is, however, awaiting for exploiting the power of quantum computing to develop a variational quantum eigensolver that is based on minimizing energy variance.

In this paper, we develop a variational quantum eigensolver based on minimizing energy variance, which we call as variance-VQE. For solving excited states of a Hamiltonian, we give two approaches, which represent eigenstates in different ways. One uses a single wavefunction ansatz, where different parameters correspond to different eigenstates. The other uses a set of orthogonal wavefunction ansatz, and incorporates energy variances into one cost function to optimize. We numerically solve the energy potential surface for molecules, which is a fundamental quantum chemistry problem, and demonstrate properties and advantages of variance VQE. We also show that optimizing a combination of energy and variance may be more efficient in finding a set of eigenstates with lowest energies, compared with one that optimizes energy or variance alone. Moreover, we also investigate stochastic gradient descent for optimizing VVQE with Hamiltonian sampling, which can be useful for optimization with less quantum resources. Our work demonstrates that VQE by minimizing energy variance can be useful for calculating excited states, and also work out an avenue for efficient optimization.

The paper is organized as follows. We first propose variance VQE in Sec. II, and then apply it to solve excited states for molecules in Sec. III. In Sec. IV, we investigate the stochastic gradient for optimizing VVQE. Finally, we give a summary in Sec. V.

II Variance VQE

In this section, we first review the traditional approach of variational quantum eigensolver that minimizes the energy. Then, we formulate a new type of VQE that minimizes the energy variance and then discuss its optimization.

II.1 VQE by energy minimization

We consider a Hamiltonians HH as a summation of local terms, H=i=1NciLiH=\sum_{i=1}^{N}c_{i}L_{i}, where a local Hamiltonian LiL_{i} can be written as a tensor product of a few number of Pauli matrices. We denote 𝒄=(c1,c2,,cN)T\boldsymbol{c}=(c_{1},c_{2},...,c_{N})^{T} and 𝑳=(L1,L2,,LN)T\boldsymbol{L}=(L_{1},L_{2},...,L_{N})^{T}. Thus we can write H=𝒄T𝑳H=\boldsymbol{c}^{T}\boldsymbol{L}.

The variational quantum eigensolver works as follows. One uses an ansatz |ψ(𝜽)=U(𝜽)|R|\psi(\boldsymbol{\theta})\rangle=U(\boldsymbol{\theta})|R\rangle to represent a candidate ground state. Here |R|R\rangle usually is taken as an approximation for the ground state of HH, e.g., Hartee-Fock state for the quantum chemistry problem. U(𝜽)U(\boldsymbol{\theta}) is an unitary operator parameterized with 𝜽\boldsymbol{\theta}. The task then is to optimize 𝜽\boldsymbol{\theta} for some cost function. The tradition way is to minimize the energy defined as

(𝜽)=ψ(𝜽)|H|ψ(𝜽)=Tr[ψ(𝜽)H].\mathcal{E}(\boldsymbol{\theta})=\langle\psi(\boldsymbol{\theta})|H|\psi(\boldsymbol{\theta})\rangle=\text{Tr}[\psi(\boldsymbol{\theta})H]. (1)

where we have denoted ψ(𝜽)=|ψ(𝜽)ψ(𝜽)|\psi(\boldsymbol{\theta})=|\psi(\boldsymbol{\theta})\rangle\langle\psi(\boldsymbol{\theta})|. By designing, VQE based on minimizing energy is suitable for finding ground state of a Hamiltonian.

The optimization is completed with a hybrid quantum-classical algorithm. The quantum processor prepares ψ(𝜽)\psi(\boldsymbol{\theta}) and performs measurements to evaluate (𝜽)\mathcal{E}(\boldsymbol{\theta}), which can be reduced into (𝜽)=𝒄T𝓛(𝜽)\mathcal{E}(\boldsymbol{\theta})=\boldsymbol{c}^{T}\boldsymbol{\mathcal{L}}(\boldsymbol{\theta}), where 𝓛(𝜽)=Tr(ψ(𝜽)𝑳)\boldsymbol{\mathcal{L}}(\boldsymbol{\theta})=\text{Tr}(\psi(\boldsymbol{\theta})\boldsymbol{L}). Here, quantum average of each component of 𝑳\boldsymbol{L} corresponds to a joint measurement on multiple qubits. The classical computer updates parameters 𝜽\boldsymbol{\theta} according to received data from the quantum processor, e.g., using gradient descent or gradient-free methods.

II.2 VQE by variance minimization

As the name indicates, variational quantum eigensolver should aim for solving eigenstates. However, VQE, based on minimizing energy, is prone to find only an eigenstate with the lowest energy, namely the ground state. Other VQEs have been developed for solving excited states. Essentially, those VQEs are realized by minimizing energy in a subspace, which is enforced with symmetry, or by eliminating space of lower energy states with an orthogonality condition.

Can variational quantum eigensolver directly solve excited states? An answer for this is to design cost function that can assign the same cost to all eigenstates and higher cost for other states. A natural choice is energy variance, which is zero only for eigenstates and positive for others. By minimizing energy variance, one then can find the eigenstates of a Hamiltonian. We call this as variance-VQE (VVQE), and energy-VQE(EVQE) for VQE that minimizes the energy.

Let us formulate variance-VQE. The energy variance of Hamiltonian HH with a wavefunction ψ(𝜽)\psi(\boldsymbol{\theta}) can be written as,

Δ(𝜽)\displaystyle\varDelta(\boldsymbol{\theta}) \displaystyle\equiv H2𝜽H𝜽20.\displaystyle\left<H^{2}\right>_{\boldsymbol{\theta}}-\left<H\right>_{\boldsymbol{\theta}}^{2}\geq 0. (2)

where 𝜽=ψ(𝜽)||ψ(𝜽)\left<\ast\right>_{\boldsymbol{\theta}}=\langle\psi(\boldsymbol{\theta})|\ast|\psi(\boldsymbol{\theta})\rangle. It is useful to introduce the quantum covariance matrix Bairey et al. (2019); Chertkov and Clark (2018); Qi and Ranard (2019) defined as

𝒢ij(𝜽)\displaystyle\mathcal{G}_{ij}(\boldsymbol{\theta}) =\displaystyle= LiLj𝜽Li𝜽Lj𝜽\displaystyle\left<L_{i}L_{j}\right>_{\boldsymbol{\theta}}-\left<L_{i}\right>_{\boldsymbol{\theta}}\left<L_{j}\right>_{\boldsymbol{\theta}} (3)
=\displaystyle= Tr[ψ(𝜽)LiLj]Tr[ψ(𝜽)Li]Tr[ψ(𝜽)Lj].\displaystyle\text{Tr}\left[\psi(\boldsymbol{\theta})L_{i}L_{j}\right]-\text{Tr}\left[\psi(\boldsymbol{\theta})L_{i}\right]\text{Tr}\left[\psi(\boldsymbol{\theta})L_{j}\right].

Then, the energy variance can be expressed as

Δ(𝜽)=𝒄T𝒢(𝜽)𝒄0\varDelta(\boldsymbol{\theta})=\boldsymbol{c}^{T}\mathcal{G}(\boldsymbol{\theta})\boldsymbol{c}\geq 0 (4)

The nonnegative energy variance is consisted with that 𝒢(𝜽)\mathcal{G}(\boldsymbol{\theta}) by definition is semi-positive matrix. Note that each element of 𝒢(𝜽)\mathcal{G}(\boldsymbol{\theta}) can be obtained on a quantum computer. Then, the energy variance can be evaluated based on the quantum covariance matrix.

Minimization energy variance is carried with gradient free or gradient descents. Gradient descent method requires to calculate the gradient of energy variance, which is:

Δ(𝜽)𝜽=𝒄T𝒢(𝜽)𝜽𝒄.\frac{\partial\varDelta(\boldsymbol{\theta})}{\partial\boldsymbol{\theta}}=\boldsymbol{c}^{T}\frac{\partial\mathcal{G}(\boldsymbol{\theta})}{\partial\boldsymbol{\theta}}\boldsymbol{c}. (5)

Each element 𝒢ij𝜽\frac{\partial\mathcal{G}_{ij}}{\partial\boldsymbol{\theta}} can be obtained using numeral differential or the shift rule Schuld et al. (2019). The gradient descent updates 𝜽\boldsymbol{\theta} as

𝜽t=𝜽t1ηΔ(𝜽t1)𝜽.\boldsymbol{\theta}^{t}=\boldsymbol{\theta}^{t-1}-\eta\frac{\partial\varDelta(\boldsymbol{\theta}^{t-1})}{\partial\boldsymbol{\theta}}. (6)

Since 𝒢(𝜽)\mathcal{G}(\boldsymbol{\theta}) should be evaluated with O(N2)O(N^{2}) elements, calculating energy variance costs O(N2)O(N^{2}), which is larger than a cost of O(N)O(N) for calculating energy. As a result, a direct gradient descent for variance-VQE can be more resource-costing than energy-VQE, as the optimization process is expected to have multiple runs. Nevertheless, we can use Hamiltonian sampling to reduce this cost Sweke et al. (2019), which estimates the energy variance and its gradient by sampling only a portion of the quantum covariance matrix. In Sec. IV, we will give a stochastic gradient descent algorithm for optimizing variance-VQE by Hamiltonian sampling Sweke et al. (2019), which can be efficient under a minimal sampling rate and thus can reduce the overload significantly. Besides, one may reduce the overload of evaluating the energy variance using some smarter strategies that can simultaneously access a set of quantum covariance matrix elements Huggins et al. (2019); Cotler and Wilczek (2020).

III Variance-VQE for excited states

As all eigenstates always have zero variance, optimizing variance-VQE by minimizing energy variance may lead to any eigenstate. Thus, variance-VQE can be used for obtaining excited states. In this section, we propose different approaches for solving excited states of molecule Hamiltonians with variance VQE. We first show that the cost function variance-VQE can have many global minimums of zero variance, corresponding to different excited states. However, this approach can be inefficient if a specified eigenstate is required. To overcome this, we propose variance-VQE that solves a set of excited states jointly, using a set of orthogonal wavefunction ansatz. We further demonstrate that optimization of a linear combination of energy and variance can be more efficient than optimizing energy or variance alone.

For demonstration, we use the hydrogen molecule H2H_{2} as an example. We would consider a more complicated system, H4H_{4}, in Sec. IV. All Hamiltonians are calculated with OpenFermion McClean et al. (2020), and the numeral simulation for variance VQE is conducted with the HiQ simulator framework HiQ . Under STO-3G basis, we use four qubits to describe the Hamiltonian of H2H_{2}. An UCC ansatz is taken with trotter step k=1k=1 (see Appendix. A), and there are 99 parameters (6 for single excitations and 3 for double excitations). The reference state is chosen as |0011|0011\rangle, or others in the subspace of two electrons.

III.1 Single ansatz with multiple global minimums

For the variance VQE, a criteria for being eigenstates is that energy variance Δ(𝜽)=0\varDelta(\boldsymbol{\theta})=0. If a wavefunction ansatz can represent all eigenstates, then it is expected that there are many solutions of 𝜽\boldsymbol{\theta} that Δ(𝜽)=0\varDelta(\boldsymbol{\theta})=0. In practice, as high energy eigenstates usually have higher complexity, an ansatz may only capture some eigenstates. In the optimization, one can select those minimums that are close to zero. This is indeed one advantage of variance-VQE: one can verify if an eigenstate is obtained by checking whether the variance is zero Kokail et al. (2019).

Refer to caption
Figure 1: Distribution of global minimums in the parameter space 𝜽\boldsymbol{\theta}, where the high dimension 𝜽\boldsymbol{\theta} is visualized on a plane, using multi-dimensional scaling method. E0,E1,E2,E3E0,E1,E2,E3 correspond to energy levels in an ascending order.

A direct way to calculate excited states with variance VQE is as follows. First, chose an ansatz |ψ(𝜽)|\psi(\boldsymbol{\theta})\rangle that can express considered excited states. For quantum chemistry, we can use some modified UCC ansatz with enough single-particle and double-particle excitations (see Appendix. A). Second, minimizing Δ(𝜽)\varDelta(\boldsymbol{\theta}) with randomly choice of initial parameters 𝜽0[0,2π]K\boldsymbol{\theta}_{0}\in[0,2\pi]^{K}. Third, select minimums of Δ(𝜽)\varDelta(\boldsymbol{\theta}) that are close to zero. Lastly, with optimized parameters, we can calculate their corresponding energies.

As for demonstration, we calculate spectrum of H2H_{2}. With uniformly sampled initial 𝜽\boldsymbol{\theta}, we optimize the energy variance with default optimizer in Scipy. All obtained minimums are almost zero (less than 10810^{-8}), and their corresponding energies are eigen-energies successfully. However, we find the chance to be a given eigenstate varies, e.g., solutions to ground states are far less than excited states. To illustrate this, we visualize the distribution of solutions in the parameter space, as seen in Fig. 1, by projecting the 9-dimensional parameters onto a plane, using a multidimensional scaling method that can preserve well information of distance. Note we use a distance metric d(𝜽,𝜽)=icos(θiθi)d(\boldsymbol{\theta},\boldsymbol{\theta}^{\prime})=\sum_{i}\cos(\theta_{i}-\theta^{\prime}_{i}) as θ\theta is an angle that θ1=θ2mod2π\theta_{1}=\theta_{2}~{}\text{mod}~{}2\pi. This indicates that the ground state is relatively hard to find in this method. It is also observed that multiple points of parameters may correspond to the same excited state. This can be understand as there exists many U(𝜽)U(\boldsymbol{\theta}) that can transform |R|R\rangle to the same target state. The above conclusion is the same for other reference states, e.g., |0101|0101\rangle and |0110|0110\rangle.

III.2 A set of orthogonal ansatzs

While variance-VQE can be optimized to obtain all eigenstates with a single ansatz with different optimized parameters, it can be hard to get the ground state as it requires choosing a proper initial parameter. Here we develop another method, using a set of orthogonal ansatz wavefunctions.

The orthogonality of ansatzs for different eigenstates can be easily enforced by using |ψn(𝜽)=U(𝜽)|Rn|\psi_{n}(\boldsymbol{\theta})\rangle=U(\boldsymbol{\theta})|R_{n}\rangle, where {|Rn}\{|R_{n}\rangle\} are orthogonal to each other. Note that all ansatz uses the same U(𝜽)U(\boldsymbol{\theta}) and the orthogonality of {|ψn(𝜽)}\{|\psi_{n}(\boldsymbol{\theta})\rangle\} only holds under the same 𝜽\boldsymbol{\theta}. To optimize 𝜽\boldsymbol{\theta}, we use a cost function that is equal-weighting summation of all energy variances, which can be written as,

𝒞var(𝜽)=n=0k1wnΔn(𝜽),\mathcal{C}_{\text{var}}(\boldsymbol{\theta})=\sum_{n=0}^{k-1}w_{n}\varDelta_{n}(\boldsymbol{\theta}), (7)

where Δn(𝜽)\varDelta_{n}(\boldsymbol{\theta}) is the energy variance of HH for the state |ψn(𝜽)|\psi_{n}(\boldsymbol{\theta})\rangle, and wn=1/kw_{n}=1/k. The formula is similar to that of subspace-search VQE, which requires a specified weighting {wn}\{w_{n}\} that enforces an ordering of eigenstates. We note that Eq. (7) has been used in Ref. Pollmann et al. (2016) to calculate all eigenstates of quantum many-body system with unitary matrix product ansatz.

Refer to caption
Figure 2: Spectrum of H2H_{2} with bond length. Blue dash lines are results from exact diagonalization in the whole Hilbert space. Red markers are obtained from variance-VQE in a subspace of two electrons that H2H_{2} is electronic neutral.
Refer to caption
Figure 3: Evolution of energy levels in the process of optimization. Two methods are compared: the subspace-search VQE and the variance-VQE.The bond length for H2H_{2} is λ=1\lambda=1.

While other methods usually calculate excited states one by one, this method incorporates all into a single cost function to optimize. In spirit, it can be viewed as a multi-task learning Evgeniou and Pontil (2004). As those tasks are closely related, solving them in a package may benefit each other.

Solving excited states then can be done by optimizing 𝒞var(𝜽)\mathcal{C}_{\text{var}}(\boldsymbol{\theta}) with gradient descent,

𝜽t=𝜽t1η𝒞var(𝜽t1)𝜽.\boldsymbol{\theta}^{t}=\boldsymbol{\theta}^{t-1}-\eta\frac{\partial\mathcal{C}_{\text{var}}(\boldsymbol{\theta}^{t-1})}{\partial\boldsymbol{\theta}}. (8)

Other gradient-free methods are also possible. We present the numeral results for H2H_{2}. Reference states are computational basis on a subspace with 2 particles, which has 66 states. As the UCC ansatz is particle-conserving, the wavefunction ansatz is in the subspace of 2 particles. The energy potential curve fits perfectly to that by exact diagonalization, as seen in Fig. 2.

It is noted that evaluation of the cost function Eq. (7) can be more efficient with ancillary qubits, which is given in the Appendix B. This is useful when lots of eigenstates are needed, where a direct summation can be impractical. For instance, there is an exponentially large number of terms when all eigenstates are needed.

Comparison with subspace-search VQE

It is interesting to compare the result of variance-VQE with orthogonal ansatz with that of subspace-search VQE Nakanishi et al. (2019). The subspace-search VQE focuses on a subspace of eigenstates function and optimizes a number of kk low-energy eigenstates simultaneously. The cost function is a weighted combination of all energies,

𝒞(𝜽)=n=0k1wnn(𝜽)=n=0k1wnTr[ψn(𝜽)H],\mathcal{C}(\boldsymbol{\theta})=\sum_{n=0}^{k-1}w_{n}\mathcal{E}_{n}(\boldsymbol{\theta})=\sum_{n=0}^{k-1}w_{n}\text{Tr}\left[\psi_{n}(\boldsymbol{\theta})H\right], (9)

where |ψn(𝜽)=U(𝜽)|n|\psi_{n}(\boldsymbol{\theta})\rangle=U(\boldsymbol{\theta})|n\rangle. The weightings satisfy w0>w1>w2>>wk1w_{0}>w_{1}>w_{2}>...>w_{k-1}, such that energies at optimized 𝜽\boldsymbol{\theta}^{*} will satisfy 0(𝜽)1(𝜽)k1(𝜽)\mathcal{E}_{0}(\boldsymbol{\theta}^{*})\leq\mathcal{E}_{1}(\boldsymbol{\theta}^{*})\leq...\leq\mathcal{E}_{k-1}(\boldsymbol{\theta}^{*}) (see a proof in Ref. Nakanishi et al. (2019)). It is noted that the weightings can be learned, as in the Ref. Liu et al. (2019b), which self-adjusts the weightings when variational preparing Gibbs state for a quantum system.

A problem for the subspace-search VQE is that the order of eigenstates needs to be given. It is possible that the optimization may go a long way in order to make all eigenstates rest in a given order, as revealed in Fig. 3. This can increase the complexity of the optimization. To illuminate this, we compare the evolution of energies in the optimization process for both subspace-search VQE and variance-VQE. The ordering of eigenstates in subspace-search VQE is fixed by reference states |0011,|0101,|1001,|0110,|1010,|1100|0011\rangle,|0101\rangle,|1001\rangle,|0110\rangle,|1010\rangle,|1100\rangle,which give to ascending order of energies after optimization. As seen in Fig. 3, initialized with the same parameters and thus the same energies, evolutions of energies for subspace-VQE will have complicated trajectories toward convergence. In contrast, all orthogonal ansatz wavefunctions flow directly to nearest eigenstates in the variance-VQE. We also check other ordering of eigenstates for subspace-search VQE, and find the same result. In this aspect, variance-VQE can be easier to optimize.

III.3 Minimizing a combination of energy and variance

For the orthogonal ansatz, if we only chose a subset of the Hilbert space or subspace with a fixed number, then variance-VQE can not promise that the solutions are lowest energy states. Just as the previous approach using one ansatz, the final result depends on the initial parameter and the optimization process. On the other hand, for a cost function with an equal-weighting of energies for orthogonal ansatz, it can get the lowest total energy, but can not promise each optimized state is an eigenstate. While subspace-search VQE can solve this problem, the optimization can be not efficient by assigning an order for ansatzs as eigenstates. Here, we demonstrate that a simple combination of energies and energy variances, can make the best of both to find low energy excited states.

Refer to caption
Figure 4: (Color online) Optimization processes for mixed cost function with different mixing factor ηv\eta_{v} of energy variances. Three orthogonal ansatz are used. The bond length for H2H_{2} is λ=0.8\lambda=0.8.

The cost function as a combination of energies and energy variances can be written as,

𝒞mix(𝜽)=n=0k1n(𝜽)+ηvn=0k1Δn(𝜽).\mathcal{C}_{\text{mix}}(\boldsymbol{\theta})=\sum_{n=0}^{k-1}\mathcal{E}_{n}(\boldsymbol{\theta})+\eta_{v}\sum_{n=0}^{k-1}\varDelta_{n}(\boldsymbol{\theta}). (10)

Here, all weights are the same, and ηv\eta_{v} a mixer factor. By minimizing 𝒞mix(𝜽)\mathcal{C}_{\text{mix}}(\boldsymbol{\theta}), the first term of Eq. (10) flows to low energy subspace while the second term makes sure that optimized states are eigenstates. A gradient descent process for optimizing 𝒞mix(𝜽)\mathcal{C}_{\text{mix}}(\boldsymbol{\theta}) is,

𝜽t=𝜽t1ηAnn(𝜽t1)𝜽ηAηvnΔn(𝜽t1)𝜽.\boldsymbol{\theta}^{t}=\boldsymbol{\theta}^{t-1}-\eta_{A}\sum_{n}\frac{\partial\mathcal{E}_{n}(\boldsymbol{\theta}^{t-1})}{\partial{\boldsymbol{\theta}}}-\eta_{A}\eta_{v}\sum_{n}\frac{\partial\varDelta_{n}(\boldsymbol{\theta}^{t-1})}{\partial\boldsymbol{\theta}}. (11)

In this regard, the optimization includes gradient information of both energy and energy variance, and ηv\eta_{v} plays a role in adjusting the step size between two. In Fig. 4, we show that the result of mixed VQE with different ηv\eta_{v}, and it can be seen that nonzero ηv\eta_{v} is critical to get the right eigenstates, and increasing ηv\eta_{v} can raise the efficiency for optimization. Moreover, if only energy variance is used in the cost function, the solution may not be the lowest energy eigenstates. Thus, the result demonstrates that a combination of energy and energy variance can be useful and efficient for VQE to solve low-energy excited states.

IV Hamiltonian sampling

By now, we have demonstrated that variance-VQE can efficiently solve excited states for a Hamiltonian. However, the overload of calculating variance and its gradient descent is massive since it scales with the number of Hamiltonian terms as O(N2)O(N^{2}). In this section, we propose stochastic gradient descent for variance-VQE by Hamiltonian sampling, which can significantly reduce the overload.

The Hamiltonian sampling randomly chose some components of 𝒄\boldsymbol{c} (set ci=0c_{i}=0 if cic_{i} if not chosen), which is denoted as 𝒄~\tilde{\boldsymbol{c}}. Then, the estimated energy variance is

Δ~(𝜽)=|𝒄|2|𝒄~|2𝒄~T𝒢(𝜽)𝒄~.\displaystyle\tilde{\varDelta}(\boldsymbol{\theta})=\frac{|\boldsymbol{c}|^{2}}{|\tilde{\boldsymbol{c}}|^{2}}\tilde{\boldsymbol{c}}^{T}\mathcal{G}(\boldsymbol{\theta})\tilde{\boldsymbol{c}}. (12)

A prefactor |𝒄|2𝒄~2\frac{|\boldsymbol{c}|^{2}}{\tilde{\boldsymbol{c}}^{2}} is added to account for the fact that coefficients for different terms of a Hamiltonian varies largely. Whenever c~i=0\tilde{c}_{i}=0, elements 𝒢(𝜽)ij\mathcal{G}(\boldsymbol{\theta})_{ij} do not need to be evaluated. For a sampling rate ss (defined as a ratio that cic_{i} is sampled), the number of elements in 𝒢(𝜽)ij\mathcal{G}(\boldsymbol{\theta})_{ij} required to be calculated can be reduced by a factor s2s^{2}.

With a Hamiltonian sampling, the gradient can be estimated as Δ~(𝜽)𝜽\frac{\partial\tilde{\varDelta}(\boldsymbol{\theta})}{\partial\boldsymbol{\theta}}, which shall have a distribution due to sampling. With this gradient, a stochastic gradient descent algorithm can be applied for optimizing variance-VQE, which updates parameters as

𝜽t=𝜽t1ηΔ~(𝜽t1)𝜽.\boldsymbol{\theta}^{t}=\boldsymbol{\theta}^{t-1}-\eta\frac{\partial\tilde{\varDelta}(\boldsymbol{\theta}^{t-1})}{\partial\boldsymbol{\theta}}. (13)

We apply the stochastic gradient descent for solving eigenstates of H2H_{2} and H4H_{4} with variance-VQE. The molecule H4H_{4} is investigated in a trapezoidal structure. Under sto-6g basis, we use a Hamiltonian of 66 qubits to describe H4H_{4}. The UCC ansatz is chosen as k=1k=1 with 2121 parameters, including 1515 for single-particle excitations and 66 for double-particle excitations (we only consider double-particle excitations from occupied orbitals to empty orbitals). Note that there are more than one hundred terms for the Hamiltonian, which means that Hamiltonian sampling is badly demanded to evaluate the variance.

Refer to caption
Figure 5: (Color online) Optimization of variance-VQE for H2H_{2} (upper row) and H4H_{4} (down row) with different Hamiltonian sampling rates ss. Sampling rates are adjustable, for instance, s=0.1and1s=0.1~{}\text{and}~{}1 means ss changes from 0.10.1 to 11 at the later stage of optimization. The learning rate is 0.050.05 for all cases.

Numeral simulation results are displayed in Fig. 5 for solving two eigenstates with orthogonal ansatz. For H2H_{2}, it shows that Hamiltonian sampling with a small sampling rate s=0.1,0.2s=0.1,0.2 can have comparable convergent behavior with the case without sampling. However, the variance ceases to converge at small values, due to the fluctuation of energy for a subsystem even when the whole system has zero energy variance. To solve this issue, we can turn to no sampling (sampling rate s=1s=1) at the late stage of optimization. For H4H_{4}, similar phenomena can be observed. It is noted that only one ansatz reaches the true eigenstate, while the other fail (a local minimum or the ansatz lacks the capacity to express this eigenstate), which can be seen from the nonzero energy variance. This again verifies that variance-VQE can self-verify whether an eigenstate is obtained.

We can explain why Hamiltonian sampling fails to work around the optimized point of parameters, where gradients by Hamiltonian sampling can give meaningless direction for optimization. This is because energy variance is not additive: if H=HA+HBH=H_{A}+H_{B} and the wavefunction is |ψ|\psi\rangle, then the variance of HH is not a summation of variance of HAH_{A} and variance of HBH_{B}. For example, if |ψ|\psi\rangle is an eigenstate of HH, |ψ|\psi\rangle will not be an eigenstate of HAH_{A} or HBH_{B}, if AA and BB are entangled. As a result, even at the optimized parameter of zero variance, gradients by Hamiltonian sampling can be finite. Such a property is in sharp contrast to the case of machine learning. Machine learning usually uses a set of independent and identically distributed samples, and the cost function is a summation of independent contributions from all samples. Thus, gradients can be estimated with a batch of samples, giving stochastic gradient descents with well convergence behavior Goodfellow et al. (2016).

From the above discussion, a practical strategy is to use Hamiltonian sampling with a small sampling rate to optimize the variance at a small value, then turn to a large sampling rate or no sampling. Also, one may then use energy-VQE. We note that stochastic gradient descent with few shots of measurements can further reduce the overload Sweke et al. (2019); Kübler et al. (2020), which leaves for further investigation.

V Summary

In summary, we have proposed the variance-VQE that optimizes the energy variance to obtain eigenstates for a Hamiltonian. Compared with VQE that minimizes the energy which is prone to find ground state, the variance-VQE naturally is suitable for solving and self-verifying arbitrary eigenstates. We have adopted different strategies to solve excited states with the variance-VQE, using molecules H2H_{2} and H4H_{4} as examples. Remarkably, it has been shown that optimizing a set of orthogonal ansatzs with the same parameterized circuit can be very efficient for calculating a set of eigenstates. Also, we have demonstrated that minimizing a linear combination of energy and variance can outperform the case of optimizing either energy or variance alone. Moreover, we have proposed stochastic gradient descent for minimizing the variance by Hamiltonian sampling, using only a few terms of the Hamiltonian to estimate the variance and its gradient. It has been shown that the variance can decrease quickly under a small sampling rate. While numeral simulations suggested that the variance fails to converge, Hamiltonian sampling can be useful at the early stage to locate the zone of optimized parameters. Our work has demonstrated that variance-VQE can be useful and practical for variational solving excited states for a quantum system on a quantum computer.

Acknowledgements.
This work was supported by the Key-Area Research and Development Program of GuangDong Province (Grant No. 2019B030330001), the National Key Research and Development Program of China (Grant No. 2016YFA0301800), the National Natural Science Foundation of China (Grants No. 91636218 and No. U1801661), the Key Project of Science and Technology of Guangzhou (Grant No. 201804020055).

Appendix A UCC ansatz

The UCC ansatz is widely used in the field of quantum chemistry, as it can represent a parametrized wavefunction of electronic structure of a molecule efficiently. The parametrized wavefunction can be written as,

|ψ(𝜽)=eTT|R.|\psi(\boldsymbol{\theta})\rangle=e^{T-T^{\dagger}}|R\rangle. (14)

Here, T=T1+T2T=T_{1}+T_{2} usually includes single-particle excitations T1T_{1} and double-particle excitations T2T_{2}. We adopt a notation that does not distinguish occupied and empty states in the reference state |R|R\rangle (which typically is Hartree-Fock state). Then T1T_{1} and T2T_{2} can be expressed as,

T1=pqθqpcpcq\displaystyle T_{1}=\sum_{pq}\theta^{p}_{q}c_{p}^{\dagger}c_{q}
T2=pqrsθrspqcpcqcrcs.\displaystyle T_{2}=\sum_{pqrs}\theta^{pq}_{rs}c_{p}^{\dagger}c_{q}^{\dagger}c_{r}c_{s}. (15)

To implement Eq. (14), a trotterization of eTTe^{T-T^{\dagger}} is required. However, {tqp}\{t^{p}_{q}\} and {trspq}\{t^{pq}_{rs}\} are parameters that should be optimized at first. This makes a formula as Eq. (14) can not be directly implemented on a quantum computer. Due to the variational flexibility, one can use a few Trotter step (even a single Trotter step may work good). The case of a single Trotter step can be written as Grimsley et al. (2019),

|ψ(𝜽)=pqet^pqpqrset^pqrs|R,|\psi(\boldsymbol{\theta})\rangle=\prod_{pq}e^{\hat{t}_{pq}}\prod_{pqrs}e^{\hat{t}_{pqrs}}|R\rangle, (16)

where t^pq=θqp(cpcqcqcp)\hat{t}_{pq}=\theta^{p}_{q}(c_{p}^{\dagger}c_{q}-c_{q}^{\dagger}c_{p}) and t^pqrs=θrspq(cpcqcrcscscrcpcq)\hat{t}_{pqrs}=\theta^{pq}_{rs}(c_{p}^{\dagger}c_{q}^{\dagger}c_{r}c_{s}-c_{s}^{\dagger}c_{r}^{\dagger}c_{p}c_{q}). For more Trotter steps, one can use Grimsley et al. (2019),

|ψ(𝜽)=k=1npqet^pqkpqrset^pqrsk|R.|\psi(\boldsymbol{\theta})\rangle=\prod_{k=1}^{n}\prod_{pq}e^{\hat{t}^{k}_{pq}}\prod_{pqrs}e^{\hat{t}^{k}_{pqrs}}|R\rangle. (17)

Appendix B Efficient evaluation of cost function

While the goal is to solve a number of kk excited states, evaluation of the cost function (the total energy variance) is time consuming for large kk, since it should calculate energy variance one by one. For instance, for a system of N qubits, the total number of eigenstates is 2N2^{N}. Here, we discuss how to efficient evaluate 𝒞var(𝜽)\mathcal{C}_{\text{var}}(\boldsymbol{\theta}), similar to Ref. Pollmann et al. (2016). Let us first consider k=2Nk=2^{N}. Using

I=n=02N1|ψn(𝜽)ψn(𝜽)|,I=\sum_{n=0}^{2^{N}-1}|\psi_{n}(\boldsymbol{\theta})\rangle\langle\psi_{n}(\boldsymbol{\theta})|, (18)

Eq. (7) can be rewritten as

𝒞var(𝜽)\displaystyle\mathcal{C}_{\text{var}}(\boldsymbol{\theta})
=Tr[H2n=02N1|ψn(𝜽)ψn(𝜽)|]n=02N1ψn(𝜽)|H|ψn(𝜽)2\displaystyle=Tr[H^{2}\sum_{n=0}^{2^{N}-1}|\psi_{n}(\boldsymbol{\theta})\rangle\langle\psi_{n}(\boldsymbol{\theta})|]-\sum_{n=0}^{2^{N}-1}\langle\psi_{n}(\boldsymbol{\theta})|H|\psi_{n}(\boldsymbol{\theta})\rangle^{2}
=Tr[H2]n=02N1ψn(𝜽)|H|ψn(𝜽)2.\displaystyle=Tr[H^{2}]-\sum_{n=0}^{2^{N}-1}\langle\psi_{n}(\boldsymbol{\theta})|H|\psi_{n}(\boldsymbol{\theta})\rangle^{2}. (19)

The first term equals to |𝒄|2|\boldsymbol{c}|^{2}. The second still involves a summation of exponential number terms. However, we can sum up them in a quantum parallel way. By preparing a state,

|ϕ(𝜽)\displaystyle|\phi(\boldsymbol{\theta})\rangle =\displaystyle= U(𝜽)U(𝜽)I12Nn=02N1|n|n|n\displaystyle U(\boldsymbol{\theta})\otimes U(\boldsymbol{\theta})\otimes I\frac{1}{\sqrt{2^{N}}}\sum_{n=0}^{2^{N}-1}|n\rangle|n\rangle|n\rangle (20)
=\displaystyle= n=02N1|ψn(𝜽)|ψn(𝜽)|n,\displaystyle\sum_{n=0}^{2^{N}-1}|\psi_{n}(\boldsymbol{\theta})\rangle|\psi_{n}(\boldsymbol{\theta})\rangle|n\rangle,

then it can be verified that

ϕ(𝜽)|HHI|ϕ(𝜽)=12Nn=02N1ψn(𝜽)|H|ψn(𝜽)2.\langle\phi(\boldsymbol{\theta})|H\otimes H\otimes I|\phi(\boldsymbol{\theta})\rangle=\frac{1}{2^{N}}\sum_{n=0}^{2^{N}-1}\langle\psi_{n}(\boldsymbol{\theta})|H|\psi_{n}(\boldsymbol{\theta})\rangle^{2}.

This indicates that the cost function can be efficiently calculated, at the price of increasing the number of qubits form NN to 3N3N, which makes a good deal since it can sum up an number of 2N2^{N} terms.

For general k<2Nk<2^{N}, we can adopt similar ideas. We introduce MM (requiring 2Mk>2M+12^{M}\geq k>2^{M+1}) ancilla qubits to prepare

|φ(𝜽)=U(𝜽)I1kn=0k1|n|n=n=0k1|ψn(𝜽)|n,\displaystyle|\varphi(\boldsymbol{\theta})\rangle=U(\boldsymbol{\theta})\otimes I\frac{1}{\sqrt{k}}\sum_{n=0}^{k-1}|n\rangle|n\rangle=\sum_{n=0}^{k-1}|\psi_{n}(\boldsymbol{\theta})\rangle|n\rangle,

then the first part of Eq. (7) is evaluated as

kφ(𝜽)|H2|φ(𝜽).k\langle\varphi(\boldsymbol{\theta})|H^{2}|\varphi(\boldsymbol{\theta})\rangle. (21)

To evaluate the second part of Eq. (7), the summation in Eq. (B) should be replace by k1k-1. The total number of qubits is N+N+M=2N+MN+N+M=2N+M.

References

  • Yung et al. (2014) M. H. Yung, J. Casanova, A. Mezzacapo, J. McClean, L. Lamata, A. Aspuru-Guzik,  and E. Solano, “From transistor to trapped-ion computers for quantum chemistry,” Scientific Reports 4, 3589 (2014).
  • Farhi et al. (2014) Edward Farhi, Jeffrey Goldstone,  and Sam Gutmann, “A quantum approximate optimization algorithm,” arXiv:1411.4028  (2014).
  • McClean et al. (2016) Jarrod R. McClean, Jonathan Romero, Ryan Babbush,  and Alán Aspuru-Guzik, “The theory of variational hybrid quantum-classical algorithms,” New Journal of Physics 18, 023023 (2016).
  • O’Malley et al. (2016) P.  J  J O’Malley, R. Babbush, I.  D Kivlichan, J. Romero, J.  R McClean, R. Barends, J. Kelly, P. Roushan, A. Tranter, N. Ding, B. Campbell, Y. Chen, Z. Chen, B. Chiaro, A. Dunsworth, A.  G Fowler, E. Jeffrey, E. Lucero, A. Megrant, J.  Y Mutus, M. Neeley, C. Neill, C. Quintana, D. Sank, A. Vainsencher, J. Wenner, T.  C White, P.  V Coveney, P.  J Love, H. Neven, A. Aspuru-Guzik,  and J.  M Martinis, “Scalable quantum simulation of molecular energies,” Physical Review X 6, 031007 (2016).
  • Li and Benjamin (2017) Ying Li and Simon C. Benjamin, “Efficient variational quantum simulator incorporating active error minimization,” Physical Review X 7, 021050 (2017).
  • McClean et al. (2017) Jarrod R. McClean, Mollie E. Kimchi-Schwartz, Jonathan Carter,  and Wibe A. de Jong, “Hybrid quantum-classical hierarchy for mitigation of decoherence and determination of excited states,” Phys. Rev. A 95, 042308 (2017).
  • Shen et al. (2017) Yangchao Shen, Xiang Zhang, Shuaining Zhang, Jing-Ning Zhang, Man-Hong Yung,  and Kihwan Kim, “Quantum implementation of the unitary coupled cluster for simulating molecular electronic structure,” Phys. Rev. A 95, 020501 (2017).
  • Kandala et al. (2017) Abhinav Kandala, Antonio Mezzacapo, Kristan Temme, Maika Takita, Markus Brink, Jerry M. Chow,  and Jay M. Gambetta, “Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets,” Nature 549, 242–246 (2017).
  • Hempel et al. (2018) Cornelius Hempel, Christine Maier, Jonathan Romero, Jarrod McClean, Thomas Monz, Heng Shen, Petar Jurcevic, Ben P. Lanyon, Peter Love, Ryan Babbush, Alán Aspuru-Guzik, Rainer Blatt,  and Christian F. Roos, “Quantum chemistry calculations on a trapped-ion quantum simulator,” Physical Review X 8, 031022 (2018).
  • Anschuetz et al. (2018) Eric R. Anschuetz, Jonathan P. Olson, Alán Aspuru-Guzik,  and Yudong Cao, “Variational quantum factoring,” arXiv:1808.08927  (2018).
  • Mitarai et al. (2018) K. Mitarai, M. Negoro, M. Kitagawa,  and K. Fujii, “Quantum circuit learning,” Phys. Rev. A 98, 032309 (2018).
  • Moll et al. (2018) Nikolaj Moll, Panagiotis Barkoutsos, Lev S. Bishop, Jerry M. Chow, Andrew Cross, Daniel J. Egger, Stefan Filipp, Andreas Fuhrer, Jay M. Gambetta, Marc Ganzhorn, Abhinav Kandala, Antonio Mezzacapo, Peter Müller, Walter Riess, Gian Salis, John Smolin, Ivano Tavernelli,  and Kristan Temme, “Quantum optimization using variational algorithms on near-term quantum devices,” Quantum Science and Technology 3, 030503 (2018).
  • Endo et al. (2018) Suguru Endo, Jinzhao Sun, Ying Li, Simon Benjamin,  and Xiao Yuan, “Variational quantum simulation of general processes,”  (2018), arXiv:1812.08778 [quant-ph] .
  • Kokail et al. (2019) C. Kokail, C. Maier, R. van Bijnen, T. Brydges, M. K. Joshi, P. Jurcevic, C. A. Muschik, P. Silvi, R. Blatt, C. F. Roos,  and P. Zoller, “Self-verifying variational quantum simulation of lattice models,” Nature 569, 355–360 (2019).
  • Takeshita et al. (2020) Tyler Takeshita, Nicholas C. Rubin, Zhang Jiang, Eunseok Lee, Ryan Babbush,  and Jarrod R. McClean, “Increasing the representation accuracy of quantum simulations of chemistry without extra quantum resources,” Phys. Rev. X 10, 011004 (2020).
  • McArdle et al. (2019) Sam McArdle, Tyson Jones, Suguru Endo, Ying Li, Simon C. Benjamin,  and Xiao Yuan, “Variational ansatz-based quantum simulation of imaginary time evolution,” npj Quantum Information 5, 75 (2019).
  • Higgott et al. (2019) Oscar Higgott, Daochen Wang,  and Stephen Brierley, “Variational Quantum Computation of Excited States,” Quantum 3, 156 (2019).
  • Wu and Hsieh (2019) Jingxiang Wu and Timothy H. Hsieh, “Variational thermal quantum simulation via thermofield double states,” Phys. Rev. Lett. 123, 220502 (2019).
  • Verdon et al. (2019) Guillaume Verdon, Michael Broughton, Jarrod R. McClean, Kevin J. Sung, Ryan Babbush, Zhang Jiang, Hartmut Neven,  and Masoud Mohseni, “Learning to learn with quantum neural networks via classical neural networks,” arXiv:1907.05415  (2019).
  • Liu et al. (2019a) Jin-Guo Liu, Yi-Hong Zhang, Yuan Wan,  and Lei Wang, “Variational quantum eigensolver with fewer qubits,” Phys. Rev. Research 1, 023025 (2019a).
  • Liu et al. (2019b) Jin-Guo Liu, Liang Mao, Pan Zhang,  and Lei Wang, “Solving quantum statistical mechanics with variational autoregressive networks and quantum circuits,”  (2019b), arXiv:1912.11381 [quant-ph] .
  • Benedetti et al. (2019) Marcello Benedetti, Erika Lloyd, Stefan Sack,  and Mattia Fiorentini, “Parameterized quantum circuits as machine learning models,” Quantum Science and Technology 4, 043001 (2019).
  • Grimsley et al. (2019) Harper R. Grimsley, Sophia E. Economou, Edwin Barnes,  and Nicholas J. Mayhall, “An adaptive variational algorithm for exact molecular simulations on a quantum computer,” Nature Communications 10, 3007 (2019).
  • Chowdhury et al. (2020) Anirban N. Chowdhury, Guang Hao Low,  and Nathan Wiebe, “A variational quantum algorithm for preparing quantum gibbs states,”  (2020), arXiv:2002.00055 [quant-ph] .
  • Wang et al. (2020) Youle Wang, Guangxi Li,  and Xin Wang, “Variational quantum gibbs state preparation with a truncated taylor series,”  (2020), arXiv:2005.08797 [quant-ph] .
  • Zhang and Yin (2020) Dan-Bo Zhang and Tao Yin, “Collective optimization for variational quantum eigensolvers,” Phys. Rev. A 101, 032311 (2020).
  • Arute et al. (2020) Frank Arute et al., “Hartree-fock on a superconducting qubit quantum computer,”  (2020), arXiv:2004.04174 [quant-ph] .
  • Dallaire-Demers et al. (2020) Pierre-Luc Dallaire-Demers, Michał Stęchły, Jerome F. Gonthier, Ntwali Toussaint Bashige, Jonathan Romero,  and Yudong Cao, “An application benchmark for fermionic quantum simulations,”  (2020), arXiv:2003.01862 [quant-ph] .
  • Xu et al. (2019) Xiaosi Xu, Jinzhao Sun, Suguru Endo, Ying Li, Simon C. Benjamin,  and Xiao Yuan, “Variational algorithms for linear algebra,”  (2019), arXiv:1909.03898 [quant-ph] .
  • Lubasch et al. (2020) Michael Lubasch, Jaewoo Joo, Pierre Moinier, Martin Kiffner,  and Dieter Jaksch, “Variational quantum algorithms for nonlinear problems,” Phys. Rev. A 101, 010301 (2020).
  • Greene-Diniz and Ramo (2019) Gabriel Greene-Diniz and David Muñoz Ramo, “Generalized unitary coupled cluster excitations for multireference molecular states optimized by the variational quantum eigensolver,”  (2019), arXiv:1910.05168 [quant-ph] .
  • Nakanishi et al. (2019) Ken M. Nakanishi, Kosuke Mitarai,  and Keisuke Fujii, “Subspace-search variational quantum eigensolver for excited states,” Physical Review Research 1, 033062 (2019).
  • Bartlett et al. (1935) J. H. Bartlett, J. J. Gibbons,  and C. G. Dunn, “The normal helium atom,” Physical Review 47, 679–680 (1935).
  • Siringo and Marotta (2005) F. Siringo and L. Marotta, “A variational method from the variance of energy,” The European Physical Journal C - Particles and Fields 44, 293–298 (2005).
  • Umrigar et al. (1988) C. J. Umrigar, K. G. Wilson,  and J. W. Wilkins, “Optimized trial wave functions for quantum monte carlo calculations,” Phys. Rev. Lett. 60, 1719–1722 (1988).
  • Umrigar and Filippi (2005) C. J. Umrigar and Claudia Filippi, “Energy and variance optimization of many-body wave functions,” Phys. Rev. Lett. 94, 150201 (2005).
  • Khemani et al. (2016) Vedika Khemani, Frank Pollmann,  and S.  L Sondhi, “Obtaining highly excited eigenstates of many-body localized hamiltonians by the density matrix renormalization group approach,” Phys. Rev. Lett. 116, 247204 (2016).
  • Pollmann et al. (2016) Frank Pollmann, Vedika Khemani, J. Ignacio Cirac,  and S. L. Sondhi, “Efficient variational diagonalization of fully many-body localized hamiltonians,” Phys. Rev. B 94, 041116 (2016).
  • Vicentini et al. (2019) Filippo Vicentini, Alberto Biella, Nicolas Regnault,  and Cristiano Ciuti, “Variational neural-network ansatz for steady states in open quantum systems,” Phys. Rev. Lett. 122, 250503 (2019).
  • Bairey et al. (2019) Eyal Bairey, Itai Arad,  and Netanel H. Lindner, “Learning a local hamiltonian from local measurements,” Phys. Rev. Lett. 122, 020504 (2019).
  • Chertkov and Clark (2018) Eli Chertkov and Bryan K. Clark, “Computational inverse method for constructing spaces of quantum models from wave functions,” Physical Review X 8, 031029 (2018).
  • Qi and Ranard (2019) Xiao-Liang Qi and Daniel Ranard, “Determining a local Hamiltonian from a single eigenstate,” Quantum 3, 159 (2019).
  • Schuld et al. (2019) Maria Schuld, Ville Bergholm, Christian Gogolin, Josh Izaac,  and Nathan Killoran, “Evaluating analytic gradients on quantum hardware,” Phys. Rev. A 99, 032331 (2019).
  • Sweke et al. (2019) Ryan Sweke, Frederik Wilde, Johannes Meyer, Maria Schuld, Paul K. Fährmann, Barthélémy Meynard-Piganeau,  and Jens Eisert, “Stochastic gradient descent for hybrid quantum-classical optimization,” arXiv:1910.01155v1  (2019).
  • Huggins et al. (2019) William J. Huggins, Jarrod McClean, Nicholas Rubin, Zhang Jiang, Nathan Wiebe, K. Birgitta Whaley,  and Ryan Babbush, “Efficient and noise resilient measurements for quantum chemistry on near-term quantum computers,”  (2019), arXiv:1907.13117 [quant-ph] .
  • Cotler and Wilczek (2020) Jordan Cotler and Frank Wilczek, “Quantum overlapping tomography,” Phys. Rev. Lett. 124, 100401 (2020).
  • McClean et al. (2020) Jarrod R. McClean et al., “Openfermion: the electronic structure package for quantum computers,” Quantum Science and Technology 5, 034014 (2020).
  • (48) Huawei HiQ team, ’Huawei HiQ: A High-performance Quantum Computing Simulator and Programming Framework’,http://hiq.huaweicloud.com.
  • Evgeniou and Pontil (2004) Theodoros Evgeniou and Massimiliano Pontil, “Regularized multi–task learning,” in Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’04 (Association for Computing Machinery, New York, NY, USA, 2004) p. 109–117.
  • Goodfellow et al. (2016) Ian Goodfellow, Yoshua Bengio,  and Aaron Courville, Deep Learning (MIT Press, 2016) http://www.deeplearningbook.org.
  • Kübler et al. (2020) Jonas M. Kübler, Andrew Arrasmith, Lukasz Cincio,  and Patrick J. Coles, “An Adaptive Optimizer for Measurement-Frugal Variational Algorithms,” Quantum 4, 263 (2020).