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

arXiv:2510.07439 · PRX Quantum

Quantum Filtering and Analysis of Multiplicities in Eigenvalue Spectra

Zhiyan Ding, Lin Lin, Yilun Yang, Ruizhe Zhang

Published Mar 17, 2026• 3 citations
arXivHTMLPDF

Abstract

Fine-grained spectral properties of quantum Hamiltonians, including both eigenvalues and their multiplicities, provide useful information for characterizing many-body quantum systems as well as for understanding phenomena such as topological order. Extracting such information with small additive error is #-complete in the worst case. In this work, we introduce QFAMES (quantum filtering and analysis of multiplicities in eigenvalue spectra), a quantum algorithm that efficiently identifies clusters of closely spaced dominant eigenvalues and determines their multiplicities under physically motivated assumptions, which allows us to bypass worst-case complexity barriers. QFAMES also enables the estimation of observable expectation values within targeted energy clusters, providing a powerful tool for studying quantum phase transitions and other physical properties. We validate the effectiveness of QFAMES through numerical demonstrations, including its applications to characterizing quantum phases in the transverse-field Ising model and estimating the ground-state degeneracy of a topologically ordered phase in the two-dimensional toric code model. We also generalize QFAMES to the setting of mixed initial states. Our approach offers rigorous theoretical guarantees and significant advantages over existing subspace-based quantum spectral analysis methods, particularly in terms of the sample complexity and the ability to resolve degeneracies.

DOI
10.1103/jch7-734h

Related papers

Quantum Spectral Estimation with Multiple Initial States: Improved Error and Cost Scaling

Lingwei Zhang, Zhiyan Ding

We study quantum spectrum and eigenstate property estimation using multiple initial states and generalized Hadamard tests. Building on the QFAMES (quantum filtering and analysis of multiplicities in eigenvalue spectra) framework, we introduce a new method that samples evolution times independently for each initial-state pair. Under the stated assumptions, when statistical error determines the sampling cost, the total Hamiltonian simulation cost required for fixed-accuracy eigenvalue and observable estimation is independent of the number of initial states, up to logarithmic factors. This improves scalability when many initial states are needed to explore the target eigenspaces. The method also reduces the cost of multiplicity recovery and retains Heisenberg-limited scaling for eigenvalue estimation. Numerical experiments support the predicted statistical error scalings.

quant-pharXiv:2610.20482•Oct 15, 2026•0 citations

Quantum Multiple Eigenvalue Gaussian filtered Search: an efficient and versatile quantum phase estimation method

Zhiyan Ding, Haoya Li, Lin Lin +3 more

Quantum phase estimation is one of the most powerful quantum primitives. This work proposes a new approach for the problem of multiple eigenvalue estimation: Quantum Multiple Eigenvalue Gaussian filtered Search (QMEGS). QMEGS leverages the Hadamard test circuit structure and only requires simple classical postprocessing. QMEGS is the first algorithm to simultaneously satisfy the following two properties: (1) It can achieve the Heisenberg-limited scaling without relying on any spectral gap assumption. (2) With a positive energy gap and additional assumptions on the initial state, QMEGS can estimate all dominant eigenvalues to ϵ accuracy utilizing a significantly reduced circuit depth compared to the standard quantum phase estimation algorithm. In the most favorable scenario, the maximal runtime can be reduced to as low as log ⁡ ( 1 / ϵ ) . This implies that QMEGS serves as an efficient and versatile approach, achieving the best-known results for both gapped and gapless systems. Numerical results validate the efficiency of our proposed algorithm in various regimes.

arXiv:2402.01013•Quantum•Oct 2, 2024•37 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•150 citations

Quantum Randomized Subspace Iteration

Stefano Scali, Brian Coyle, Giuseppe Buonaiuto +1 more

Resolving degenerate quantum eigenspaces - including topologically ordered ground states and frustrated magnets - requires preparing high-fidelity states that span every direction of the target manifold. Existing variational and projective algorithms do not naturally cover a multi-dimensional degenerate subspace without sequential orthogonality constraints. We introduce the quantum randomized subspace iteration (QRSI), a fully parallel construction that conjugates the Hamiltonian by independent random unitaries across as many branches as the degeneracy g, then invokes any chosen eigenstate-preparation primitive on each branch. The target subspace is identified from the resulting ensemble via standard subspace estimation, either classically through the coefficient matrix or on hardware through Gram-matrix measurements. We prove that the construction spans the full eigenspace almost surely and preserves the spectral gap exactly on every branch. For practical use, we show that these guarantees hold whenever the random rotations satisfy an anti-concentration condition over the degenerate manifold, substantially weaker than full Haar randomness. We demonstrate QRSI on the toric code, recovering all four topological ground states, and on random Hamiltonians with planted degeneracies.

quant-pharXiv:2604.09483•Apr 13, 2026•0 citations

