21.05.2023 - 22:59 [ American Mathematical Society ]

The Mathematics Behind Quantum Computing: Part I

(May 2007)

For a 1024-bit number, Shor‘s Algorithm requires on the order of 1024(3), about one billion, operations. I do not have any information on how quickly quantum operations can be executed, but if each one took one second our factorization would last 34 years. If a quantum computer could run at the speed of today‘s electronic computers (100 million instructions per second and up) then factorization of the 1024-bit number would be a matter of seconds.