|
|
|
|
|
|
by lmm
3842 days ago
|
|
|
Not proven. The best currently known algorithms for factoring on a classical computer take asymptotically longer than the best known quantum ones. That doesn't necessarily mean it's a fundamental limit of the universe. More generally we have no proof that BQP =/= P. |
|
|