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

Spectral Gap Governs Eigenvalue Resolvability in Quantum Phase Estimation: Spectral Features Versus a Physical Baseline

Samiksha BC, Mohammad I. Merhi, Eric Raymond, Tika Puri

Published Oct 6, 2026• 0 citations
Publisher

Abstract

Can simple spectral properties of a quantum gate, computed classically from its eigenvalues, predict how well quantum phase estimation (QPE) performs on that gate? We study three spectral features, a normalised Spectral Coherence Metric (SCM), the spectral gap, and a circular phase spread, using ideal Qiskit Aer simulations of 1,756 two-qubit gates (1,000 Haar-random unitaries plus three controlled spectral classes) for m = 3, 4, 5 ancilla qubits and three independent random seeds. All prediction targets are measured from simulated QPE circuits. When QPE is run on single eigenstates, the spectral features have no predictive power for the estimation error (cross-validated R2 ≤ 0), because that error is fixed by the position of each eigenphase on the 2m-point measurement grid. When the target register is prepared in an equal superposition of eigenvectors, the spectral features do predict eigenvalue resolvability, the fraction of eigenphases that appear as separate peaks: for Haar-random gates with m = 4, a random forest reaches R2 = 0.633 ± 0.020, and the spectral gap dominates the feature importance (0.88). However, a parameter-light physical baseline that counts gaps larger than a multiple of the grid spacing 2π/2m matches the learned models in accuracy and exceeds them in balanced accuracy (0.78 versus at most 0.63). We conclude that spectral structure, through the spectral gap, governs resolvability in superposition-input QPE in the way expected from the standard resolution limit, and that machine learning adds little beyond this physical rule.

DOI
10.20944/preprints202601.0796.v2

Related papers

Spectral Properties as Universal Predictors of Quantum Gate Performance: Discovery of Perfect Correlation in Quantum Phase Estimation

Samiksha BC, Mohammad I. Merhi, Eric Raymond +1 more

We show that quantum phase estimation (QPE) resolution is a linear rescaling of the spectral gap of a unitary operator, making the correlation between these two quantities athematically guaranteed. Using this observation, we demonstrate that spectral properties alone can reliably predict quantum algorithm performance without executing full circuit simulations. Through analysis of 400 randomly generated two-qubit unitaries and six standard quantum gates, we confirm that the spectral gap and QPEresolution exhibit a perfect Pearson correlation (r = 1.0000, p < 10−8), a relationship that persists across diverse gate families and extends to three-qubit systems. Building on this foundation, weintroduce four novel spectral metrics and develop a machine learning framework that predicts algorithmic performance with 99.48% accuracy while achieving thousand-fold speedups over traditional simulation. Statistical validation includes bootstrap confidence intervals and Bonferroni correction for multiple comparisons. These results establish spectral analysis as an efficient and generalizable approach to quantum gate characterization, with immediate applications in gate library optimization, quantum compiler design, and algorithm–hardware co-design for near-term quantum devices.

•Jan 12, 2026•0 citations

Circuit Depth Compression via Spectral Gap Amplification in Quantum Phase Estimation

Sk Mujaffar Hossain, Satadeep Bhattacharjee

We show that quantum phase estimation (QPE) circuits can be significantly compressed in depth by preprocessing the input operator with a sigmoid spectral filter before estimation. For systems with small spectral gaps Delta_lambda, standard QPE requires m = ceil(log2(1/Delta_lambda)) precision qubits and depth Theta(2^m). Applying a soft-step transformation f(lambda; tau,w) amplifies the effective gap to Delta_f > Delta_lambda (for w < 1/4), reducing the required precision to m_f = ceil(log2(1/Delta_f)) and compressing circuit depth by 2^(alpha Delta_m), where alpha = 1 for the LMR density-matrix exponentiation framework and alpha is in [0.11,0.42] for controlled-phase-gate circuits. We prove that this compression is exact, bounded above by log2(1/(4w Delta_lambda)) + 1, and impossible for exactly degenerate spectra. We further show that the threshold parameter tau requires only O(w) accuracy, so classical preprocessing such as covariance diagonalisation or CASSCF avoids circularity. A net resource advantage occurs when 4w^2(2^Delta_m - 1) > Delta_lambda log(1/epsilon). Validation on LiH and BeH2 bond-stretch calculations, classical covariance datasets, and synthetic near-degenerate cases demonstrates depth reductions of up to 27x and CX-gate reductions of up to 21x. For LiH, QPE output fidelity improves from 0.66 to 0.98 at a 1% hardware error rate. The method preserves the principal subspace to machine precision, requires no modification of QPE, and can be combined with readout-stage and state-preparation filtering. Negative-control tests establish the benefit condition: m_raw >= 2 and Delta_lambda > 0.

