Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
y04nn
on May 7, 2020
|
parent
|
context
|
favorite
| on:
Breaking RSA Security with a Low Noise D-Wave 2000...
Ok, my bad, the time complexity of the Shor algorithme use in quantum computers is O((log n)^3) while your algorithm has a complexity O(n log log n). So quantum computers should be able to outperform classical computers in this task in the future.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: