Hacker News new | ask | show | jobs
by yaantc 903 days ago
Yes, using the Shor algorithm and this was achieved in... 2012 ([1], from Wikipedia).

Larger cases of quantum factorization since then used non-scalable algorithms.

[1] https://arxiv.org/abs/1111.4147

2 comments

no, there has not been a single run of shor for even the number 6 as far as I know, in the link you give apendix A shows they did not in fact use the 5 bits needed for factoring 21. Every experiment I know about used short cuts to get an answer, you'd think 6 would be easy enough, it fits in the 4 bits they did use!
Intel reported being able to factor 35 three out of ten times or thereabouts in spring, iirc

noise is hell in QC, sadly