Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

The Journal of Chemical Physics

Extraction, through filter-diagonalization, of general quantum eigenvalues or classical normal mode frequencies from a small number of residues or a short-time segment of a signal. I. Theory and application to a quantum-dynamics model

Michael R. Wall, Daniel Neuhauser

Published May 22, 1995• 567 citations
Publisher

Abstract

In a previous paper we developed a method, Filter-Diagonalization, for extracting eigenvalues and eigenstates of a given operator at any desired energy range. In essence, the method eliminates correlation between distant eigenstates through a short-time filter while correlations between closely lying states are eliminated by diagonalization. Here we extend Filter-Diagonalization. When used to extract eigenvalues for a given operator H, we show that all eigenvalue information is directly extracted from a short segment of the correlation function C(t)=(ψ(0)‖e−iHt‖ψ(0)), or alternately from a small number of residues (ψ(0)‖Rn(H)‖ψ(0)), where ψ(0) is a random initial function and Rn(H) is any desired polynomial expansion in H. The implications of this feature are twofold. First, in contrast to the previous version the wave packet needs only to be propagated once (to prepare C(t)), and eigenstates at all desired energy windows can then be extracted with negligible extra computation time (and negligible storage requirements). In a simulation presented here, accurate eigenvalues are extracted using propagation times which are only a 0.0041 fraction of the ‘‘natural’’ time, i.e., the time by which the relative phase of the two closest eigenstates reaches 2π. The second and more important feature is that the method is automatically suitable for extracting eigenvalues (or normal modes) using a short-time segment of any signal C(t) which is a sum of (unknown) Fourier components (C(t)=∑ndne−iεnt) regardless of its origin. In addition to its use for determining eigenvalues of known operators, the method may also be utilized to extract normal modes from classical-dynamics simulations, eigenstates from real-time Quantum Monte-Carlo studies, frequencies from experimental optical or electrical signals, or be utilized in any other circumstance where a correlation function or general signal is only known for short times (or expensive to generate at long times).

DOI
10.1063/1.468999

Related papers

Hamiltonian spectra in quantum computers through the generalized eigenvalue method

Valery Simonyan, Greg Ridgway, Paulo Bedaque

Quantum computers can generate real-time correlators of field theories. By adapting the generalized eigenvalue problem to these correlators, energy eigenvalues can be extracted directly. The method is tested using both classical simulations and quantum hardware, successfully resolving several low-lying energy levels in agreement with exact diagonalization. Comparison with an alternative spectrum determination based on the Fourier transform of correlators shows that the proposed approach is substantially more efficient.

quant-pharXiv:2608.08181•Aug 11, 2026•0 citations

Spectral filters in quantum mechanics: A measurement theory perspective

Amrendra Vijay, Róbert E. Wyatt

We present the time-domain theory of spectral filters, starting with the basic propositions of the theory of measurement in quantum mechanics, and develop its parameter-free implementation in the traditional correlation function as well as the filter diagonalization (FD) form. The present study unifies all the time-domain spectral filter algorithms in the literature, under a single theme which is based on the notion of selective measurements. For specific numerical purposes, we have selected Chebyshev polynomials for developing the time propagator and this permits us to carry out the relevent time integrals fully analytically and obtain FD equations in a numerically convenient form. We also argue that the FD method is a particular realization of the general spectral filter goal and it is constrained, in general, by the time-energy uncertainty regime at least as much as the correlation-function-based method. To contrast the performance of the correlation function and the FD methods, we have carried out the detailed numerical experiments on a model system, which suggest that the FD method needs almost as much time propagation as the correlation function method, in order to identify the correct spectrum. The difference lies in the procedure for the exact location of eigenvalue positions, for which the FD method employs a diagonalization step while the correlation function method involves the location of zeros.

Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Sep 1, 2000•14 citations

Quantum Filter Diagonalization: Quantum Eigendecomposition without Full Quantum Phase Estimation

Robert M. Parrish, Peter L. McMahon

We develop a quantum filter diagonalization method (QFD) that lies somewhere between the variational quantum eigensolver (VQE) and the phase estimation algorithm (PEA) in terms of required quantum circuit resources and conceptual simplicity. QFD uses a set of of time-propagated guess states as a variational basis for approximate diagonalization of a sparse Pauli Hamiltonian. The variational coefficients of the basis functions are determined by the Rayleigh-Ritz procedure by classically solving a generalized eigenvalue problem in the space of time-propagated guess states. The matrix elements of the subspace Hamiltonian and subspace metric matrix are each determined in quantum circuits by a one-ancilla extended swap test, i.e., statistical convergence of a one-ancilla PEA circuit. These matrix elements can be determined by many parallel quantum circuit evaluations, and the final Ritz estimates for the eigenvectors can conceptually be prepared as a linear combination over separate quantum state preparation circuits. The QFD method naturally provides for the computation of ground-state, excited-state, and transition expectation values. We numerically demonstrate the potential of the method by classical simulations of the QFD algorithm for an N=8 octamer of BChl-a chromophores represented by an 8-qubit ab initio exciton model (AIEM) Hamiltonian. Using only a handful of time-displacement points and a coarse, variational Trotter expansion of the time propagation operators, the QFD method recovers an accurate prediction of the absorption spectrum.

