Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||A precise error bound for quantum phase estimation|
Von Smekal, L.
|Citation:||PLoS One, 2011; 6(5):e19663-1-e19663-4|
|Publisher:||Public Library of Science|
|James M. Chappell, Max A. Lohe, Lorenz von Smekal, Azhar Iqbal and Derek Abbott|
|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.|
|Keywords:||Probability; Algorithms; Quantum Theory|
|Rights:||© 2011 Chappell et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.|
|Appears in Collections:||Physics publications|
Files in This Item:
|hdl_67236.pdf||Published version||95.89 kB||Adobe PDF||View/Open|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.