Content deleted Content added
Archimerged (talk | contribs) →QFT?: Shor used forward transform. |
Archimerged (talk | contribs) →QFT?: Why I am removing the "inverse" from the article. |
||
Line 68:
*After looking into this, I found out that it ''is'' in fact the inverse QFT rather than the "normal" QFT that is used in implementing Shor's Algorithm. I fixed the article accordingly.--[[User:RckmRobot|RckmRobot]] 17:54, 21 June 2006 (UTC)
::Can you give a source for this? Shor's original paper uses forward transform. Besides, there is little difference. It just needs to be consistent, use forward then back, or back then forward. [[User:Archimerged|Archimerged]] 06:05, 7 April 2007 (UTC)
::I see one reference: [http://people.ccmr.cornell.edu/~mermin/qcomp/chap3.pdf Mermin] p. 14. But on p. 15, Mermin writes "This is precisely the form (3.44) of UFT itself, except that each V is replaced by its adjoint, which (3.40) shows amounts to replacing each ''i'' by ''–i'' in the arguments of all the phase factors. This is exactly what one does to invert the ordinary functional Fourier transform." It is [[Imaginary_unit#i_and_.E2.88.92i|well known]] that there is no objective difference between ''i'' and ''–i''. Insisting on writing "inverse" all over the place is irrelevant detail.
==Implementation==
| |||