Shor's algorithm without partial fractions
classification
🪐 quant-ph
keywords
algorithmshorauthorerrorfourierfractionsgivenote
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.