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:2608.14002

Circuit Depth Compression via Spectral Gap Amplification in Quantum Phase Estimation

Sk Mujaffar Hossain, Satadeep Bhattacharjee

quant-phcond-mat.mtrl-sciSubmitted Aug 14, 2026• Announced Aug 17, 2026• 0 citations
v1 · Aug 14, 2026v2 · Aug 24, 2026
arXivHTMLPDF

Abstract

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.

Related papers

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

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

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.

•Oct 6, 2026•0 citations

Accurate ground state energy estimation with noise and imperfect state preparation

Alicja Dutkiewicz, Thomas E. O'Brien, Stefano Polla

We introduce a classical estimator for the post-processing of quantum phase estimation (QPE) data when a single target phase is isolated within a known interval, as is typical of ground state energy estimation of gapped systems. Our estimator filters the QPE signal within this promise region and recovers the phase through a moment-projection routine, which is robust to both external spurious phases and experimental noise. In the noiseless case this achieves an exponential suppression of bias with respect to a naive mean estimator. In the presence of global depolarizing noise the bias is exponentially small in the circuit depth $t$, and the variance is $O(t^{-2}F^{-2})$ for circuit fidelity $F$. This improves by a factor of $t^2$ over a naive shifted-and-rescaled-mean approach. To mitigate realistic circuit-level noise, we combine our method with the explicit unbiasing scheme described in [Dutkiewicz et al., 2025]. This yields an overhead interpolating between the $F^{-4}$ scaling typical of explicitly unbiased error mitigation and a reduced $F^{-2}$ scaling when the noise samples fall outside the promise interval. We validate our estimators on a small-scale simulation of the Ising model, observing better-than-expected performance for a global depolarizing noise approximation. This robustness to both multiple eigenvalues and realistic noise makes limited-depth phase estimation practical for early fault tolerant quantum experiments.

quant-pharXiv:2603.21873•Mar 24, 2026•1 citation

Control Free Quantum Phase Estimation for Efficient Eigenphase and Energy Estimation without Quantum Fourier Transform

Yalla Jnan Devi Satya Prasad

Quantum phase estimation (QPE) is fundamental to quantum algorithms for eigenvalue problems, chemistry simulation, and number-theoretic applications. However, canonical QPE implementations employ controlled unitary operations and quantum Fourier transform, incurring substantial circuit depth and control overhead that severely limit applicability on nearterm quantum hardware. This work develops a novel class of control-free phase estimation algorithms that eliminate both controlled unitaries and QFT by leveraging signal processing principles. Our approach applies uncontrolled powers of the unitary U = e −iHτ to an eigenstate or eigenstate-rich state, measures in multiple bases to capture interference patterns, and reconstructs eigenphases via classical post-processing techniques including Prony's method, compressed sensing, and harmonic inversion. We establish that for eigenstates or states with sparse eigendecomposition, our algorithms achieve phase estimation precision ϵ using Õ(1/ϵ) applications of U , matching standard QPE query complexity up to logarithmic factors while dramatically reducing circuit depth and eliminating control overhead. We provide detailed error analysis characterizing robustness to measurement noise, finite sampling, and state preparation errors. Applications to electronic structure estimation in small molecules and variational quantum eigensolvers demonstrate the practical viability of control-free QPE on both NISQ and early fault-tolerant quantum computers. Our results suggest that signal-processing-based phase estimation may offer more efficient implementations of quantum algorithms on realistic hardware.

•Feb 5, 2026•0 citations

Tensor-based phase difference estimation on time series analysis

Shu Kanno, Kenji Sugisaki, Rei Sakuma +3 more

We propose a phase-difference estimation algorithm based on the tensor-network circuit compression, leveraging time-evolution data to pursue scalability and higher accuracy on a quantum phase estimation (QPE)-type algorithm. Using tensor networks, we construct circuits composed solely of nearest-neighbor gates and extract time-evolution data by four-type circuit measurements. In addition, to enhance the accuracy of time-evolution and state-preparation circuits, we propose techniques based on algorithmic error mitigation and on iterative circuit optimization combined with merging into matrix product states, respectively. Verifications using a noiseless simulator for the 8-qubit one-dimensional Hubbard model using an ancilla qubit show that the proposed algorithm achieves accuracies with 0.4--4.7\% error from a true energy gap on an appropriate time-step size, and that accuracy improvements due to the algorithmic error mitigation are observed. We also confirm the enhancement of the overlap with matrix product states through iterative optimization. Finally, the proposed algorithm is demonstrated on IBM Heron devices with Q-CTRL error suppression for 8-, 36-, and 52-qubit models using more than 4,000 2-qubit gates. These largest-scale demonstrations for the QPE-type algorithm represent significant progress not only toward practical applications of near-term quantum computing but also toward preparation for the era of error-corrected quantum devices.

