https://hackerpaper.kaipfister.de/p/1903.00768/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=26554373urn:hackerpapers:mention:1903.00768:26554373Tue, 23 Mar 2021 12:49:04 GMT<p>Those quantum computers can&#x27;t execute Shor&#x27;s algorithm, which is required to attack RSA. AFAIK the best relevant factoring result is still 21=3*7 from 2012. There are claims of bigger factored numbers, but they exploited special cases (e.g. factors differing by only two bits) and have no hope of being extended to attack cryptography. https://crypto.stackexchange.com/questions/59795/largest-int... A 2019 paper manged to factor 21 on a 16 qubit ibmqx5, but failed to go up to 35: &gt; the algorithm fails to factor N=35. This is due to the cumulative errors coming from the increasing number of…</p><p><a href="https://hackerpaper.kaipfister.de/p/1903.00768/">Paper and discussion history</a>. A mention is not an endorsement.</p>quant-ph