We show that the standard Lanczos algorithm can be efficiently implemented statistically and self-consistently improved, using the stochastic reconfiguration method, which has been recently introduced to stabilize the Monte Carlo sign problem instability. With this scheme a few Lanczos steps over a given variational wave function are possible even for large size as a particular case of a more general and more accurate technique that allows to obtain lower variational energies. This method has been tested extensively for a strongly correlated model like the $t\ensuremath{-}J$ model. With the standard Lanczos technique it is possible to compute any kind of correlation functions, with no particular computational effort. By using the fact that the variance $〈{H}^{2}〉\ensuremath{-}〈H{〉}^{2}$ is zero for an exact eigenstate, we show that the approach to the exact solution with few Lanczos iterations is indeed possible even for $\ensuremath{\sim}100$ electrons for reasonably good initial wave functions. The variational stochastic reconfiguration technique presented here allows in general a many-parameter energy optimization of any computable many-body wave function, including for instance generic long-range Jastrow factors and arbitrary site-dependent orbital determinants. This scheme improves further the accuracy of the calculation, especially for long-distance correlation functions.
The steepest descent perturbation theory is extended to the calculation of the energy and eigenfunction of the excited state of a quantum system. In case of the orthogonality of the trial function for the excited state to those for lower-energy state or ground state in the same symmetry class is preserved, the variational collapse to lower energy state can be avoided in this proposal. An iterative procedure is given for generating better eigenvalue and eigenfunction of the excited state without requiring an infinite summation over reference states as in conventional perturbation theory. This new perturbation method can be applied to calculate the excitation energy and wave function of excited states for any many-body quantum system to a high degree of accuracy without so much computational effort as in conventional method.
We report an attempt to calculate energy eigenvalues of large quantum systems by the diagonalization of an effectively truncated Hamiltonian matrix. For this purpose we employ a specific way to systematically make a set of orthogonal states from a trial wavefunction and the Hamiltonian. In comparison with the Lanczos method, which is quite powerful if the size of the system is within the memory capacity of computers, our method requires much less memory resources at the cost of the extreme accuracy. In this paper we demonstrate that our method works well in the systems of one-dimensional frustrated spins up to 48 sites, of bosons on a chain up to 32 sites and of fermions on a ladder up to 28 sites. We will see this method enables us to study eigenvalues of these quantum systems within reasonable accuracy.
Highly excited states of quantum many-body systems are central objects in the study of quantum dynamics and thermalization that challenge classical computational methods due to their volume-law entanglement content. In this work, we explore the potential of variational quantum algorithms to approximate such states. We propose an adaptive variational quantum eigensolver (VQE) for excited states (X) that self-generates a variational ansatz for arbitrary eigenstates of a many-body Hamiltonian
H by attempting to minimize the energy variance with respect to
H. We benchmark the method by applying it to an Ising spin chain with integrable and nonintegrable regimes, where we calculate various quantities of interest, including the total energy, magnetization density, and entanglement entropy. We also compare the performance of adaptive VQE-X to an adaptive variant of the folded-spectrum method. For both methods, we find a strong dependence of the algorithm's performance on the choice of operator pool used for the adaptive construction of the ansatz. In particular, an operator pool including long-range two-body gates accelerates the convergence of both algorithms in the nonintegrable regime. We also study the scaling of the number of variational parameters with system size, finding that an exponentially large number of parameters may be necessary to approximate individual highly excited states. Nevertheless, we argue that these methods lay a foundation for the use of quantum algorithms to study finite-energy-density properties of many-body systems.
Markovian open quantum systems are well modeled by the Lindblad Master Equation (ME)
dtdρt=Lρt, where
L is a linear (super-)operator and
ρt is the system state, a positive matrix. When designing or characterizing a quantum system, one is usually interested in the steady state
ρ∞ (such that
Lρ∞=0), the first few excited states, and trajectories
t↦ρt. In finite dimension,
ρt is an
n×n matrix,
L thus typically costs
n4 to store explicitly as a dense matrix, and
O(n6) to diagonalize or invert exactly, making standard linear algebraic techniques expensive for large systems. However,
L usually costs only
O(n3) to apply. This makes iterative methods appealing, but they do not work without a good preconditioner. In this article, our main observation is that a part of the Lindblad equation, corresponding to the so-called no-jump evolution
S, can be inverted efficiently. Using this inverse map, we introduce an auxiliary completely positive trace-preserving (CPTP) map
Φ whose fixed point is directly related to
ρ∞, all the other eigenvalues having smaller magnitude. The map
Φ is thus well suited to iterative methods, and
ρ∞ can be found in a few Arnoldi iterations. Using the same inverse map
S−1 as preconditioner, we compute the low-lying spectrum efficiently via shift-invert Arnoldi, and, as a proof of concept, build an implicit time integrator that is competitive on stiff systems in the low-precision regime. For the steady-state and low excited states problems, our methods scale like
O(n3) per iteration and offer state-of-the-art performance on CPU and GPU.
A new fast algorithm for calculating a few maximum (or minimum) eigenvalues and the corresponding eigenvectors of large N × N Hermitian matrices is presented. The method is based on a molecular dynamics algorithm for N coupled harmonic oscillators. The time step for iteration is chosen so that only the normal mode with the maximum eigenvalues grows exponentially. Other eigenvalues and eigenvectors are obtained one by one from the largest eigenvalue by repeating the process in subspaces orthogonal to the previous modes. The characteristics of the algorithm lie in the simplicity, speed (CPU time α N2), and memory efficiency (O(N) besides the matrix). The effectiveness of the algorithm is illustrated by calculation of the groundstate and first-excited state energies of the Heisenberg model for an antiferromagnetic chain with N up to 16384.