quant-pharXiv:2608.14002•Aug 17, 2026•0 citations

Standard Quantum Phase Estimation Detects All Eigenvalues via Randomized Initial States

Yuki Izumi, Hitoshi Kawahara

Standard quantum phase estimation (QPE) has often been regarded as unsuitable for simultaneous detection of all eigenvalues, because it requires initial states with sufficient overlap with the target eigenstates. In this paper, we show that this limitation is not inherent to the QPE circuit itself. The output distribution of standard QPE can be written as a superposition of Fejér kernels weighted by the squared overlaps with the eigenmodes. We prove that, if the initial state is independently drawn at each shot from a 1-design (in particular, by random selection of computational basis states), these mode weights are equalized in expectation, yielding a state-averaged QPE distribution that exhibits peaks at every eigenphase location. In this sense, all eigenvalues become accessible without any modification of the standard QPE circuit; repeated eigenvalues appear through the aggregated weight of their eigenspaces. For distinct eigenphases satisfying a separation condition, we further establish a rigorous peak-detection theory and derive a sufficient shot-count estimate for detecting all peaks. We validate the theory through numerical experiments on a finite element method (FEM) matrix with 1,008 degrees of freedom arising from computer-aided engineering (CAE).

quant-pharXiv:2604.00475•Apr 2, 2026•0 citations

Improving 2–5 Qubit Quantum Phase Estimation Circuits Using Machine Learning

Charles Woodrum, Torrey J. Wagner, David E. Weeks

Quantum computing has the potential to solve problems that are currently intractable to classical computers with algorithms like Quantum Phase Estimation (QPE); however, noise significantly hinders the performance of today’s quantum computers. Machine learning has the potential to improve the performance of QPE algorithms, especially in the presence of noise. In this work, QPE circuits were simulated with varying levels of depolarizing noise to generate datasets of QPE output. In each case, the phase being estimated was generated with a phase gate, and each circuit modeled was defined by a randomly selected phase. The model accuracy, prediction speed, overfitting level and variation in accuracy with noise level was determined for 5 machine learning algorithms. These attributes were compared to the traditional method of post-processing and a 6x–36 improvement in model performance was noted, depending on the dataset. No algorithm was a clear winner when considering these 4 criteria, as the lowest-error model (neural network) was also the slowest predictor; the algorithm with the lowest overfitting and fastest prediction time (linear regression) had the highest error level and a high degree of variation of error with noise. The XGBoost ensemble algorithm was judged to be the best tradeoff between these criteria due to its error level, prediction time and low variation of error with noise. For the first time, a machine learning model was validated using a 2-qubit datapoint obtained from an IBMQ quantum computer. The best 2-qubit model predicted within 2% of the actual phase, while the traditional method possessed a 25% error.

Algorithms•May 15, 2024•2 citations

Adiabatic Quantum Phase Estimation

Alexander Schmidhuber, Seth Lloyd

Quantum phase estimation (QPE) is a central algorithmic primitive that estimates eigenvalues of a Hamiltonian up to precision $ε$ in Heisenberg-limited time $T=Θ(1/ε)$. Standard gate-based implementations of QPE require deep controlled time-evolution circuits and are not native to analog hardware. Here, we present a simple adiabatic protocol for QPE that achieves (up to logarithmic factors) the optimal Heisenberg-limited scaling $T = O\left( \frac{1}ε \log\left(δ^{-1}\right)\right)$ in both the precision $ε$ and failure probability $δ$. By encoding eigenvalues in populations of computational basis states rather than complex phases, our approach is naturally robust against certain dephasing errors. The adiabatic protocol only requires the ability to couple a single ancilla qubit to the system Hamiltonian as well as pairwise couplings within the ancilla register.

quant-pharXiv:2605.22770•May 22, 2026•0 citations

Resolvent-based quantum phase estimation: Towards estimation of parametrized eigenvalues

Abhijeet Alase, Salini Karuvade

