A Note on Shor＇s Quantum Algorithm

Harry Buhrman

This note shows that Shor's algorithm for factoring in polynomial time on a quantum computer can be made to work with zero error probability.

Matt W. Hayward

Vicente Moret‐Bonillo

Gérard Fleury, Philippe Lacomme

The objective of this paper concerns at first the motivation and the method of Shor’s algorithm including remarks on quantum computing introducing an algorithmic description of the method. The corner stone of the Shor’s a... | Find, read and cite all the research you need on Tech Science Press

Rafael Pereira da Silva

Nolan R. Wallach

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.