arXiv:1909.08925•Sep 19, 2019•63 citations

Quantum eigenvalue estimation via time series analysis

Rolando D. Somma

Abstract We present an efficient method for estimating the eigenvalues of a Hamiltonian H from the expectation values of the evolution operator for various times. For a given quantum state ρ , our method outputs a list of eigenvalue estimates and approximate probabilities. Each probability depends on the support of ρ in those eigenstates of H associated with eigenvalues within an arbitrarily small range. The complexity of our method is polynomial in the inverse of a given precision parameter ϵ , which is the gap between eigenvalue estimates. Unlike the well-known quantum phase estimation algorithm that uses the quantum Fourier transform, our method does not require large ancillary systems, large sequences of controlled operations, or preserving coherence between experiments, and is therefore more attractive for near-term applications. The output of our method can be used to estimate spectral properties of H and other expectation values efficiently, within additive error proportional to ϵ .

arXiv:1907.11748•New Journal of Physics•Nov 27, 2019•142 citations

Ground- and excited-state energies with analytic errors and short time evolution on a quantum computer

Timothy Stroschein, Davide Castaldo, Markus Reiher

Accurately solving the Schrödinger equation remains a central challenge in computational physics, chemistry, and materials science. Here, we propose an alternative eigenvalue problem based on a system's autocorrelation function, avoiding direct reference to a wave function. In particular, we develop a rigorous approximation framework that enables precise frequency estimation from a finite number of signal samples. Our analysis builds on results involving prolate spheroidal wave functions and yields error bounds that reveal a sharp accuracy transition governed by the observation time and spectral density of the signal. These results are very general and thus carry far. As one important example application, we consider the quantum computation for molecular systems. By combining our spectral method with a quantum subroutine for signal generation, we define quantum prolate diagonalization (QPD)—a hybrid classical-quantum algorithm. QPD simultaneously estimates ground- and excited-state energies within chemical accuracy at the Heisenberg limit. An analysis of different input states demonstrates the robustness of the method, showing that high precision can be retained even under imperfect state preparation.

arXiv:2507.15148•Physical Review Research•Jul 16, 2026•1 citation

Computing Energy Levels by Inversion of Imaginary-Time Cross-Correlation Functions

Arne Lüchow, Daniel Neuhauser, Jaejin Ka +3 more

As proposed by Ceperley and Bernu, the excited-state energies can be obtained from imaginary-time cross-correlation functions (rather than autocorrelation functions) generated by quantum Monte Carlo (QMC) simulations. We show that, when processed by the filter diagonalization method (FDM), the same cross-correlation functions yield excited-state energies of higher accuracy and greater stability. The reason is that unlike the other methods FDM uses all the time domain information available. The superior performance of the cross-correlation FDM is demonstrated for a two-dimensional harmonic oscillator with closely lying eigenvalues. Because QMC does not take advantage of the separability in the Hamiltonian, this model system provides a challenging and generic test case.