quant-pharXiv:2601.15616•Physical Review A•Jan 23, 2026•1 citation

Phase-Fidelity-Aware Truncated Quantum Fourier Transform for Scalable Phase Estimation on NISQ Hardware

Akoramurthy B, Surendiran. B

Quantum phase estimation~(QPE) is central to numerous quantum algorithms, yet its standard implementation demands an $\calO(m^{2})$-gate quantum Fourier transform~(QFT) on $m$ control qubits-a prohibitive overhead on near-term noisy intermediate-scale quantum (NISQ) devices. We introduce the \emph{Phase-Fidelity-Aware Truncated QFT} (PFA-TQFT), a family of approximate QFT circuits parameterised by a truncation depth~$d$ that omits controlled-phase rotations below a hardware-calibrated fidelity threshold~$\eps$. Our central result establishes $\TV(P_{\varphi},P_{\varphi}^{d})\leqπ(m{-}d)/2^{d}$, showing that for $d=\calO(\log m)$ circuit size collapses from $\calO(m^{2})$ to $\calO(m\log m)$ while estimation error grows by at most $\calO(2^{-d})$. We characterise $\dstar=\Floor{\log_{2}(2π/\eps_{2q})}$ directly from native gate fidelities, demonstrating 31.3 -43.7\% at m = 30, gate-count reduction on IBM Eagle/Heron and IonQ~Aria with negligible accuracy loss. Numerical experiments on the transverse-field Ising model confirm all theoretical predictions and reveal a \emph{noise-truncation synergy}: PFA-TQFT outperforms full QFT under NISQ noise $\eps_{2q}\gtrsim 2\times10^{-3}$.

quant-pharXiv:2604.05456•Apr 8, 2026•0 citations

Optimal low-depth quantum signal-processing phase estimation

Yulong Dong, Jonathan A. Gross, Murphy Yuezhen Niu

Abstract Quantum effects like entanglement and coherent amplification can be used to drastically enhance the accuracy of quantum parameter estimation beyond classical limits. However, challenges such as decoherence and time-dependent errors hinder Heisenberg-limited amplification. We introduce Quantum Signal-Processing Phase Estimation algorithms that are robust against these challenges and achieve optimal performance as dictated by the Cramér-Rao bound. These algorithms use quantum signal transformation to decouple interdependent phase parameters into largely orthogonal ones, ensuring that time-dependent errors in one do not compromise the accuracy of learning the other. Combining provably optimal classical estimation with near-optimal quantum circuit design, our approach achieves a standard deviation accuracy of 10−4 radians for estimating unwanted swap angles in superconducting two-qubit experiments, using low-depth ( < 10) circuits. This represents up to two orders of magnitude improvement over existing methods. Theoretically and numerically, we demonstrate the optimality of our algorithm against time-dependent phase errors, observing that the variance of the time-sensitive parameter φ scales faster than the asymptotic Heisenberg scaling in the small-depth regime. Our results are rigorously validated against the quantum Fisher information, confirming our protocol’s ability to achieve unmatched precision for two-qubit gate learning.

