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

Bulletin of the American Physical Society

Quantum phase estimation with noisy qubits

Thomas E. O’Brien, Barbara M. Terhal

Published Mar 8, 2018• 0 citations
OpenAlex

Related papers

Quantum Phase Estimation

Osama M. Raisuddin, Suvranu De

Springer eBooks•Nov 14, 2025•0 citations

Noise analysis of Grover and phase estimation algorithms implemented as quantum singular value transformations for a small number of noisy qubits

Muhammad Abdullah Ijaz, Muhammad Faryad

The quantum singular value transformation (QSVT) algorithm is a general framework to implement most of the known algorithms and provides a way forward for designing new algorithms. In the present work, the impact of noise on the QSVT algorithm is examined for bit flip, phase flip, bit-phase flip, and depolarizing noise models for a small number of qubits. The small number of noisy qubits approximates the currently available noisy quantum computers. For simulation results, the QSVT implementation of the Grover search and quantum phase estimation (QPE) algorithms is considered. These algorithms are among the basic quantum algorithms and form the building blocks of various applications of quantum algorithms. The results showed that the QSVT implementation of the Grover search and QPE algorithms has a consistently worse dependence upon noise than the original implementation for all four noise models. The probability of success of the Grover algorithm and phase measured by the QPE algorithm were found to exponentially depend upon the error probability in the noisy channels but only linearly dependent on the number of qubits.

Scientific Reports•Nov 17, 2023•1 citation

Quantum Phase Estimation

Hiu Yung Wong

Springer eBooks•Jan 1, 2022•6 citations

Performance Comparison of Quantum Phase Estimation Algorithm with Different Number of Register Qubits on Noisy Quantum Processor

Jinyoung Ha, Jun Heo

In the process of implementing a quantum algorithm as a quantum circuit, the error rate of an actual quantum computer should be considered. In this paper, we confirm through simulation that the one control qubit quantum phase estimation algorithm performs better than the many control qubit quantum phase estimation algorithm on the noisy quantum processor. We use QISKit to simulate a quantum phase estimation algorithm. We performed the simulation considering the error rate of the IBM Q quantum processor. The error rate of the one control qubit quantum phase estimation algorithm is compared with the many control qubit quantum phase estimation algorithm.

IEEE Region 10 Symposium (TENSYMP)•Aug 23, 2021•3 citations

Iterative method to improve the precision of the quantum-phase-estimation algorithm

Junxu Li

Here we revisit the quantum-phase-estimation (QPE) algorithm and devise an iterative method to improve the precision of QPE with propagators over a variety of time spans. For a given propagator and a certain eigenstate as input, QPE with a propagator is introduced to estimate the phase corresponding to an eigenenergy. Due to the periodicity of the complex exponential, we can pinpoint the eigenenergy in a branch of comblike ranges by applying QPE with propagators over longer time spans. Thus, by picking up appropriate time spans, the iterative QPE with corresponding propagators can enable us to pinpoint the eigenenergy more precisely. Moreover, even if there are only a few qubits as ancilla qubits, high precision is still available by the proposed iterative method. Our work provides a feasible and promising means toward precise estimations of an eigenvalue on noisy intermediate-scale quantum devices.

arXiv:2402.14191•Physical Review A•Mar 7, 2024•8 citations

Quantum Phase Estimation

Hiu Yung Wong

Springer eBooks•Jun 21, 2023•0 citations
The quantum singular value transformation (QSVT) algorithm is a general framework to implement most of the known algorithms and provides a way forward for designing new algorithms. In the present work, the impact of noise on the QSVT algorithm is examined for bit flip, phase flip, bit-phase flip, and depolarizing noise models for a small number of qubits. The small number of noisy qubits approximates the currently available noisy quantum computers. For simulation results, the QSVT implementation of the Grover search and quantum phase estimation (QPE) algorithms is considered. These algorithms are among the basic quantum algorithms and form the building blocks of various applications of quantum algorithms. The results showed that the QSVT implementation of the Grover search and QPE algorithms has a consistently worse dependence upon noise than the original implementation for all four noise models. The probability of success of the Grover algorithm and phase measured by the QPE algorithm were found to exponentially depend upon the error probability in the noisy channels but only linearly dependent on the number of qubits.
In the process of implementing a quantum algorithm as a quantum circuit, the error rate of an actual quantum computer should be considered. In this paper, we confirm through simulation that the one control qubit quantum phase estimation algorithm performs better than the many control qubit quantum phase estimation algorithm on the noisy quantum processor. We use QISKit to simulate a quantum phase estimation algorithm. We performed the simulation considering the error rate of the IBM Q quantum processor. The error rate of the one control qubit quantum phase estimation algorithm is compared with the many control qubit quantum phase estimation algorithm.
Here we revisit the quantum-phase-estimation (QPE) algorithm and devise an iterative method to improve the precision of QPE with propagators over a variety of time spans. For a given propagator and a certain eigenstate as input, QPE with a propagator is introduced to estimate the phase corresponding to an eigenenergy. Due to the periodicity of the complex exponential, we can pinpoint the eigenenergy in a branch of comblike ranges by applying QPE with propagators over longer time spans. Thus, by picking up appropriate time spans, the iterative QPE with corresponding propagators can enable us to pinpoint the eigenenergy more precisely. Moreover, even if there are only a few qubits as ancilla qubits, high precision is still available by the proposed iterative method. Our work provides a feasible and promising means toward precise estimations of an eigenvalue on noisy intermediate-scale quantum devices.