The Journal of Physical Chemistry A•Jun 4, 2003•1 citation
In a previous paper we developed a method, Filter-Diagonalization, for extracting eigenvalues and eigenstates of a given operator at any desired energy range. In essence, the method eliminates correlation between distant eigenstates through a short-time filter while correlations between closely lying states are eliminated by diagonalization. Here we extend Filter-Diagonalization. When used to extract eigenvalues for a given operator H, we show that all eigenvalue information is directly extracted from a short segment of the correlation function C(t)=(ψ(0)‖e−iHt‖ψ(0)), or alternately from a small number of residues (ψ(0)‖Rn(H)‖ψ(0)), where ψ(0) is a random initial function and Rn(H) is any desired polynomial expansion in H. The implications of this feature are twofold. First, in contrast to the previous version the wave packet needs only to be propagated once (to prepare C(t)), and eigenstates at all desired energy windows can then be extracted with negligible extra computation time (and negligible storage requirements). In a simulation presented here, accurate eigenvalues are extracted using propagation times which are only a 0.0041 fraction of the ‘‘natural’’ time, i.e., the time by which the relative phase of the two closest eigenstates reaches 2π. The second and more important feature is that the method is automatically suitable for extracting eigenvalues (or normal modes) using a short-time segment of any signal C(t) which is a sum of (unknown) Fourier components (C(t)=∑ndne−iεnt) regardless of its origin. In addition to its use for determining eigenvalues of known operators, the method may also be utilized to extract normal modes from classical-dynamics simulations, eigenstates from real-time Quantum Monte-Carlo studies, frequencies from experimental optical or electrical signals, or be utilized in any other circumstance where a correlation function or general signal is only known for short times (or expensive to generate at long times).
Quantum computers can generate real-time correlators of field theories. By adapting the generalized eigenvalue problem to these correlators, energy eigenvalues can be extracted directly. The method is tested using both classical simulations and quantum hardware, successfully resolving several low-lying energy levels in agreement with exact diagonalization. Comparison with an alternative spectrum determination based on the Fourier transform of correlators shows that the proposed approach is substantially more efficient.
We present the time-domain theory of spectral filters, starting with the basic propositions of the theory of measurement in quantum mechanics, and develop its parameter-free implementation in the traditional correlation function as well as the filter diagonalization (FD) form. The present study unifies all the time-domain spectral filter algorithms in the literature, under a single theme which is based on the notion of selective measurements. For specific numerical purposes, we have selected Chebyshev polynomials for developing the time propagator and this permits us to carry out the relevent time integrals fully analytically and obtain FD equations in a numerically convenient form. We also argue that the FD method is a particular realization of the general spectral filter goal and it is constrained, in general, by the time-energy uncertainty regime at least as much as the correlation-function-based method. To contrast the performance of the correlation function and the FD methods, we have carried out the detailed numerical experiments on a model system, which suggest that the FD method needs almost as much time propagation as the correlation function method, in order to identify the correct spectrum. The difference lies in the procedure for the exact location of eigenvalue positions, for which the FD method employs a diagonalization step while the correlation function method involves the location of zeros.
We develop a quantum filter diagonalization method (QFD) that lies somewhere between the variational quantum eigensolver (VQE) and the phase estimation algorithm (PEA) in terms of required quantum circuit resources and conceptual simplicity. QFD uses a set of of time-propagated guess states as a variational basis for approximate diagonalization of a sparse Pauli Hamiltonian. The variational coefficients of the basis functions are determined by the Rayleigh-Ritz procedure by classically solving a generalized eigenvalue problem in the space of time-propagated guess states. The matrix elements of the subspace Hamiltonian and subspace metric matrix are each determined in quantum circuits by a one-ancilla extended swap test, i.e., statistical convergence of a one-ancilla PEA circuit. These matrix elements can be determined by many parallel quantum circuit evaluations, and the final Ritz estimates for the eigenvectors can conceptually be prepared as a linear combination over separate quantum state preparation circuits. The QFD method naturally provides for the computation of ground-state, excited-state, and transition expectation values. We numerically demonstrate the potential of the method by classical simulations of the QFD algorithm for an N=8 octamer of BChl-a chromophores represented by an 8-qubit ab initio exciton model (AIEM) Hamiltonian. Using only a handful of time-displacement points and a coarse, variational Trotter expansion of the time propagation operators, the QFD method recovers an accurate prediction of the absorption spectrum.
Abstract We present an efficient method for estimating the eigenvalues of a Hamiltonian H from the expectation values of the evolution operator for various times. For a given quantum state ρ , our method outputs a list of eigenvalue estimates and approximate probabilities. Each probability depends on the support of ρ in those eigenstates of H associated with eigenvalues within an arbitrarily small range. The complexity of our method is polynomial in the inverse of a given precision parameter ϵ , which is the gap between eigenvalue estimates. Unlike the well-known quantum phase estimation algorithm that uses the quantum Fourier transform, our method does not require large ancillary systems, large sequences of controlled operations, or preserving coherence between experiments, and is therefore more attractive for near-term applications. The output of our method can be used to estimate spectral properties of H and other expectation values efficiently, within additive error proportional to ϵ .
Accurately solving the Schrödinger equation remains a central challenge in computational physics, chemistry, and materials science. Here, we propose an alternative eigenvalue problem based on a system's autocorrelation function, avoiding direct reference to a wave function. In particular, we develop a rigorous approximation framework that enables precise frequency estimation from a finite number of signal samples. Our analysis builds on results involving prolate spheroidal wave functions and yields error bounds that reveal a sharp accuracy transition governed by the observation time and spectral density of the signal. These results are very general and thus carry far. As one important example application, we consider the quantum computation for molecular systems. By combining our spectral method with a quantum subroutine for signal generation, we define quantum prolate diagonalization (QPD)—a hybrid classical-quantum algorithm. QPD simultaneously estimates ground- and excited-state energies within chemical accuracy at the Heisenberg limit. An analysis of different input states demonstrates the robustness of the method, showing that high precision can be retained even under imperfect state preparation.
As proposed by Ceperley and Bernu, the excited-state energies can be obtained from imaginary-time cross-correlation functions (rather than autocorrelation functions) generated by quantum Monte Carlo (QMC) simulations. We show that, when processed by the filter diagonalization method (FDM), the same cross-correlation functions yield excited-state energies of higher accuracy and greater stability. The reason is that unlike the other methods FDM uses all the time domain information available. The superior performance of the cross-correlation FDM is demonstrated for a two-dimensional harmonic oscillator with closely lying eigenvalues. Because QMC does not take advantage of the separability in the Hamiltonian, this model system provides a challenging and generic test case.