Shor's algorithm without partial fractions

preprint2012arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.