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:1306.2715 · Quantum Information Processing

Selecting efficient phase estimation with constant-precision phase shift operators

Chen-Fu Chiang

Published Oct 26, 2013• 2 citations
arXivHTMLPDF
DOI
10.1007/s11128-013-0659-9

Related papers

Selecting Efficient Phase Estimation With Constant-Precision Phase Shift Operators

Chen-Fu Chiang

We investigate the cost of three phase estimation procedures that require only constant-precision phase shift operators. The cost is in terms of the number of elementary gates, not just the number of measurements. Faster phase estimation requires the minimal number of measurements with a \log * factor of reduction when the required precision n is large. The arbitrary constant-precision approach (ACPA) requires the minimal number of elementary gates with a minimal factor of 14 of reduction in comparison to Kitaev's approach. The reduction factor increases as the precision gets higher in ACPA. Kitaev's approach is with a reduction factor of 14 in comparison to the faster phase estimation in terms of elementary gate counts.

•Jan 1, 2014•3 citations

High Precision Algorithm for Phase Estimation

Alexander Steingaß

•Jan 1, 2001•0 citations

Phase Estimation and Its Applications

Weng-Long Chang, Athanasios V. Vasilakos

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

Quantum phase estimation with arbitrary constant-precision phase shift operators

Hamed Ahmadi, Chen-Fu Chiang

While Quantum phase estimation (QPE) is at the core of many quantum algorithms known to date, its physical implementation (algorithms based on quantum Fourier transform (QFT) ) is highly constrained by the requirement of high-precision controlled phase shift operators, which remain difficult to realize. In this paper, we introduce an alternative approach to approximately implement QPE with arbitrary constant-precision controlled phase shift operators. The new quantum algorithm bridges the gap between QPE algorithms based on QFT and Kitaev's original approach. For approximating the eigenphase precise to the nth bit, Kitaev's original approach does not require any controlled phase shift operator. In contrast, QPE algorithms based on QFT or approximate QFT require controlled phase shift operators with precision of at least Pi/2n. The new approach fills the gap and requires only arbitrary constant-precision controlled phase shift operators. From a physical implementation viewpoint, the new algorithm outperforms Kitaev's approach.

arXiv:1012.4727•Quantum Information and Computation•Sep 1, 2012•10 citations

Quantum phase estimation with arbitrary constant-precision phase shift operators

AhmadiHamed, ChiangChen-Fu

While Quantum phase estimation (QPE) is at the core of many quantum algorithms known to date, its physical implementation (algorithms based on quantum Fourier transform (QFT)) is highly constrained...

Quantum Information and Computation•Sep 1, 2012•0 citations

Quantum Phase Estimation

Osama M. Raisuddin, Suvranu De

Springer eBooks•Nov 14, 2025•0 citations
We investigate the cost of three phase estimation procedures that require only constant-precision phase shift operators. The cost is in terms of the number of elementary gates, not just the number of measurements. Faster phase estimation requires the minimal number of measurements with a \log * factor of reduction when the required precision n is large. The arbitrary constant-precision approach (ACPA) requires the minimal number of elementary gates with a minimal factor of 14 of reduction in comparison to Kitaev's approach. The reduction factor increases as the precision gets higher in ACPA. Kitaev's approach is with a reduction factor of 14 in comparison to the faster phase estimation in terms of elementary gate counts.
While Quantum phase estimation (QPE) is at the core of many quantum algorithms known to date, its physical implementation (algorithms based on quantum Fourier transform (QFT) ) is highly constrained by the requirement of high-precision controlled phase shift operators, which remain difficult to realize. In this paper, we introduce an alternative approach to approximately implement QPE with arbitrary constant-precision controlled phase shift operators. The new quantum algorithm bridges the gap between QPE algorithms based on QFT and Kitaev's original approach. For approximating the eigenphase precise to the nth bit, Kitaev's original approach does not require any controlled phase shift operator. In contrast, QPE algorithms based on QFT or approximate QFT require controlled phase shift operators with precision of at least Pi/2n. The new approach fills the gap and requires only arbitrary constant-precision controlled phase shift operators. From a physical implementation viewpoint, the new algorithm outperforms Kitaev's approach.