Abstract
We analyze the performance of a generalized Kitaev's phase-estimation algorithm where phase gates, acting on qubits prepared in a product state, may be distributed in an arbitrary way. Unlike the standard algorithm, where the mean square error scales as , the optimal generalizations offer the Heisenberg error scaling and we show that they are in fact very close to the fundamental Bayesian estimation bound. We also demonstrate that the optimality of the algorithm breaks down when losses are taken into account, in which case the performance is inferior to the optimal entanglement-based estimation strategies. Finally, we show that when an alternative resource quantification is adopted, which describes the phase estimation in Shor's algorithm more accurately, the standard Kitaev's procedure is indeed optimal and there is no need to consider its generalized version.
- Received 2 June 2014
- Revised 17 November 2014
DOI:https://doi.org/10.1103/PhysRevA.90.062313
©2014 American Physical Society