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

Scalable Compilation of Resource-Efficient Tapers for High-Confidence Quantum Phase Estimation

David Raveh, Andrew T. Sornborger, Yiğit Subaşı, Łukasz Cincio

Published Nov 11, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum phase estimation is a key component of many quantum algorithms. Recently, high-confidence, tapered QPE (tQPE) has been introduced, significantly reducing the number of ancilla qubits necessary for a given failure probability, $ε$. We consider tQPE with $p = l+m$ ancillas, where $l$ represents the number of ancillas necessary to estimate a phase to a given resolution and $m$ represents the number of ''confidence'' qubits added to ensure a desired success probability. With tQPE the failure probability decays double exponentially in $m$, implying that only a few confidence qubits suffice for virtually any problem of interest. A key challenge for tQPE is the construction of the quantum circuit for preparing the taper state on the ancilla register. Here, we develop scalable tensor network methods (previous work was limited to ($l + m = 24$)) giving highly optimized state preparation circuits for optimally concentrated DPSS (Slepian) tapers. We provide an accompanying database of resource-efficient state preparation circuits for $l = 1, \dots, 50$ and $m = 1, \dots, 4$. Our circuits are shallow enough for a demonstration on near-term devices for small values of $l$. We run tQPE circuits for a 1-qubit system initialized in the ground state on Quantinuum's H2-2 quantum computer, demonstrating a $3\times$ to $18\times$ reduction in failure probability for $l=1,\ldots,10$ on a noisy device.

DOI
10.48550/arxiv.2611.15076

Related papers

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

Optimal Coherent Quantum Phase Estimation Via Tapering

Dhrumil Patel, Shi Jie Samuel Tan, Yiğit Subaşı +1 more

Quantum phase estimation is one of the fundamental primitives that underpins many quantum algorithms, including Shor’s algorithm for efficiently factoring large numbers. Due to its significance as a subroutine, in this work, we consider the coherent version of the phase estimation problem, where given an arbitrary input state and black-box access to unitaries U and controlled- U , the goal is to estimate the phases of U in superposition. Most existing phase estimation algorithms involve intermediary measurements that disrupt coherence. Only a couple of algorithms, including the standard quantum phase estimation algorithm, consider this coherent setting. However, the standard algorithm only succeeds with a constant probability. To boost this success probability, one can employ the coherent median technique, resulting in an algorithm with asymptotically optimal query complexity (the total number of calls to U and controlled- U ). However, this coherent median technique requires a large number of ancilla qubits and a computationally expensive quantum sorting network. To address this, in this work, we propose an improved version of the standard algorithm called the tapered quantum phase estimation algorithm, which leverages tapering (or window) functions commonly used in classical signal processing. Our algorithm achieves the asymptotically optimal query complexity without requiring the expensive coherent median technique to boost success probability. Moreover, we find the absolutely optimal taper—not only in the asymptotic scaling but in terms of exact performance. We provide an efficiently preparable ancilla state based on an approximation of the optimal taper, which incurs at most a factor-of-two increase in the probability of error, thereby maintaining near-optimal performance in practice. In the Appendixes, we give an explicit construction of the taper state preparation circuit. Finally, we derive an error bound for coherent quantum phase estimation when the phase estimate is used as a control and subsequently uncomputed.

arXiv:2403.18927•PRX Quantum•Feb 13, 2026•20 citations

Effects of Trotter Error, Digitization Error, and Initial State Overlap on Tapered Quantum Phase Estimation for Minimum Eigenvalue Computation

Elijah Pelofske, Stephan Eidenbenz

We numerically implement full quantum circuits of optimal tapered Quantum Phase Estimation (in the form of an implementable approximate bandwidth-limited DPSS taper) for the purpose of minimum eigenvalue computation, where the Hamiltonian time-evolution unitary is implemented using standard Trotterization, and the taper state is constructed using an optimized bandwidth-limited taper. We illustrate, on representative quantum Hamiltonians, with tractable exact classical numerical quantum circuit simulations, how tapered QPE performs with respect to optimal phase sampling rate, absolute error, Shannon entropy of the optimal phase distribution, when the tQPE algorithm parameters are changed. Those algorithm parameters are Trotter error, finite sampling, imperfect initial states, total evolution time, and digitization error (number of phase qubits). The reported numerical experiments include up to $\ell=10$ phase qubits of precision with $m=3$ additional phase-register error suppression qubits, on a $4$-qubit Heisenberg quantum magnet model Hamiltonian, using up to 12th-order Trotterization. We numerically show i) the steady-state optimal phase sampling rate is determined by the initial state overlap with the ground-state, ii) with respect to phase sampling probability, or overall eigenvalue sampling error rate, there is no strong evolution time dependence for tQPE unless there is high Trotter error, iii) the approximated time-evolution unitaries in tQPE, like in standard QPE, can result in substantial ringing, which leads to non-physical eigenvalue estimates.

