  The purpose of this note was to give a proof that Shor's algorithm for period
search is polynomial using only the standard $2^{n}$ quantum Fourier thansform
and some simple trigonometry. There is an error that was pointed out to the
author by Pavel Wocjan.
