Talk:Shor's algorithm: Difference between revisions

Revision as of 01:37, 5 March 2006

Revision as of 09:42, 16 April 2006

Line 32:

: No. The step is correct. The chances that ''gcd(a,N) > 1'' are very small when factoring large integers. So in practice this step should always fail to find a factor. Note, however, that the remainder of the algorithm rks if ''gcd(a,N)=1''. Furthermore testing ''gcd(a,N)'' is important when factoring small integers such as 15. [[User:24.228.93.22|24.228.93.22]] 14:47, 16 February 2006 (UTC)

== external link removed ==

: I removed the external link simply because it is NOT an implementation of Shor's algorithm in php. Such an implementation is impossible because a quantum dynamical system cannot be simulated with a classical system. The implementation ignores the entire quantum portion of the algorithm.

[[User:LHon|LHon]] 09:42, 16 April 2006 (UTC)

[[Category:To do]]