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:2206.06392 · Physical Review A

Iterative quantum-phase-estimation protocol for shallow circuits

Joseph G. Smith, C. H. W. Barnes, David R. M. Arvidsson-Shukur

Published Dec 19, 2022• 20 citations
arXivHTMLPDF

Abstract

Given ${N}_{\text{tot}}$ applications of a unitary operation, parametrized by an unknown phase, a phase-estimation protocol on a large-scale fault-tolerant quantum system can reduce the standard deviation of an estimate of the phase from scaling as $O[1/\sqrt{{N}_{\text{tot}}}]$ to scaling as $O[1/{N}_{\text{tot}}]$. Owing to the limited resources available to near-term quantum devices, protocols that do not entangle probes have been developed. Their mean absolute error scales as $O[log({N}_{\text{tot}})/{N}_{\text{tot}}]$. Here, we propose a two-step protocol for near-term phase estimation, with an improved error scaling. Our protocol's first step produces several low-standard-deviation estimates of $\ensuremath{\theta}$, within $\ensuremath{\theta}$'s parameter range. The second step iteratively homes in on one of these estimates. Our protocol achieves a mean-absolute-error scaling of $O[\sqrt{log(log{N}_{\text{tot}})}/{N}_{\text{tot}}]$ and a root-mean-square-error scaling of $O[\sqrt{log{N}_{\text{tot}}}/{N}_{\text{tot}}]$. Furthermore, we demonstrate a reduction in the constant scaling factor and the required circuit depths. This allows our protocol to outperform the asymptotically optimal quantum-phase-estimation algorithm for realistic values of ${N}_{\text{tot}}$.

DOI
10.1103/physreva.106.062615

Related papers

Adaptive Bayesian quantum algorithm for phase estimation

Joseph G. Smith, C. H. W. Barnes, David R. M. Arvidsson-Shukur

Quantum-phase-estimation algorithms are critical subroutines in many applications for quantum computers and in quantum-metrology protocols. These algorithms estimate the unknown strength of a unitary evolution. By using coherence or entanglement to sample the unitary N tot times, the variance of the estimates can scale as O ( 1 / N tot 2 ) , compared to the best “classical” strategy with O ( 1 / N tot ) . The original algorithm for quantum phase estimation cannot be implemented on near-term hardware as it requires large-scale entangled probes and fault-tolerant quantum computing. Therefore, alternative algorithms have been introduced that rely on coherence and statistical inference. These algorithms produce quantum-boosted phase estimates without interprobe entanglement. This family of phase-estimation algorithms have, until now, never exhibited the possibility of achieving optimal scaling O ( 1 / N tot 2 ) . Moreover, previous works have not considered the effect of noise on these algorithms. Here, we present a coherence-based phase-estimation algorithm which can achieve the optimal quadratic scaling in the mean absolute error and the mean squared error. In the presence of noise, our algorithm produces errors that approach the theoretical lower bound. The optimality of our algorithm stems from its adaptive nature: Each step is determined, iteratively, using a Bayesian protocol that analizes the results of previous steps. Published by the American Physical Society 2024

arXiv:2303.01517•Physical Review A•Apr 11, 2024•29 citations

Optimal Resource Scaling for Early Fault Tolerant Iterative Quantum Phase Estimation under Cost Error Tradeoffs

Mrudula A Mahindrakar, Avhishek Chatterjee

