Discussion (25 points, 4 days ago) <a href="https://news.ycombinator.com/item?id=41810563">https://news.ycombinator.com/item?id=41810563</a><p>Including an interesting breakdown by @adrian_b of how the article jumps to conclusions not published in the paper.
In the range of 4-50 bits. FYI, classical computers have been used to crack RSA up to around 800 bits. Though <i>if</i> quantum computers can be scaled, the difficulty should scale less exponentially than with classical computers.
So 5,000 qbits to crack a 50 bit prime key. That’s an interesting factor. Assuming a similar scale, 204,800 qbits would crack RSA 2048 keys. I’m curious why it scales to needing “millions” according to those researchers.