Efficient targeting of arbitrary excited states with quantum inverse power iteration through filtering polynomials
summary
The gist
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.
In short
This work introduces a Quantum Inverse Power Iteration (QIPI) algorithm using an Eigenstate Filtering Polynomial (EF) based on Quantum Singular Value Transformation (QSVT). This method robustly targets arbitrary excited states in quantum chemistry by suppressing unwanted states, outperforming traditional decomposition methods. It offers a scalable framework for preparing any desired eigenpair.
Key concepts
- Quantum Inverse Power Iteration (QIPI)
- QIPI is an iterative algorithm that uses an approximation of the inverse Hamiltonian to find specific quantum states. It works by repeatedly applying this approximation to a trial state, gradually refining it toward the target state. This iterative process makes it useful for finding states beyond the ground state.
- Eigenstate Filtering Polynomial (EF)
- This polynomial is constructed specifically to filter out unwanted energy eigenstates during the iteration. It has a property where its values are small on the spectrum of undesired states, allowing the algorithm to efficiently suppress them. This filtering mechanism makes QIPI much more robust than other methods.
- Quantum Singular Value Transformation (QSVT)
- QSVT is a transformation technique used in this paper to help construct the filtering polynomial. It helps in identifying and manipulating the spectral properties of the Hamiltonian, which is crucial for designing an effective EF that can target arbitrary excited states.
Terminology used across episodes
This episode discusses
- Efficient targeting of arbitrary excited states with quantum inverse power iteration through filtering polynomials · Paper Radio
- Quantum measurements and the Abelian Stabilizer Problem
- Imaginary Time Spectral Transforms for Excited State Preparation
- Scalable Quantum Computation of Highly Excited Eigenstates with Spectral Transforms
- Quantum Power Iteration Unified Using Generalized Quantum Signal Processing
- Generalized Quantum Signal Processing and Non-Linear Fourier Transform are equivalent
- Transversal surface-code game with reconfigurable qubits · Paper Radio
- Magic state cultivation: growing T states as cheap as CNOT gates
The paper
Efficient targeting of arbitrary excited states with quantum inverse power iteration through filtering polynomials · Read on arXiv
Srushti Patil, Nina Glaser
NNF Quantum Computing Program · Niels Bohr Institute · Department of Chemistry, University of Copenhagen
Transcript
Introduction to the show: ident: Quantum Radio. Generated commentary on the latest quantum physics and condensed matter papers.
Kai: We're looking at the paper: "Efficient targeting of arbitrary excited states with quantum inverse power iteration through filtering polynomials".
Title and authors: Mira: So we’re focusing on the title and who wrote it first. The paper is "Efficient targeting of arbitrary excited states with quantum inverse power iteration through filtering polynomials." The authors are Srushti Patil and Nina Glaser.
Kai: I see they've put a lot of focus on how this method handles those excited states that are usually buried deep in the energy spectrum. It’s not just about finding *any* state, it’s about finding *arbitrary* ones, which is a big claim for a power iteration method.
Lev: When I look at the authors, they seem to be coming from a solid quantum chemistry background, which is good for understanding the physics involved. But what I wonder is how much of this stability comes from the new technique they propose versus just clever tuning of some parameters.
Kai: Well, they specifically investigate two alternative transformation techniques: Chebyshev decomposition and an eigenstate filtering approach based on QSVT. They found that the filtering approach is substantially more robust because of a symmetry in the applied polynomial, which helps it avoid divergence even when you change the energy shift omega or when you have states that are really close together in energy.
Mira: That robustness is key because those closely spaced spectra are where most of these excited states live, and decomposition-based methods often struggle there. The paper suggests this filtering method efficiently suppresses off-target eigenstates even when they are very close to the target state.
The paper's summary: Kai: So what is the actual core of what they found in this work? Basically, they’re using QIPI based on QSVT to prepare a target excited state by repeatedly applying an approximation of that shifted inverse Hamiltonian. This is different from older methods that used Fourier decompositions and numerical quadrature.
Mira: And the summary highlights that while standard power iteration works for ground states, it becomes computationally prohibitive when you try to access interior eigenstates because the required polynomial degrees just keep getting bigger instead of smaller as you get a better guess for the energy.
Lev: That's the classic problem with direct inversion methods on large quantum systems. It’s not just about needing more math; it's about the sheer cost scaling up too fast for real hardware simulations.
Kai: They introduce two schemes: one based on Chebyshev decomposition, which they found unsuitable because it needs very high polynomial degrees for interior states, and another, the Eigenstate Filtering Polynomial approach. This second scheme constructs a polynomial P that has a value of one at zero and very small values across the rest of the spectrum.
Mira: That filtering polynomial construction is what makes it special. It yields the largest compression of unwanted components among all real polynomials that satisfy that initial condition, which is what gives it its robustness against those closely spaced spectra we talked about earlier.
The paper's improvements: Lev: The results they show for small molecules like H2, LiH, and BeH2 are interesting because they actually show improved convergence and better access to higher excited states compared to other quantum power methods. That’s a tangible win for accessing those higher energy levels.
Kai: And the resource estimates are what really matter for us in this conversation. They provide logical resource estimates in fault-tolerant settings, specifically in terms of T gate counts, which is crucial when we think about running this on actual quantum hardware.
Mira: The paper concludes that QIPI can achieve high target state amplification using only modest polynomial degrees, which they suggest makes it a promising candidate for scalable excited-state preparation in fault-tolerant quantum chemistry applications. It's not demanding the huge polynomial degrees that the decomposition methods required.
Lev: Modest polynomial degrees are what I need to hear when thinking about gate count overhead. If we can keep the degree low, it keeps the T gate count manageable, even if we have to deal with rotation precision issues later on.
Kai: And they do give us a concrete query complexity estimate, which is O of d times k. This simplifies down to something like O of one over delta log one over eta up to some constant factors, which depends on the spectral gap and how accurate you want your target state to be.
Conclusion: Mira: To wrap this up, the paper introduces QIPI as a scalable framework for excited-state preparation that can target any desired eigenpair in a molecular system, not just the low-lying ones. It's really showing that we can tackle arbitrary excited states in this way.
Lev: For real hardware, the iterative structure of QIPI is actually pretty good for noise mitigation because you get some partial mitigation of residual noise through that repeated application, even though the cost still scales with rotation precision and polynomial degree d.
Kai: So what this means for us is that QIPI remains a practical candidate for implementation on future fault-tolerant quantum computers, especially when we consider lower precisions up to one over ten to the power of negative three <ref:2606.28255#pg2>.
Mira: We need to remember that the authors themselves flag a limitation: while it's robust, the per-iteration resource scaling still grows with both the polynomial degree d and one over epsilon, which is our rotation precision.
Lev: So for mid-term fault-tolerant regimes, having a fixed budget on rotation precision seems sufficient to preserve that target state amplification, making QIPI more accessible than we might have thought before.
Kai: It’s a versatile method for reaching any eigenpair in chemistry and many-body physics, and they are making concrete claims about its feasibility in the near future. We'll keep an eye on this paper as it moves toward implementation.
More episodes
- 2603.29754-Coherent and dissipative energy transfer in driven open quantum systems: a driven quantum master equation approach
- 2604.01157-Thermal Entanglement and Out-of-Equilibrium Thermodynamics in 1D Bose Gases
- 2604.06410-Directional and correlated optical emission from a waveguide-engineered molecule with local control
- 2604.07214-Quantum Gibbs sampling through the detectability lemma
- 2604.13165-Finite-size Entanglement Certification via Third-Order Local Randomized Measurements
- 2604.18542-Dissipative Preparation of Correlated Quantum States in Dipolar Rydberg Arrays
- 2605.00096-Scalable spin-nematic squeezing in multi-level dipole-interacting Rydberg atom arrays
- 2605.02565-Sample-Based Quantum Diagonalization with Amplitude Amplification
- 2605.20111-Mechanism of wavefunction collapse in measurements of separated quantum subsystems
- 2606.05097-No-Go Theorem for Gaussian Quantum Repeaters from Fractional Extendibility