|
|
|
|
|
|
by roywiggins
2472 days ago
|
|
|
It's weirder than that. Some quantum algorithms offer a big-O speedup over classical ones. Shor's algorithm is O(n), which is categorically faster than any known classical algorithm for integer factoring. It's polynomial time, whereas the fastest classical algorithm is subexponential. For every subexponential algorithm, there will be some n at which Shor's algorithm will be faster, and some slightly higher n at which it's much, much, much faster. https://en.wikipedia.org/wiki/Shor%27s_algorithm |
|
|