So for a long time I've felt intuitively that Shor's algorithm is bs, but I'm trying to actually understand the math behind it now....
One of the key steps relies on constructive interference when the desired power of a root of unity lies close to positive real axis.
-
-
And this translates into relatively high probability of getting the desired result as a measurement.
-
However, for very large numbers, shouldn't there be an increasingly large set of false positives that come out with near-uniform prob?
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.