The iterative quantum phase estimation algorithm (IPEA) is better suited for NISQ and early fault-tolerant hardware compared to the original algorithm, which requires the inverse quantum Fourier transform. However, current error mitigation and correction implementations lead to imperfect unitaries, causing erroneous phase feedback in IPEA. To improve the reliability of phase bits is to repeat the k^th iteration for the 2^k-th power of the unitary $N_k^*$ times, followed by a majority decision. However, due to variations in their circuit complexities, different iterations incur varying resource costs ($w_k$) and different per-shot error probabilities ($q_k$). Given tight resource constraints, we ask what the optimal number $\{N_k^*: 1\le k \le L\}$ of shots per bit is: $$\arg \max_{\{N_k\}} \mathbb{P}(\text{all } L \text{ bits correct}) \text{ s.t.} \sum_{k=1}^L w_k N_k \le W$$ We obtain closed-form expressions for $N^*_k$ under the conditions: $W \gg \sum_k w_k $(enough for at least one shot per iteration), $w_k$ increases with $k$, $q_k$ are small enough and $L$ is large. We do so by analyzing tractable upper and lower surrogate problems derived via tight concentration and anti-concentration bounds and showing that their solutions converge when $q_k\ll 1$. We observe that when $W\gg \sum_k w_k \ln\! \left(\sum_k w_k\right)$, the optimal $N_k^*$ is proportional to $\frac{\ln\! \left(\sum_k w_k\right)}{c_k}$ and does not depend on individual $w_k$, where $c_k=-\ln\left(2\sqrt{\left(1-\frac{q_k}{2} \right) \frac{q_k}{2}}\right) \propto \ln\frac{1}{q_k}$. However, when $\sum_k w_k \ll W\ll\sum_k w_k \ln\! \left(\sum_k w_k\right)$, the allocation is also (additively) influenced by $\frac{1}{c_k}\ln\frac{1}{w_k}$ for larger values of $k$, i.e., higher powers of unitary. These results lead to simple rules of thumb for resource allocation that may benefit the design of practical systems.

quant-pharXiv:2609.40128•Oct 1, 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

Phase Estimation with Compressed Controlled Time Evolution

Erenay Karacan

Many optimally scaling quantum simulation algorithms employ controlled time evolution of the Hamiltonian, which is typically the major bottleneck for their efficient implementation. This work establishes a compression protocol for encoding the controlled time evolution operator of translationally invariant, local Hamiltonians into a quantum circuit. It achieves a near-optimal in time $t$ scaling for circuit depth $\mathcal{O}(t \text{ polylog}(t N/ε))$, while reducing the control overhead from a multiplicative to an additive factor. We report that this compression protocol enables the implementation of Iterative Quantum Phase Estimation with as few as 414 CNOT gates for a frustrated quantum spin system on a 6$\times$6 triangular lattice and delivers ground state energy errors below 1% (with $\pm$ 1.5% variation, calculated with a hardware noise aware pipeline) on a 4$\times$4 triangular lattice using the noisy emulator of the Quantinuum H2 trapped ion device.

quant-pharXiv:2511.21225•Physical Review A•Nov 27, 2025•2 citations

Heisenberg-limited Bayesian phase estimation with low-depth digital quantum circuits

Su Direkci, Ran Finkelstein, Manuel Endres +1 more

Abstract Optimal phase estimation protocols require complex state preparation and readout schemes, generally unavailable or unscalable in many quantum platforms. We develop a scheme that achieves near-optimal precision up to a constant overhead for Bayesian phase estimation, using simple digital quantum circuits with depths scaling logarithmically with the number of qubits. This is done by approximating the optimal initial states with products of Greenberger-Horne-Zeilinger states for Gaussian prior phase distributions with arbitrary widths. We study various protocols that employ this class of states with different levels of measurement and post-processing complexities, and obtain improvement compared to previously proposed schemes. We then use our scheme to address phase slip errors and laser noise, which impose a major limitation in Bayesian phase estimation and atomic clocks. Based on our scheme, we develop an efficient protocol to suppress this noise that outperforms existing methods.

arXiv:2407.06006•npj Quantum Information•Jan 15, 2026•12 citations

Faster phase estimation

Krysta M. Svore, Matthew B. Hastings, Michael Hartley Freedman

We develop several algorithms for performing quantum phase estimation based on basic measurements and classical post-processing. We present a pedagogical review of quantum phase estimation and simulate the algorithm to numerically determine its scaling in circuit depth and width. We show that the use of purely random measurements requires a number of measurements that is optimal up to constant factors, albeit at the cost of exponential classical post-processing; the method can also be used to improve classical signal processing. We then develop a quantum algorithm for phase estimation that yields an asymptotic improvement in runtime, coming within a factor of $\log^*$ of the minimum number of measurements required while still requiring only minimal classical post-processing. The corresponding quantum circuit requires asymptotically lower depth and width (number of qubits) than quantum phase estimation.

