In this talk I will introduce the quantum phase-estimation problem as well as the iterative algorithm by Kitaev that is commonly used to solve it. I show how Kitaev’s algorithm can be modified to obtain an asymptotically minimal sampling complexity. Two novel algorithms for obtaining an initial phase estimate, used to start the iterative estimation process, are given along with their theoretical sample complexity.