arXiv:2209.11207•Nature Communications•Feb 10, 2025•23 citations
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.
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 introduce a classical estimator for the post-processing of quantum phase estimation (QPE) data when a single target phase is isolated within a known interval, as is typical of ground state energy estimation of gapped systems. Our estimator filters the QPE signal within this promise region and recovers the phase through a moment-projection routine, which is robust to both external spurious phases and experimental noise. In the noiseless case this achieves an exponential suppression of bias with respect to a naive mean estimator. In the presence of global depolarizing noise the bias is exponentially small in the circuit depth ttt, and the variance is O(t−2F−2)O(t^{-2}F^{-2})O(t−2F−2) for circuit fidelity FFF. This improves by a factor of t2t^2t2 over a naive shifted-and-rescaled-mean approach. To mitigate realistic circuit-level noise, we combine our method with the explicit unbiasing scheme described in [Dutkiewicz et al., 2025]. This yields an overhead interpolating between the F−4F^{-4}F−4 scaling typical of explicitly unbiased error mitigation and a reduced F−2F^{-2}F−2 scaling when the noise samples fall outside the promise interval. We validate our estimators on a small-scale simulation of the Ising model, observing better-than-expected performance for a global depolarizing noise approximation. This robustness to both multiple eigenvalues and realistic noise makes limited-depth phase estimation practical for early fault tolerant quantum experiments.
Quantum phase estimation (QPE) is fundamental to quantum algorithms for eigenvalue problems, chemistry simulation, and number-theoretic applications. However, canonical QPE implementations employ controlled unitary operations and quantum Fourier transform, incurring substantial circuit depth and control overhead that severely limit applicability on nearterm quantum hardware. This work develops a novel class of control-free phase estimation algorithms that eliminate both controlled unitaries and QFT by leveraging signal processing principles. Our approach applies uncontrolled powers of the unitary U = e −iHτ to an eigenstate or eigenstate-rich state, measures in multiple bases to capture interference patterns, and reconstructs eigenphases via classical post-processing techniques including Prony's method, compressed sensing, and harmonic inversion. We establish that for eigenstates or states with sparse eigendecomposition, our algorithms achieve phase estimation precision ϵ using Õ(1/ϵ) applications of U , matching standard QPE query complexity up to logarithmic factors while dramatically reducing circuit depth and eliminating control overhead. We provide detailed error analysis characterizing robustness to measurement noise, finite sampling, and state preparation errors. Applications to electronic structure estimation in small molecules and variational quantum eigensolvers demonstrate the practical viability of control-free QPE on both NISQ and early fault-tolerant quantum computers. Our results suggest that signal-processing-based phase estimation may offer more efficient implementations of quantum algorithms on realistic hardware.
We propose a phase-difference estimation algorithm based on the tensor-network circuit compression, leveraging time-evolution data to pursue scalability and higher accuracy on a quantum phase estimation (QPE)-type algorithm. Using tensor networks, we construct circuits composed solely of nearest-neighbor gates and extract time-evolution data by four-type circuit measurements. In addition, to enhance the accuracy of time-evolution and state-preparation circuits, we propose techniques based on algorithmic error mitigation and on iterative circuit optimization combined with merging into matrix product states, respectively. Verifications using a noiseless simulator for the 8-qubit one-dimensional Hubbard model using an ancilla qubit show that the proposed algorithm achieves accuracies with 0.4--4.7\% error from a true energy gap on an appropriate time-step size, and that accuracy improvements due to the algorithmic error mitigation are observed. We also confirm the enhancement of the overlap with matrix product states through iterative optimization. Finally, the proposed algorithm is demonstrated on IBM Heron devices with Q-CTRL error suppression for 8-, 36-, and 52-qubit models using more than 4,000 2-qubit gates. These largest-scale demonstrations for the QPE-type algorithm represent significant progress not only toward practical applications of near-term quantum computing but also toward preparation for the era of error-corrected quantum devices.
Quantum phase estimation~(QPE) is central to numerous quantum algorithms, yet its standard implementation demands an $\calO(m^{2})$-gate quantum Fourier transform~(QFT) on mmm control qubits-a prohibitive overhead on near-term noisy intermediate-scale quantum (NISQ) devices. We introduce the \emph{Phase-Fidelity-Aware Truncated QFT} (PFA-TQFT), a family of approximate QFT circuits parameterised by a truncation depth~ddd that omits controlled-phase rotations below a hardware-calibrated fidelity threshold~$\eps$. Our central result establishes $\TV(P_{\varphi},P_{\varphi}^{d})\leqπ(m{-}d)/2^{d}$, showing that for $d=\calO(\log m)$ circuit size collapses from $\calO(m^{2})$ to $\calO(m\log m)$ while estimation error grows by at most $\calO(2^{-d})$. We characterise $\dstar=\Floor{\log_{2}(2π/\eps_{2q})}$ directly from native gate fidelities, demonstrating 31.3 -43.7\% at m = 30, gate-count reduction on IBM Eagle/Heron and IonQ~Aria with negligible accuracy loss. Numerical experiments on the transverse-field Ising model confirm all theoretical predictions and reveal a \emph{noise-truncation synergy}: PFA-TQFT outperforms full QFT under NISQ noise $\eps_{2q}\gtrsim 2\times10^{-3}$.
Abstract Quantum effects like entanglement and coherent amplification can be used to drastically enhance the accuracy of quantum parameter estimation beyond classical limits. However, challenges such as decoherence and time-dependent errors hinder Heisenberg-limited amplification. We introduce Quantum Signal-Processing Phase Estimation algorithms that are robust against these challenges and achieve optimal performance as dictated by the Cramér-Rao bound. These algorithms use quantum signal transformation to decouple interdependent phase parameters into largely orthogonal ones, ensuring that time-dependent errors in one do not compromise the accuracy of learning the other. Combining provably optimal classical estimation with near-optimal quantum circuit design, our approach achieves a standard deviation accuracy of 10−4 radians for estimating unwanted swap angles in superconducting two-qubit experiments, using low-depth ( < 10) circuits. This represents up to two orders of magnitude improvement over existing methods. Theoretically and numerically, we demonstrate the optimality of our algorithm against time-dependent phase errors, observing that the variance of the time-sensitive parameter φ scales faster than the asymptotic Heisenberg scaling in the small-depth regime. Our results are rigorously validated against the quantum Fisher information, confirming our protocol’s ability to achieve unmatched precision for two-qubit gate learning.