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

High Precision Algorithm for Phase Estimation

Alexander Steingaß

Published Jan 1, 2001• 0 citations
OpenAlex

Related papers

Faster ground state preparation and high-precision ground energy estimation with fewer qubits

Yimin Ge, Jordi Tura, J. I. Cirac

We propose a general-purpose quantum algorithm for preparing ground states of quantum Hamiltonians from a given trial state. The algorithm is based on techniques recently developed in the context of solving the quantum linear system problem. We show that, compared to algorithms based on phase estimation, the runtime of our algorithm is exponentially better as a function of the allowed error, and at least quadratically better as a function of the overlap with the trial state. We also show that our algorithm requires fewer ancilla qubits than existing algorithms, making it attractive for early applications of small quantum computers. Additionally, it can be used to determine an unknown ground energy faster than with phase estimation if a very high precision is required.

arXiv:1712.03193•Journal of Mathematical Physics•Feb 1, 2019•187 citations

Phase Estimation and Its Applications

Weng-Long Chang, Athanasios V. Vasilakos

Studies in big data•Dec 21, 2020•0 citations

Efficient Bayesian phase estimation via entropy-based sampling

Yuxiang Qiu, Min Zhuang, Jiahao Huang +1 more

Abstract Bayesian estimation approaches, which are capable of combining the information of experimental data from different likelihood functions to achieve high precisions, have been widely used in phase estimation via introducing a controllable auxiliary phase. Here, we present a Bayesian phase estimation (BPE) algorithm with an ingenious update rule of the auxiliary phase designed via entropy-based sampling. Unlike other adaptive BPE algorithms, the auxiliary phase in our algorithm is determined only once in a pre-estimation step. With simple statistical analysis on a small batch of data, an iteration rule for the auxiliary phase is pre-established and used in all afterward updates, instead of complex calculations in every update trails. During this pre-estimation process the most informative data can be selected, which guides one to perform the BPE with much less measurement times. As the measurement times for the same amount of Bayesian updates is significantly reduced, our algorithm via entropy-based sampling can work as efficient as other adaptive BPE algorithms and shares the advantages (such as wide dynamic range and perfect noise robustness) of non-adaptive BPE algorithms. Our algorithm is of promising applications in various practical quantum sensors such as atomic clocks and quantum magnetometers.

arXiv:2107.00196•Quantum Science and Technology•May 31, 2022•9 citations

Algorithm structures for cyclic phase estimation

José M. N. Leitão, José M. F. Moura

•Jan 1, 1981•2 citations

Selecting efficient phase estimation with constant-precision phase shift operators

Chen-Fu Chiang

arXiv:1306.2715•Quantum Information Processing•Oct 26, 2013•2 citations

Optimal quantum phase estimation algorithms

Joseph T. Smith

It is suggested that computers exploiting quantum phenomena can solve tasks with an efficiency surpassing that achievable by classical computers. One example of this quantum advantage arises in the task of phase estimation. Here, an unknown eigenvalue of a unitary evolution is estimated, a critical subroutine for many quantum algorithms and quantum metrology protocols. For a fixed amount of resources, the utilisation of quantum coherence and entanglement can lead to a quadratic increase in precision of the final estimate compared to classical statistical limits. In systems affected by depolarising noise, including current quantum hardware, this improvement becomes a constant factor. While numerous phase estimation algorithms have been proposed claiming to achieve these theoretical limits, the lack of well-defined criteria for both precision and resource utilisation casts doubt on these results. Further issues arise due to a lack of point identification (the existence of multiple equally likely estimates) that some algorithms have. I aim to address these issues in this thesis. I employ statistical inference, the theoretical foundation for interpreting any quantum measurement, in order to find rigorous definitions for precision and resource use. By combining these definitions with previous work in the field of quantum metrology, I am able to derive theoretical precision limits that one can hope to achieve. I then outline several phase estimation algorithms that can achieve these limits in different contexts. These algorithms that I describe are split into three major groups. Algorithms in the first group focus on the process of point identification; one set of measurements provides a precise estimate of the unknown phase before an additional set of measurements removes any ambiguities present. This second set of measurements can be either decided before any measurement is taken or during measurements in an iterative fashion. I show that the balancing of resources used in each set of measurements can lead to optimally scaling precision both with and without depolarising noise. These algorithms are based upon two of my peer-reviewed articles, [Phys. Rev. A 106, 062615 (2022)] and [Phys. Rev. A 109, 042412 (2024)]. The second group of algorithms that I introduce use the principles of Bayesian experimental design. Here, previous measurement outcomes are used to select future measurements recursively. These algorithms require large classical computing times to select each measurement but boast high precision in certain metrics. The final group of algorithms exploit the oscillating nature of phases by using a discrete Fourier transform (DFT). The DFT can be implemented using either classical or quantum hardware, the latter of which leads to the famous quantum phase estimation algorithm (QPEA). In this thesis, I show that the QPEA performs worse than some classical precision limits. However, I also suggest some modifications to the QPEA circuit that can lead to optimal precision scaling. These results and modifications are described in one of my articles awaiting publication [arXiv:2505.00764].

