We propose a quantum inverse algorithm (QInverse) to directly determine general eigenstates by repeatedly applying the inverse power of a shifted Hamiltonian to an arbitrary initial state. To properly deal with the strongly entangled inverse power states and the resultant excited states, we solved the underlying linear equation, both variationally and adaptively, to obtain a faithful inverse power state with a shallow quantum circuit. QInverse is singularity-free and successfully obtains the target excited states with an energy closest to the shift ω, which is difficult to reach using variational methods. We also propose a subspace expansion approach to accelerate convergence and show that it is helpful to determine the two nearest eigenvalues when they are equally close to ω. These approaches were compared with the folded-spectrum method, which aims to generate excited states through variational optimization. It is shown that, whereas the folded-spectrum approach often fails to predict the target state by falling into a local minimum owing to its variational features, the success rate and accuracy of our algorithms are systematically improvable.
We propose a quantum inverse algorithm (QInverse) to directly determine general eigenstates by repeatedly applying the inverse power of a shifted Hamiltonian to an arbitrary initial state. To properly deal with the strongly entangled inverse power states and the resultant excited states, we solved the underlying linear equation, both variationally and adaptively, to obtain a faithful inverse power state with a shallow quantum circuit. QInverse is singularity-free and successfully obtains the target excited states with an energy closest to the shift ω, which is difficult to reach using variational methods. We also propose a subspace expansion approach to accelerate convergence and show that it is helpful to determine the two nearest eigenvalues when they are equally close to ω. These approaches were compared with the folded-spectrum method, which aims to generate excited states through variational optimization. It is shown that, whereas the folded-spectrum approach often fails to predict the target state by falling into a local minimum owing to its variational features, the success rate and accuracy of our algorithms are systematically improvable.
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.
Recent research has shown that wavefunction evolution in real and imaginary time can generate quantum subspaces with significant utility for obtaining accurate ground state energies. Inspired by these methods, we propose combining quantum subspace techniques with the variational quantum eigensolver (VQE). In our approach, the parameterized quantum circuit is divided into a series of smaller subcircuits. The sequential application of these subcircuits to an initial state generates a set of wavefunctions that we use as a quantum subspace to obtain high-accuracy groundstate energies. We call this technique the circuit subspace variational quantum eigensolver (CSVQE) algorithm. By benchmarking CSVQE on a range of quantum chemistry problems, we show that it can achieve significant error reduction in the best case compared to conventional VQE, particularly for poorly optimized circuits, greatly improving convergence rates. Furthermore, we demonstrate that when applied to circuits trapped at local minima, CSVQE can produce energies close to the global minimum of the energy landscape, making it a potentially powerful tool for diagnosing local minima.
The calculation of excited state energies of electronic structure Hamiltonians has many important applications, such as the calculation of optical spectra and reaction rates. While low-depth quantum algorithms, such as the variational quantum eigenvalue solver (VQE), have been used to determine ground state energies, methods for calculating excited states currently involve the implementation of high-depth controlled-unitaries or a large number of additional samples. Here we show how overlap estimation can be used to deflate eigenstates once they are found, enabling the calculation of excited state energies and their degeneracies. We propose an implementation that requires the same number of qubits as VQE and at most twice the circuit depth. Our method is robust to control errors, is compatible with error-mitigation strategies and can be implemented on near-term quantum computers.
Calculating the energy spectrum of a quantum system is an important task, for example to analyze reaction rates in drug discovery and catalysis. There has been significant progress in developing algorithms to calculate the ground state energy of molecules on near-term quantum computers. However, calculating excited state energies has attracted comparatively less attention, and it is currently unclear what the optimal method is. We introduce a low depth, variational quantum algorithm to sequentially calculate the excited states of general Hamiltonians. Incorporating a recently proposed technique [O. Higgott, D. Wang, and S. Brierley, arXiv:1805.08138], we employ the low depth swap test to energetically penalize the ground state, and transform excited states into ground states of modified Hamiltonians. We use variational imaginary time evolution as a subroutine, which deterministically propagates toward the target eigenstate. We discuss how symmetry measurements can mitigate errors in the swap test step. We numerically test our algorithm on Hamiltonians which encode 3SAT optimization problems of up to 18 qubits, and the electronic structure of the lithium hydride molecule. As our algorithm uses only low depth circuits and variational algorithms, it is suitable for use on near-term quantum hardware.
Variational Quantum Eigensolver (VQE) has emerged as a prominent hybrid quantum-classical algorithm for near-term quantum computing, particularly in applications like quantum machine learning. However, the performance of VQE is significantly constrained by the limitations of classical optimization methods employed to minimize the expectation value of the Hamiltonian. Traditional VQE approaches often suffer from slow convergence and sensitivity to initial conditions, particularly when dealing with complex, high-dimensional problems encountered in machine learning scenarios. This work introduces a novel adaptive quantum computing framework for VQE optimization, designed to dynamically adjust the quantum circuit parameters during the optimization process. By continuously monitoring the optimization progress and intelligently modifying the parameters, we aim to accelerate convergence and improve the robustness of VQE algorithms for machine learning tasks. The core idea is to shift from a static, fixed-parameter VQE to a dynamic, adaptive one. We explore various adaptive control strategies and demonstrate their potential to significantly reduce the number of iterations required to reach a solution, leading to improved computational efficiency and enabling VQE to tackle more complex machine learning problems within the constraints of current quantum hardware. The research focuses on the theoretical underpinnings and the design principles of this adaptive approach, laying the foundation for future implementations and experimental validation.
In this work, we introduce a quantum inverse power iteration (QIPI) algorithm based on the quantum singular value transformation (QSVT) to target arbitrary excited states. Given an energy shift ω, QIPI prepares the target excited state by iteratively applying an approximation of the shifted inverse Hamiltonian (H−ωI)−1 to a trial state. Prior quantum inverse power approaches typically relied on Fourier decompositions of the inverse Hamiltonian, with numerical quadrature used to reconstruct the transformation, but such methods are highly sensitive to hyperparameter choices and have been observed to be numerically unstable, effectively restricting their use to ground-state preparation. To enable robust excited-state targeting, we investigate two alternative transformation techniques: a Chebyshev decomposition of the inverse (Cheb-inv) and an eigenstate filtering (EF) approach based on QSVT. We find that EF-based QIPI is substantially more robust than Cheb-inv and other decomposition-based approaches due to the symmetry of the applied filtering polynomial, avoiding divergence with respect to the choice of ω and efficiently suppressing off-target eigenstates even in closely spaced spectra. Numerical simulations for molecular Hamiltonians of H2, LiH, and BeH2 show improved convergence and enhanced access to higher excited states relative to other quantum power methods. Assuming standard oracle access to the Hamiltonian, we further provide logical resource estimates in fault-tolerant settings in terms of T gate counts, and conclude that QIPI can achieve high target state amplification with modest polynomial degrees, thereby making it a promising candidate for scalable excited-state preparation in fault-tolerant quantum chemistry applications.