The Exact Performance Bound for Kitaev Phase Estimation Algorithm

Key Points

• The aim is to establish an exact and achievable performance bound for Kitaev's phase estimation algorithm.
• Develop a theoretical framework to derive the exact performance bound.
• Conduct numerical simulations to validate the theoretical findings.
• Analyze the existing loose bounds and compare with the derived results.
• Achieved a 60%–70% reduction over the previous best performance bounds.
• Confirmed the exact bound through both theoretical proofs and numerical simulations.
• Establishes the optimality of the proposed bound, indicating no further improvements are possible.

Abstract