|
|
|
|
|
|
by ahelwer
2394 days ago
|
|
|
Quantum computers won't insta-crack AES. They only give a square-root speedup for symmetric crypto (so you can double the key length for equivalent security) with Grover's algorithm. It's public-key crypto algorithms based on prime factorization or the descrete log problem which will be broken by Shor's. However, running Shor's algorithm on production key sizes requires a huge quantum computer (with millions of qbits) and Scott Aaronson says he would be "astounded" if this was accomplished within the next decade. Improvements are believed to be exponential when simulating physical quantum systems. |
|
|
Quantum computing have be designed to solve a single problem : the simulation of quantum systems on a classical computer is very slow, lets build a quantum computer so that it will be fast.
It might seem like a fringe use case but it matters (a lot) to industrials and researchers in a wide variety of topics.