4 ms·
Many years away. A good guestimate is that you need 1M physical qubits factor numbers fast. Also, there is classical public-key cryptography (i.e. encryption a
by krastanov 5y ago
Many years away. A good guestimate is that you need 1M physical qubits factor numbers fast.
Also, there is classical public-key cryptography (i.e. encryption algorithms that run efficiently on today's classical computers) that is not susceptible to quantum computers. And symmetric cryptography has never been susceptible to quantum computers.
- saalweachter 5y agoSo if we draw an exponential curve from 53 to 127 qubits, we're looking at 13 doublings or about 2 decades? Neat!