I’m skeptical about—and not qualified to review—this new result in factorization with a quantum computer, but if it’s true it’s a theoretical improvement in the speed of factoring large numbers with a quantum computer.
Spencer • March 16, 2026 6:10 AM
I was also going to post the aaronson link. The summary is that their algorithm relies on an exponential classical computation. So it works on small numbers but can’t scale (the largest composite tested in the paper is 1363).
Subscribe to comments on this entry
Sidebar photo of Bruce Schneier by Joe MacInnis.
Luca Mariot • March 16, 2026 5:55 AM
Definitely not an improvement; see Aaronson’s blog post: https://scottaaronson.blog/?p=9615