quant-pharXiv:2609.06249•Sep 8, 2026•0 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

Statistical Quantum Phase Estimation: Extensions and Practical Considerations

Amit Surana, Brandon Allen

We present several refinements and extensions of the statistical quantum phase estimation (SQPE) framework to address some of its key practical limitations, improving its applicability to realistic cases. Recently, a family of statistical approaches for QPE have been proposed where each run uses only a few ancillae and shorter circuits than standard QPE and thus is better suited for early fault-tolerant quantum computers that are qubit-and depth-limited. SQPE method within that family estimates the cumulative distribution function (CDF) associated with spectral density of the Hamiltonian for a given trial state by using its Fourier approximation and then identifies the first jump discontinuity of the CDF to determine the ground state energy (GSE) of the Hamiltonian. It relies on random compilation procedure based on linear combination of unitaries (LCU) decomposition of the Hamiltonian assuming positive Pauli weights and requires a good estimate of lower bound on the overlap between the trial and true ground state, both of which may be difficult to achieve in practice. We address these limitations by generalizing the random compilation procedure for negative Pauli weights and employing a changepoint detection method for determining GSE which does not rely on an estimate of this overlap. We also show that by exploiting symmetry of the Fourier series one can reduce number of circuit runs/samples by a factor of 2x while keeping the GSE estimation accuracy the same. We illustrate these new developments numerically via a quantum simulator in Qiskit.

quant-pharXiv:2605.18876•May 19, 2026•0 citations

Toward Practical Quantum Phase Estimation: A Modular, Scalable, and Adaptive Approach

Alok Shukla, Prakash Vedula

ABSTRACT Quantum Phase Estimation (QPE) is a cornerstone algorithm in quantum computing, with applications ranging from integer factorization to quantum chemistry simulations. However, the resource demands of standard QPE, which require a large number of coherent qubits and deep circuits, pose significant challenges for current Noisy Intermediate Scale Quantum (NISQ) devices. In this work, we introduce the Adaptive Windowed Quantum Phase Estimation (AWQPE) algorithm, a novel method designed to address the limitations of standard QPE. AWQPE utilizes small, independent blocks of control qubits to estimate multiple phase bits simultaneously within a “window,” thereby significantly reducing the number of coherent qubits required to achieve a desired precision. These independent blocks are amenable to parallelization and, when combined with a robust least‐significant‐bit (LSB) to most‐significant‐bit (MSB) ambiguity resolution mechanism, enhance the algorithm's accuracy while mitigating the risk of error propagation. Our numerical simulations demonstrate AWQPE's accuracy and improved robustness relative to standard QPE under representative noise models, showcasing a favorable balance between resource efficiency and computational speed. This makes AWQPE particularly well‐suited for near‐term quantum platforms.

