4 ms·
Yes, using the Shor algorithm and this was achieved in... 2012 ([1], from Wikipedia). Larger cases of quantum factorization since then used non-scalable algori
by yaantc 3y 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 https://arxiv.org/abs/1111.4147
- Woansdei 3y agono, 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!
- NooneAtAll3 3y agoIntel reported being able to factor 35 three out of ten times or thereabouts in spring, iirc noise is hell in QC, sadly