Quantum algorithms for estimating the eigenvalues of matrices, including the phase estimation algorithm, serve as core subroutines in a wide range of quantum algorithms, including those in quantum chemistry and quantum machine learning. The standard quantum eigenvalue (phase) estimation algorithm accepts a Hermitian (unitary) matrix and a state in an unknown superposition of its eigenstates as input, and coherently records the estimates for real eigenvalues (eigenphases) in an ancillary register. Extension of quantum eigenvalue and phase estimation algorithms to the case of non-normal input matrices is obstructed by several factors such as non-orthogonality of eigenvectors, existence of generalized eigenvectors and the fact that eigenvalues may lie anywhere on the complex plane. In this work, we propose a novel approach for estimating the eigenvalues of non-normal matrices based on preparation of a state that we call the "resolvent state". We construct the first efficient algorithm for estimating the phases of the unimodular eigenvalues of a given non-unitary matrix. We then construct an efficient algorithm for estimating the real eigenvalues of a given non-Hermitian matrix, achieving complexities that match the best known results while operating under significantly relaxed assumptions on the non-real part of the spectrum. The resolvent-based approach that we introduce also extends to estimating eigenvalues that lie on a parametrized complex curve, subject to explicitly stated conditions, thereby paving the way for a new paradigm of parametric eigenvalue estimation.