arXiv:2507.22460•Advanced Quantum Technologies•Mar 1, 2026•8 citations
Quantum phase estimation is a key component of many quantum algorithms. Recently, high-confidence, tapered QPE (tQPE) has been introduced, significantly reducing the number of ancilla qubits necessary for a given failure probability, εεε. We consider tQPE with p=l+mp = l+mp=l+m ancillas, where lll represents the number of ancillas necessary to estimate a phase to a given resolution and mmm represents the number of ''confidence'' qubits added to ensure a desired success probability. With tQPE the failure probability decays double exponentially in mmm, implying that only a few confidence qubits suffice for virtually any problem of interest. A key challenge for tQPE is the construction of the quantum circuit for preparing the taper state on the ancilla register. Here, we develop scalable tensor network methods (previous work was limited to (l+m=24l + m = 24l+m=24)) giving highly optimized state preparation circuits for optimally concentrated DPSS (Slepian) tapers. We provide an accompanying database of resource-efficient state preparation circuits for l=1,…,50l = 1, \dots, 50l=1,…,50 and m=1,…,4m = 1, \dots, 4m=1,…,4. Our circuits are shallow enough for a demonstration on near-term devices for small values of lll. We run tQPE circuits for a 1-qubit system initialized in the ground state on Quantinuum's H2-2 quantum computer, demonstrating a 3×3\times3× to 18×18\times18× reduction in failure probability for l=1,…,10l=1,\ldots,10l=1,…,10 on a noisy device.
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 is one of the fundamental primitives that underpins many quantum algorithms, including Shor’s algorithm for efficiently factoring large numbers. Due to its significance as a subroutine, in this work, we consider the coherent version of the phase estimation problem, where given an arbitrary input state and black-box access to unitaries U and controlled- U , the goal is to estimate the phases of U in superposition. Most existing phase estimation algorithms involve intermediary measurements that disrupt coherence. Only a couple of algorithms, including the standard quantum phase estimation algorithm, consider this coherent setting. However, the standard algorithm only succeeds with a constant probability. To boost this success probability, one can employ the coherent median technique, resulting in an algorithm with asymptotically optimal query complexity (the total number of calls to U and controlled- U ). However, this coherent median technique requires a large number of ancilla qubits and a computationally expensive quantum sorting network. To address this, in this work, we propose an improved version of the standard algorithm called the tapered quantum phase estimation algorithm, which leverages tapering (or window) functions commonly used in classical signal processing. Our algorithm achieves the asymptotically optimal query complexity without requiring the expensive coherent median technique to boost success probability. Moreover, we find the absolutely optimal taper—not only in the asymptotic scaling but in terms of exact performance. We provide an efficiently preparable ancilla state based on an approximation of the optimal taper, which incurs at most a factor-of-two increase in the probability of error, thereby maintaining near-optimal performance in practice. In the Appendixes, we give an explicit construction of the taper state preparation circuit. Finally, we derive an error bound for coherent quantum phase estimation when the phase estimate is used as a control and subsequently uncomputed.
We numerically implement full quantum circuits of optimal tapered Quantum Phase Estimation (in the form of an implementable approximate bandwidth-limited DPSS taper) for the purpose of minimum eigenvalue computation, where the Hamiltonian time-evolution unitary is implemented using standard Trotterization, and the taper state is constructed using an optimized bandwidth-limited taper. We illustrate, on representative quantum Hamiltonians, with tractable exact classical numerical quantum circuit simulations, how tapered QPE performs with respect to optimal phase sampling rate, absolute error, Shannon entropy of the optimal phase distribution, when the tQPE algorithm parameters are changed. Those algorithm parameters are Trotter error, finite sampling, imperfect initial states, total evolution time, and digitization error (number of phase qubits). The reported numerical experiments include up to ℓ=10\ell=10ℓ=10 phase qubits of precision with m=3m=3m=3 additional phase-register error suppression qubits, on a 444-qubit Heisenberg quantum magnet model Hamiltonian, using up to 12th-order Trotterization. We numerically show i) the steady-state optimal phase sampling rate is determined by the initial state overlap with the ground-state, ii) with respect to phase sampling probability, or overall eigenvalue sampling error rate, there is no strong evolution time dependence for tQPE unless there is high Trotter error, iii) the approximated time-evolution unitaries in tQPE, like in standard QPE, can result in substantial ringing, which leads to non-physical eigenvalue estimates.
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.
We present several refinements and extensions of the statistical quantum phase estimation (SQPE) framework to address some of its key practical limitations, improving its applicability to realistic cases. Recently, a family of statistical approaches for QPE have been proposed where each run uses only a few ancillae and shorter circuits than standard QPE and thus is better suited for early fault-tolerant quantum computers that are qubit-and depth-limited. SQPE method within that family estimates the cumulative distribution function (CDF) associated with spectral density of the Hamiltonian for a given trial state by using its Fourier approximation and then identifies the first jump discontinuity of the CDF to determine the ground state energy (GSE) of the Hamiltonian. It relies on random compilation procedure based on linear combination of unitaries (LCU) decomposition of the Hamiltonian assuming positive Pauli weights and requires a good estimate of lower bound on the overlap between the trial and true ground state, both of which may be difficult to achieve in practice. We address these limitations by generalizing the random compilation procedure for negative Pauli weights and employing a changepoint detection method for determining GSE which does not rely on an estimate of this overlap. We also show that by exploiting symmetry of the Fourier series one can reduce number of circuit runs/samples by a factor of 2x while keeping the GSE estimation accuracy the same. We illustrate these new developments numerically via a quantum simulator in Qiskit.
ABSTRACT Quantum Phase Estimation (QPE) is a cornerstone algorithm in quantum computing, with applications ranging from integer factorization to quantum chemistry simulations. However, the resource demands of standard QPE, which require a large number of coherent qubits and deep circuits, pose significant challenges for current Noisy Intermediate Scale Quantum (NISQ) devices. In this work, we introduce the Adaptive Windowed Quantum Phase Estimation (AWQPE) algorithm, a novel method designed to address the limitations of standard QPE. AWQPE utilizes small, independent blocks of control qubits to estimate multiple phase bits simultaneously within a “window,” thereby significantly reducing the number of coherent qubits required to achieve a desired precision. These independent blocks are amenable to parallelization and, when combined with a robust least‐significant‐bit (LSB) to most‐significant‐bit (MSB) ambiguity resolution mechanism, enhance the algorithm's accuracy while mitigating the risk of error propagation. Our numerical simulations demonstrate AWQPE's accuracy and improved robustness relative to standard QPE under representative noise models, showcasing a favorable balance between resource efficiency and computational speed. This makes AWQPE particularly well‐suited for near‐term quantum platforms.