Spectral analysis of three-state quantum walks with general coin matrices

Chusei Kiumi, Jirô Akahori, Takuya Watanabe +1 more

Mathematical analysis of the spectral properties of the time-evolution operator in quantum walks is essential for understanding key dynamical behaviors such as localization and long-term evolution. The inhomogeneous three-state case, in particular, poses substantial analytical challenges due to its higher internal degrees of freedom and the absence of translational invariance. We develop a general framework for the spectral analysis of three-state quantum walks on the one-dimensional lattice with arbitrary time-evolution operators. Our approach is based on a transfer-matrix formulation that reduces the infinite-dimensional eigenvalue problem to a tractable system of two-dimensional recursions, enabling exact characterization of eigenstates. This framework applies broadly to space-inhomogeneous models, including those with finite defects and two-phase structures. We rigorously derive necessary and sufficient conditions for the existence of point spectrum, along with a complete description of the corresponding eigenvalues and eigenstates, which are known to underlie quantum localization phenomena. Furthermore, we give a complete spectral decomposition—discrete spectrum, flat-band eigenvalues (of infinite multiplicity), and absolutely continuous spectrum—with explicit characterization of each component. Using this method, we perform exact numerical analyses of the Fourier walk with spatial inhomogeneity, revealing the emergence of localization despite its delocalized nature in the homogeneous case. Our results provide mathematical tools and physical insights into the structure of quantum walks, offering a systematic path for identifying and characterizing localized quantum states in complex quantum systems.

arXiv:2311.06468•Physical Review Research•Apr 2, 2026•1 citation

Filter-assisted quantum subspace diagonalization via wavefunction sparsity engineering

Han Xu, Tomonori Shirakawa, Seiji Yunoki

Subspace diagonalization techniques based on quantum sampling, such as quantum selected configuration interaction (QSCI) and sample-based quantum diagonalization (SQD), have recently emerged as promising quantum-centric approaches for approximating ground-state energies of many-body systems. However, their performance is fundamentally limited by an intrinsic trade-off between sampling efficiency and the sparsity of the ground-state wavefunction, which becomes particularly severe in strongly correlated systems. Here, we introduce a filter-assisted SQD protocol that engineers wavefunction sparsity via a quantum filter, i.e., a unitary transformation of the Hamiltonian designed to concentrate the ground-state weight onto a small number of computational basis states. Using the Gini coefficient as a robust sparsity measure, we establish a quantitative relationship between wavefunction sparsity and the resource requirements of SQD, providing theoretical bounds on the required subspace dimension and sampling cost. To realize the quantum filter, we employ a tensor-network-based circuit-encoding algorithm that maps target states to quantum circuits with controllable fidelity. We benchmark our approach on the quantum Ising model with transverse and longitudinal fields using both numerical simulations and quantum hardware experiments. Our results demonstrate that, compared with standard SQD, the proposed protocol significantly enhances wavefunction sparsity, reduces ground-state energy estimation errors by orders of magnitude, and substantially lowers sampling overhead. These findings establish filter-assisted subspace diagonalization as a powerful and scalable framework for quantum many-body calculations in the strongly correlated regime.

