Shor's algorithm without partial fractions
Abstract
The purpose of this note was to give a proof that Shor's algorithm for period search is polynomial using only the standard 2n quantum Fourier thansform and some simple trigonometry. There is an error that was pointed out to the author by Pavel Wocjan.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.