•Sep 12, 2025•1 citation
We propose a general-purpose quantum algorithm for preparing ground states of quantum Hamiltonians from a given trial state. The algorithm is based on techniques recently developed in the context of solving the quantum linear system problem. We show that, compared to algorithms based on phase estimation, the runtime of our algorithm is exponentially better as a function of the allowed error, and at least quadratically better as a function of the overlap with the trial state. We also show that our algorithm requires fewer ancilla qubits than existing algorithms, making it attractive for early applications of small quantum computers. Additionally, it can be used to determine an unknown ground energy faster than with phase estimation if a very high precision is required.
Abstract Bayesian estimation approaches, which are capable of combining the information of experimental data from different likelihood functions to achieve high precisions, have been widely used in phase estimation via introducing a controllable auxiliary phase. Here, we present a Bayesian phase estimation (BPE) algorithm with an ingenious update rule of the auxiliary phase designed via entropy-based sampling. Unlike other adaptive BPE algorithms, the auxiliary phase in our algorithm is determined only once in a pre-estimation step. With simple statistical analysis on a small batch of data, an iteration rule for the auxiliary phase is pre-established and used in all afterward updates, instead of complex calculations in every update trails. During this pre-estimation process the most informative data can be selected, which guides one to perform the BPE with much less measurement times. As the measurement times for the same amount of Bayesian updates is significantly reduced, our algorithm via entropy-based sampling can work as efficient as other adaptive BPE algorithms and shares the advantages (such as wide dynamic range and perfect noise robustness) of non-adaptive BPE algorithms. Our algorithm is of promising applications in various practical quantum sensors such as atomic clocks and quantum magnetometers.
It is suggested that computers exploiting quantum phenomena can solve tasks with an efficiency surpassing that achievable by classical computers. One example of this quantum advantage arises in the task of phase estimation. Here, an unknown eigenvalue of a unitary evolution is estimated, a critical subroutine for many quantum algorithms and quantum metrology protocols. For a fixed amount of resources, the utilisation of quantum coherence and entanglement can lead to a quadratic increase in precision of the final estimate compared to classical statistical limits. In systems affected by depolarising noise, including current quantum hardware, this improvement becomes a constant factor. While numerous phase estimation algorithms have been proposed claiming to achieve these theoretical limits, the lack of well-defined criteria for both precision and resource utilisation casts doubt on these results. Further issues arise due to a lack of point identification (the existence of multiple equally likely estimates) that some algorithms have. I aim to address these issues in this thesis. I employ statistical inference, the theoretical foundation for interpreting any quantum measurement, in order to find rigorous definitions for precision and resource use. By combining these definitions with previous work in the field of quantum metrology, I am able to derive theoretical precision limits that one can hope to achieve. I then outline several phase estimation algorithms that can achieve these limits in different contexts. These algorithms that I describe are split into three major groups. Algorithms in the first group focus on the process of point identification; one set of measurements provides a precise estimate of the unknown phase before an additional set of measurements removes any ambiguities present. This second set of measurements can be either decided before any measurement is taken or during measurements in an iterative fashion. I show that the balancing of resources used in each set of measurements can lead to optimally scaling precision both with and without depolarising noise. These algorithms are based upon two of my peer-reviewed articles, [Phys. Rev. A 106, 062615 (2022)] and [Phys. Rev. A 109, 042412 (2024)]. The second group of algorithms that I introduce use the principles of Bayesian experimental design. Here, previous measurement outcomes are used to select future measurements recursively. These algorithms require large classical computing times to select each measurement but boast high precision in certain metrics. The final group of algorithms exploit the oscillating nature of phases by using a discrete Fourier transform (DFT). The DFT can be implemented using either classical or quantum hardware, the latter of which leads to the famous quantum phase estimation algorithm (QPEA). In this thesis, I show that the QPEA performs worse than some classical precision limits. However, I also suggest some modifications to the QPEA circuit that can lead to optimal precision scaling. These results and modifications are described in one of my articles awaiting publication [arXiv:2505.00764].