quant-pharXiv:2605.28040•May 28, 2026•3 citations
Fine-grained spectral properties of quantum Hamiltonians, including both eigenvalues and their multiplicities, provide useful information for characterizing many-body quantum systems as well as for understanding phenomena such as topological order. Extracting such information with small additive error is #-complete in the worst case. In this work, we introduce QFAMES (quantum filtering and analysis of multiplicities in eigenvalue spectra), a quantum algorithm that efficiently identifies clusters of closely spaced dominant eigenvalues and determines their multiplicities under physically motivated assumptions, which allows us to bypass worst-case complexity barriers. QFAMES also enables the estimation of observable expectation values within targeted energy clusters, providing a powerful tool for studying quantum phase transitions and other physical properties. We validate the effectiveness of QFAMES through numerical demonstrations, including its applications to characterizing quantum phases in the transverse-field Ising model and estimating the ground-state degeneracy of a topologically ordered phase in the two-dimensional toric code model. We also generalize QFAMES to the setting of mixed initial states. Our approach offers rigorous theoretical guarantees and significant advantages over existing subspace-based quantum spectral analysis methods, particularly in terms of the sample complexity and the ability to resolve degeneracies.
We study quantum spectrum and eigenstate property estimation using multiple initial states and generalized Hadamard tests. Building on the QFAMES (quantum filtering and analysis of multiplicities in eigenvalue spectra) framework, we introduce a new method that samples evolution times independently for each initial-state pair. Under the stated assumptions, when statistical error determines the sampling cost, the total Hamiltonian simulation cost required for fixed-accuracy eigenvalue and observable estimation is independent of the number of initial states, up to logarithmic factors. This improves scalability when many initial states are needed to explore the target eigenspaces. The method also reduces the cost of multiplicity recovery and retains Heisenberg-limited scaling for eigenvalue estimation. Numerical experiments support the predicted statistical error scalings.
Quantum phase estimation is one of the most powerful quantum primitives. This work proposes a new approach for the problem of multiple eigenvalue estimation: Quantum Multiple Eigenvalue Gaussian filtered Search (QMEGS). QMEGS leverages the Hadamard test circuit structure and only requires simple classical postprocessing. QMEGS is the first algorithm to simultaneously satisfy the following two properties: (1) It can achieve the Heisenberg-limited scaling without relying on any spectral gap assumption. (2) With a positive energy gap and additional assumptions on the initial state, QMEGS can estimate all dominant eigenvalues to ϵ accuracy utilizing a significantly reduced circuit depth compared to the standard quantum phase estimation algorithm. In the most favorable scenario, the maximal runtime can be reduced to as low as log ⁡ ( 1 / ϵ ) . This implies that QMEGS serves as an efficient and versatile approach, achieving the best-known results for both gapped and gapless systems. Numerical results validate the efficiency of our proposed algorithm in various regimes.
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 ϵ .
Resolving degenerate quantum eigenspaces - including topologically ordered ground states and frustrated magnets - requires preparing high-fidelity states that span every direction of the target manifold. Existing variational and projective algorithms do not naturally cover a multi-dimensional degenerate subspace without sequential orthogonality constraints. We introduce the quantum randomized subspace iteration (QRSI), a fully parallel construction that conjugates the Hamiltonian by independent random unitaries across as many branches as the degeneracy g, then invokes any chosen eigenstate-preparation primitive on each branch. The target subspace is identified from the resulting ensemble via standard subspace estimation, either classically through the coefficient matrix or on hardware through Gram-matrix measurements. We prove that the construction spans the full eigenspace almost surely and preserves the spectral gap exactly on every branch. For practical use, we show that these guarantees hold whenever the random rotations satisfy an anti-concentration condition over the degenerate manifold, substantially weaker than full Haar randomness. We demonstrate QRSI on the toric code, recovering all four topological ground states, and on random Hamiltonians with planted degeneracies.
Mathematical analysis of the spectral properties of the time-evolution operator in quantum walks is essential for understanding key dynamical behaviors such as localization and long-term evolution. The inhomogeneous three-state case, in particular, poses substantial analytical challenges due to its higher internal degrees of freedom and the absence of translational invariance. We develop a general framework for the spectral analysis of three-state quantum walks on the one-dimensional lattice with arbitrary time-evolution operators. Our approach is based on a transfer-matrix formulation that reduces the infinite-dimensional eigenvalue problem to a tractable system of two-dimensional recursions, enabling exact characterization of eigenstates. This framework applies broadly to space-inhomogeneous models, including those with finite defects and two-phase structures. We rigorously derive necessary and sufficient conditions for the existence of point spectrum, along with a complete description of the corresponding eigenvalues and eigenstates, which are known to underlie quantum localization phenomena. Furthermore, we give a complete spectral decomposition—discrete spectrum, flat-band eigenvalues (of infinite multiplicity), and absolutely continuous spectrum—with explicit characterization of each component. Using this method, we perform exact numerical analyses of the Fourier walk with spatial inhomogeneity, revealing the emergence of localization despite its delocalized nature in the homogeneous case. Our results provide mathematical tools and physical insights into the structure of quantum walks, offering a systematic path for identifying and characterizing localized quantum states in complex quantum systems.
Subspace diagonalization techniques based on quantum sampling, such as quantum selected configuration interaction (QSCI) and sample-based quantum diagonalization (SQD), have recently emerged as promising quantum-centric approaches for approximating ground-state energies of many-body systems. However, their performance is fundamentally limited by an intrinsic trade-off between sampling efficiency and the sparsity of the ground-state wavefunction, which becomes particularly severe in strongly correlated systems. Here, we introduce a filter-assisted SQD protocol that engineers wavefunction sparsity via a quantum filter, i.e., a unitary transformation of the Hamiltonian designed to concentrate the ground-state weight onto a small number of computational basis states. Using the Gini coefficient as a robust sparsity measure, we establish a quantitative relationship between wavefunction sparsity and the resource requirements of SQD, providing theoretical bounds on the required subspace dimension and sampling cost. To realize the quantum filter, we employ a tensor-network-based circuit-encoding algorithm that maps target states to quantum circuits with controllable fidelity. We benchmark our approach on the quantum Ising model with transverse and longitudinal fields using both numerical simulations and quantum hardware experiments. Our results demonstrate that, compared with standard SQD, the proposed protocol significantly enhances wavefunction sparsity, reduces ground-state energy estimation errors by orders of magnitude, and substantially lowers sampling overhead. These findings establish filter-assisted subspace diagonalization as a powerful and scalable framework for quantum many-body calculations in the strongly correlated regime.