arXiv:2410.04837•Oct 7, 2024•7 citations
Can simple spectral properties of a quantum gate, computed classically from its eigenvalues, predict how well quantum phase estimation (QPE) performs on that gate? We study three spectral features, a normalised Spectral Coherence Metric (SCM), the spectral gap, and a circular phase spread, using ideal Qiskit Aer simulations of 1,756 two-qubit gates (1,000 Haar-random unitaries plus three controlled spectral classes) for m = 3, 4, 5 ancilla qubits and three independent random seeds. All prediction targets are measured from simulated QPE circuits. When QPE is run on single eigenstates, the spectral features have no predictive power for the estimation error (cross-validated R2 ≤ 0), because that error is fixed by the position of each eigenphase on the 2m-point measurement grid. When the target register is prepared in an equal superposition of eigenvectors, the spectral features do predict eigenvalue resolvability, the fraction of eigenphases that appear as separate peaks: for Haar-random gates with m = 4, a random forest reaches R2 = 0.633 ± 0.020, and the spectral gap dominates the feature importance (0.88). However, a parameter-light physical baseline that counts gaps larger than a multiple of the grid spacing 2π/2m matches the learned models in accuracy and exceeds them in balanced accuracy (0.78 versus at most 0.63). We conclude that spectral structure, through the spectral gap, governs resolvability in superposition-input QPE in the way expected from the standard resolution limit, and that machine learning adds little beyond this physical rule.
We show that quantum phase estimation (QPE) resolution is a linear rescaling of the spectral gap of a unitary operator, making the correlation between these two quantities athematically guaranteed. Using this observation, we demonstrate that spectral properties alone can reliably predict quantum algorithm performance without executing full circuit simulations. Through analysis of 400 randomly generated two-qubit unitaries and six standard quantum gates, we confirm that the spectral gap and QPEresolution exhibit a perfect Pearson correlation (r = 1.0000, p < 10−8), a relationship that persists across diverse gate families and extends to three-qubit systems. Building on this foundation, weintroduce four novel spectral metrics and develop a machine learning framework that predicts algorithmic performance with 99.48% accuracy while achieving thousand-fold speedups over traditional simulation. Statistical validation includes bootstrap confidence intervals and Bonferroni correction for multiple comparisons. These results establish spectral analysis as an efficient and generalizable approach to quantum gate characterization, with immediate applications in gate library optimization, quantum compiler design, and algorithm–hardware co-design for near-term quantum devices.
We show that quantum phase estimation (QPE) circuits can be significantly compressed in depth by preprocessing the input operator with a sigmoid spectral filter before estimation. For systems with small spectral gaps Delta_lambda, standard QPE requires m = ceil(log2(1/Delta_lambda)) precision qubits and depth Theta(2^m). Applying a soft-step transformation f(lambda; tau,w) amplifies the effective gap to Delta_f > Delta_lambda (for w < 1/4), reducing the required precision to m_f = ceil(log2(1/Delta_f)) and compressing circuit depth by 2^(alpha Delta_m), where alpha = 1 for the LMR density-matrix exponentiation framework and alpha is in [0.11,0.42] for controlled-phase-gate circuits. We prove that this compression is exact, bounded above by log2(1/(4w Delta_lambda)) + 1, and impossible for exactly degenerate spectra. We further show that the threshold parameter tau requires only O(w) accuracy, so classical preprocessing such as covariance diagonalisation or CASSCF avoids circularity. A net resource advantage occurs when 4w^2(2^Delta_m - 1) > Delta_lambda log(1/epsilon). Validation on LiH and BeH2 bond-stretch calculations, classical covariance datasets, and synthetic near-degenerate cases demonstrates depth reductions of up to 27x and CX-gate reductions of up to 21x. For LiH, QPE output fidelity improves from 0.66 to 0.98 at a 1% hardware error rate. The method preserves the principal subspace to machine precision, requires no modification of QPE, and can be combined with readout-stage and state-preparation filtering. Negative-control tests establish the benefit condition: m_raw >= 2 and Delta_lambda > 0.
Standard quantum phase estimation (QPE) has often been regarded as unsuitable for simultaneous detection of all eigenvalues, because it requires initial states with sufficient overlap with the target eigenstates. In this paper, we show that this limitation is not inherent to the QPE circuit itself. The output distribution of standard QPE can be written as a superposition of Fejér kernels weighted by the squared overlaps with the eigenmodes. We prove that, if the initial state is independently drawn at each shot from a 1-design (in particular, by random selection of computational basis states), these mode weights are equalized in expectation, yielding a state-averaged QPE distribution that exhibits peaks at every eigenphase location. In this sense, all eigenvalues become accessible without any modification of the standard QPE circuit; repeated eigenvalues appear through the aggregated weight of their eigenspaces. For distinct eigenphases satisfying a separation condition, we further establish a rigorous peak-detection theory and derive a sufficient shot-count estimate for detecting all peaks. We validate the theory through numerical experiments on a finite element method (FEM) matrix with 1,008 degrees of freedom arising from computer-aided engineering (CAE).
Quantum computing has the potential to solve problems that are currently intractable to classical computers with algorithms like Quantum Phase Estimation (QPE); however, noise significantly hinders the performance of today’s quantum computers. Machine learning has the potential to improve the performance of QPE algorithms, especially in the presence of noise. In this work, QPE circuits were simulated with varying levels of depolarizing noise to generate datasets of QPE output. In each case, the phase being estimated was generated with a phase gate, and each circuit modeled was defined by a randomly selected phase. The model accuracy, prediction speed, overfitting level and variation in accuracy with noise level was determined for 5 machine learning algorithms. These attributes were compared to the traditional method of post-processing and a 6x–36 improvement in model performance was noted, depending on the dataset. No algorithm was a clear winner when considering these 4 criteria, as the lowest-error model (neural network) was also the slowest predictor; the algorithm with the lowest overfitting and fastest prediction time (linear regression) had the highest error level and a high degree of variation of error with noise. The XGBoost ensemble algorithm was judged to be the best tradeoff between these criteria due to its error level, prediction time and low variation of error with noise. For the first time, a machine learning model was validated using a 2-qubit datapoint obtained from an IBMQ quantum computer. The best 2-qubit model predicted within 2% of the actual phase, while the traditional method possessed a 25% error.
Quantum phase estimation (QPE) is a central algorithmic primitive that estimates eigenvalues of a Hamiltonian up to precision εεε in Heisenberg-limited time T=Θ(1/ε)T=Θ(1/ε)T=Θ(1/ε). Standard gate-based implementations of QPE require deep controlled time-evolution circuits and are not native to analog hardware. Here, we present a simple adiabatic protocol for QPE that achieves (up to logarithmic factors) the optimal Heisenberg-limited scaling T=O(1εlog⁡(δ−1))T = O\left( \frac{1}ε \log\left(δ^{-1}\right)\right)T=O(ε1​log(δ−1)) in both the precision εεε and failure probability δδδ. By encoding eigenvalues in populations of computational basis states rather than complex phases, our approach is naturally robust against certain dephasing errors. The adiabatic protocol only requires the ability to couple a single ancilla qubit to the system Hamiltonian as well as pairwise couplings within the ancilla register.
Quantum algorithms for estimating the eigenvalues of matrices, including the phase estimation algorithm, serve as core subroutines in a wide range of quantum algorithms, including those in quantum chemistry and quantum machine learning. The standard quantum eigenvalue (phase) estimation algorithm accepts a Hermitian (unitary) matrix and a state in an unknown superposition of its eigenstates as input, and coherently records the estimates for real eigenvalues (eigenphases) in an ancillary register. Extension of quantum eigenvalue and phase estimation algorithms to the case of non-normal input matrices is obstructed by several factors such as non-orthogonality of eigenvectors, existence of generalized eigenvectors and the fact that eigenvalues may lie anywhere on the complex plane. In this work, we propose a novel approach for estimating the eigenvalues of non-normal matrices based on preparation of a state that we call the "resolvent state". We construct the first efficient algorithm for estimating the phases of the unimodular eigenvalues of a given non-unitary matrix. We then construct an efficient algorithm for estimating the real eigenvalues of a given non-Hermitian matrix, achieving complexities that match the best known results while operating under significantly relaxed assumptions on the non-real part of the spectrum. The resolvent-based approach that we introduce also extends to estimating eigenvalues that lie on a parametrized complex curve, subject to explicitly stated conditions, thereby paving the way for a new paradigm of parametric eigenvalue estimation.