Content deleted Content added
Archimerged (talk | contribs) Did anyone ever check this? |
|||
Line 80:
:::Though I certainly don't understand the details, if you read the paper [http://cryptome.org/shor-nature.pdf] it explains that a clever choice of <math>a</math> in the modular exponentiation <math>f(x)=a^x Mod(N)</math>, allows one of the two registers to be reduced to just 2 qubits, so in principle just 6qubits are needed for the experiment, they used 7 qubits because it was in some way more rigorous (to do with finding extra periodicities in f(x)). [[User:Sbandrews|sbandrews]] 17:25, 17 December 2006 (UTC)
== Did anyone ever check this? ==
The period finding subroutine has been somewhat wrong since the first time it was entered by [[User:CYD|CYD]] at 2002-01-07T17:34:03. [http://en.wikipedia.org/w/index.php?title=Shors_algorithm&oldid=285882].
If you look at Shor's paper, page 16, note that the Finite Fourier Transform is performed on q points, where n^2 < q <= 2n^2. This article has it on N points. I am correcting it.
[[User:Archimerged|Archimerged]] 05:11, 7 April 2007 (UTC)
| |||