tag:blogger.com,1999:blog-35187314.post1017636117752485060..comments2019-01-19T23:58:09.993-05:00Comments on Physics Buzz: Physicists Introduce "Quantum Fraud" Detection TestsAPS Webmasterhttp://www.blogger.com/profile/05951833208918853453noreply@blogger.comBlogger1125tag:blogger.com,1999:blog-35187314.post-4529356360841593202018-05-19T20:38:52.304-04:002018-05-19T20:38:52.304-04:00"Factoring of prime numbers" is a common..."Factoring of prime numbers" is a common solecism. I am, however, interested in whether anyone has compiled data on the success probabilities achievable by classical ways to "fake" Shor's algorithm. Random guess of an a < N and doing gcd(a,N) obviously succeeds with probablilty 1 - totient(N)/N ~= 1/sqrt(N), but how about (a) random trials of the fractional-approximation end-stage or (b) collapsing more of the state ebfore applying QFT?KWReganhttps://www.blogger.com/profile/09792573098380066005noreply@blogger.com