A precise error bound for quantum phase estimation

6Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

Quantum phase estimation is one of the key algorithms in the field of quantum computing, but up until now, only approximate expressions have been derived for the probability of error. We revisit these derivations, and find that by ensuring symmetry in the error definitions, an exact formula can be found. This new approach may also have value in solving other related problems in quantum computing, where an expected error is calculated. Expressions for two special cases of the formula are also developed, in the limit as the number of qubits in the quantum computer approaches infinity and in the limit as the extra added qubits to improve reliability goes to infinity. It is found that this formula is useful in validating computer simulations of the phase estimation procedure and in avoiding the overestimation of the number of qubits required in order to achieve a given reliability. This formula thus brings improved precision in the design of quantum computers. © 2011 Chappell et al.

Cite

CITATION STYLE

APA

Chappell, J. M., Lohe, M. A., von Smekal, L., Iqbal, A., & Abbott, D. (2011). A precise error bound for quantum phase estimation. PLoS ONE, 6(5). https://doi.org/10.1371/journal.pone.0019663

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free