arXiv:1304.0741•Quantum Information and Computation•Mar 1, 2014•98 citations
Given Ntot{N}_{\text{tot}}Ntot​ applications of a unitary operation, parametrized by an unknown phase, a phase-estimation protocol on a large-scale fault-tolerant quantum system can reduce the standard deviation of an estimate of the phase from scaling as O[1/Ntot]O[1/\sqrt{{N}_{\text{tot}}}]O[1/Ntot​​] to scaling as O[1/Ntot]O[1/{N}_{\text{tot}}]O[1/Ntot​]. Owing to the limited resources available to near-term quantum devices, protocols that do not entangle probes have been developed. Their mean absolute error scales as O[log(Ntot)/Ntot]O[log({N}_{\text{tot}})/{N}_{\text{tot}}]O[log(Ntot​)/Ntot​]. Here, we propose a two-step protocol for near-term phase estimation, with an improved error scaling. Our protocol's first step produces several low-standard-deviation estimates of \ensuremathθ\ensuremath{\theta}\ensuremathθ, within \ensuremathθ\ensuremath{\theta}\ensuremathθ's parameter range. The second step iteratively homes in on one of these estimates. Our protocol achieves a mean-absolute-error scaling of O[log(logNtot)/Ntot]O[\sqrt{log(log{N}_{\text{tot}})}/{N}_{\text{tot}}]O[log(logNtot​)​/Ntot​] and a root-mean-square-error scaling of O[logNtot/Ntot]O[\sqrt{log{N}_{\text{tot}}}/{N}_{\text{tot}}]O[logNtot​​/Ntot​]. Furthermore, we demonstrate a reduction in the constant scaling factor and the required circuit depths. This allows our protocol to outperform the asymptotically optimal quantum-phase-estimation algorithm for realistic values of Ntot{N}_{\text{tot}}Ntot​.
Quantum-phase-estimation algorithms are critical subroutines in many applications for quantum computers and in quantum-metrology protocols. These algorithms estimate the unknown strength of a unitary evolution. By using coherence or entanglement to sample the unitary N tot times, the variance of the estimates can scale as O ( 1 / N tot 2 ) , compared to the best “classical” strategy with O ( 1 / N tot ) . The original algorithm for quantum phase estimation cannot be implemented on near-term hardware as it requires large-scale entangled probes and fault-tolerant quantum computing. Therefore, alternative algorithms have been introduced that rely on coherence and statistical inference. These algorithms produce quantum-boosted phase estimates without interprobe entanglement. This family of phase-estimation algorithms have, until now, never exhibited the possibility of achieving optimal scaling O ( 1 / N tot 2 ) . Moreover, previous works have not considered the effect of noise on these algorithms. Here, we present a coherence-based phase-estimation algorithm which can achieve the optimal quadratic scaling in the mean absolute error and the mean squared error. In the presence of noise, our algorithm produces errors that approach the theoretical lower bound. The optimality of our algorithm stems from its adaptive nature: Each step is determined, iteratively, using a Bayesian protocol that analizes the results of previous steps. Published by the American Physical Society 2024
The iterative quantum phase estimation algorithm (IPEA) is better suited for NISQ and early fault-tolerant hardware compared to the original algorithm, which requires the inverse quantum Fourier transform. However, current error mitigation and correction implementations lead to imperfect unitaries, causing erroneous phase feedback in IPEA. To improve the reliability of phase bits is to repeat the k^th iteration for the 2^k-th power of the unitary Nk∗N_k^*Nk∗​ times, followed by a majority decision. However, due to variations in their circuit complexities, different iterations incur varying resource costs (wkw_kwk​) and different per-shot error probabilities (qkq_kqk​). Given tight resource constraints, we ask what the optimal number {Nk∗:1≤k≤L}\{N_k^*: 1\le k \le L\}{Nk∗​:1≤k≤L} of shots per bit is: arg⁡max⁡{Nk}P(all L bits correct) s.t.∑k=1LwkNk≤W\arg \max_{\{N_k\}} \mathbb{P}(\text{all } L \text{ bits correct}) \text{ s.t.} \sum_{k=1}^L w_k N_k \le Wargmax{Nk​}​P(all L bits correct) s.t.∑k=1L​wk​Nk​≤W We obtain closed-form expressions for Nk∗N^*_kNk∗​ under the conditions: $W \gg \sum_k w_k $(enough for at least one shot per iteration), wkw_kwk​ increases with kkk, qkq_kqk​ are small enough and LLL is large. We do so by analyzing tractable upper and lower surrogate problems derived via tight concentration and anti-concentration bounds and showing that their solutions converge when qk≪1q_k\ll 1qk​≪1. We observe that when W≫∑kwkln⁡ ⁣(∑kwk)W\gg \sum_k w_k \ln\! \left(\sum_k w_k\right)W≫∑k​wk​ln(∑k​wk​), the optimal Nk∗N_k^*Nk∗​ is proportional to ln⁡ ⁣(∑kwk)ck\frac{\ln\! \left(\sum_k w_k\right)}{c_k}ck​ln(∑k​wk​)​ and does not depend on individual wkw_kwk​, where ck=−ln⁡(2(1−qk2)qk2)∝ln⁡1qkc_k=-\ln\left(2\sqrt{\left(1-\frac{q_k}{2} \right) \frac{q_k}{2}}\right) \propto \ln\frac{1}{q_k}ck​=−ln(2(1−2qk​​)2qk​​​)∝lnqk​1​. However, when ∑kwk≪W≪∑kwkln⁡ ⁣(∑kwk)\sum_k w_k \ll W\ll\sum_k w_k \ln\! \left(\sum_k w_k\right)∑k​wk​≪W≪∑k​wk​ln(∑k​wk​), the allocation is also (additively) influenced by 1ckln⁡1wk\frac{1}{c_k}\ln\frac{1}{w_k}ck​1​lnwk​1​ for larger values of kkk, i.e., higher powers of unitary. These results lead to simple rules of thumb for resource allocation that may benefit the design of practical systems.
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.
Many optimally scaling quantum simulation algorithms employ controlled time evolution of the Hamiltonian, which is typically the major bottleneck for their efficient implementation. This work establishes a compression protocol for encoding the controlled time evolution operator of translationally invariant, local Hamiltonians into a quantum circuit. It achieves a near-optimal in time ttt scaling for circuit depth O(t polylog(tN/ε))\mathcal{O}(t \text{ polylog}(t N/ε))O(t polylog(tN/ε)), while reducing the control overhead from a multiplicative to an additive factor. We report that this compression protocol enables the implementation of Iterative Quantum Phase Estimation with as few as 414 CNOT gates for a frustrated quantum spin system on a 6$\times$6 triangular lattice and delivers ground state energy errors below 1% (with ±\pm± 1.5% variation, calculated with a hardware noise aware pipeline) on a 4$\times$4 triangular lattice using the noisy emulator of the Quantinuum H2 trapped ion device.
Abstract Optimal phase estimation protocols require complex state preparation and readout schemes, generally unavailable or unscalable in many quantum platforms. We develop a scheme that achieves near-optimal precision up to a constant overhead for Bayesian phase estimation, using simple digital quantum circuits with depths scaling logarithmically with the number of qubits. This is done by approximating the optimal initial states with products of Greenberger-Horne-Zeilinger states for Gaussian prior phase distributions with arbitrary widths. We study various protocols that employ this class of states with different levels of measurement and post-processing complexities, and obtain improvement compared to previously proposed schemes. We then use our scheme to address phase slip errors and laser noise, which impose a major limitation in Bayesian phase estimation and atomic clocks. Based on our scheme, we develop an efficient protocol to suppress this noise that outperforms existing methods.
We develop several algorithms for performing quantum phase estimation based on basic measurements and classical post-processing. We present a pedagogical review of quantum phase estimation and simulate the algorithm to numerically determine its scaling in circuit depth and width. We show that the use of purely random measurements requires a number of measurements that is optimal up to constant factors, albeit at the cost of exponential classical post-processing; the method can also be used to improve classical signal processing. We then develop a quantum algorithm for phase estimation that yields an asymptotic improvement in runtime, coming within a factor of log⁡∗\log^*log∗ of the minimum number of measurements required while still requiring only minimal classical post-processing. The corresponding quantum circuit requires asymptotically lower depth and width (number of qubits) than quantum phase estimation.