Efficient targeting of arbitrary excited states with quantum inverse power iteration through filtering polynomials
- URL: http://arxiv.org/abs/2606.28255v1
- Date: Fri, 26 Jun 2026 16:41:00 GMT
- Title: Efficient targeting of arbitrary excited states with quantum inverse power iteration through filtering polynomials
- Abstract summary: We introduce a quantum inverse power (QIPI) algorithm based on the quantum singular value transformation (QSVT) to target arbitrary excited states.<n>QIPI can achieve high target state amplification with modest degrees, thereby making it a promising candidate for scalable excited-state preparation in fault-tolerant quantum chemistry applications.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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 H$_2$, LiH, and BeH$_2$ 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.
Related papers
- Linearised quantum signal processing [0.0]
We show that UHET can be interpreted as a (randomised) linearisation of Generalised QSP (GQSP)<n>We introduce a linearised variant of (Hamiltonian-based) QSVT, that enables the efficient transformation of the singular values of any arbitrary matrix $A$ encoded in a block of a Hamiltonian.<n>Our algorithm requires the sole condition that $f$ vanishes at the origin.
arXiv Detail & Related papers (2026-08-14T15:29:37Z) - Orbital-optimized spin-adapted multistate contracted VQE for excited states and properties on quantum hardware [0.0]
We introduce the orbital-optimized multistate contracted variational quantum eigensolver (oo-MC-VQE)<n>Spin-adapted operators ensure that the spin symmetry of the reference states is conserved throughout the VQE optimization.<n>We execute the method on real quantum devices to compute absorption spectra for two benchmark molecular systems.
arXiv Detail & Related papers (2026-06-13T21:58:59Z) - Quantum Amplitude-Amplification Eigensolver: A State-Learning-Assisted Approach beyond Energy-Gradient-Based Heuristics [4.181599718305555]
Ground-state estimation lies at the heart of a broad range of quantum simulations.<n>We develop the quantum amplitude-amplification eigensolver (QAAE)<n>QAAE coherently drives a trial state toward the ground state via quantum amplitude amplification.
arXiv Detail & Related papers (2025-11-15T07:00:00Z) - Qumode-Based Variational Quantum Eigensolver for Molecular Excited States [43.148034499498586]
We introduce the Qumode Subspace Variational Quantum Eigensolver (QSS-VQE), a hybrid quantum-classical algorithm for computing molecular excited states.<n>We demonstrate the performance of QSS-VQE through simulations of molecular excited states, including dihydrogen and a conical intersection in cytosine.
arXiv Detail & Related papers (2025-09-05T00:53:51Z) - Efficient quantum state tomography with Chebyshev polynomials [25.72183861471451]
We introduce an approximate tomography method for pure quantum states encoding complex-valued functions.<n>By treating the truncation order of the Chebyshevs as a controllable parameter, the method provides a practical balance between efficiency and accuracy.
arXiv Detail & Related papers (2025-09-02T09:09:23Z) - Accelerating Quantum Reinforcement Learning with a Quantum Natural Policy Gradient Based Approach [36.05085942729295]
This paper introduces a Quantum Natural Policy Gradient (QNPG) algorithm, which replaces the random sampling used in classicalNPG estimators with a deterministic gradient estimation approach.<n>The proposed QNPG algorithm achieves a sample complexity of $tildemathcalO(epsilon-1.5)$ for queries to the quantum oracle, significantly improving the classical lower bound of $tildemathcalO(epsilon-2)$ for queries to the Markov Decision Process (MDP)
arXiv Detail & Related papers (2025-01-27T17:38:30Z) - Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [36.94429692322632]
We propose a variational strategy based on symmetry-preserving cost functions to iteratively construct a reduced subspace for extraction of low-lying energy states.<n>As a proof of concept, we test the proposed algorithms on H4 chain and ring, targeting both the ground-state energy and the charge gap.
arXiv Detail & Related papers (2024-11-25T20:33:47Z) - Enhancing Scalability of Quantum Eigenvalue Transformation of Unitary Matrices for Ground State Preparation through Adaptive Finer Filtering [0.13108652488669736]
Hamiltonian simulation is a domain where quantum computers have the potential to outperform classical counterparts.<n>One of the main challenges of such quantum algorithms is increasing the system size.<n>We present an approach to improve the scalability of eigenspace filtering for the ground state preparation of a given Hamiltonian.
arXiv Detail & Related papers (2024-01-17T09:52:24Z) - A self-consistent field approach for the variational quantum
eigensolver: orbital optimization goes adaptive [52.77024349608834]
We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE)
This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
arXiv Detail & Related papers (2022-12-21T23:15:17Z) - Benchmarking adaptive variational quantum eigensolvers [63.277656713454284]
We benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves.
We find both methods provide good estimates of the energy and ground state.
gradient-based optimization is more economical and delivers superior performance than analogous simulations carried out with gradient-frees.
arXiv Detail & Related papers (2020-11-02T19:52:04Z) - Gate-free state preparation for fast variational quantum eigensolver
simulations: ctrl-VQE [0.0]
VQE is currently the flagship algorithm for solving electronic structure problems on near-term quantum computers.
We propose an alternative algorithm where the quantum circuit used for state preparation is removed entirely and replaced by a quantum control routine.
As with VQE, the objective function optimized is the expectation value of the qubit-mapped molecular Hamiltonian.
arXiv Detail & Related papers (2020-08-10T17:53:09Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.