4 ms·

So far it has factored the number 21 to its constituent primes.

• mikercampbell 3y ago
  Honestly, you also have to consider the sculptures they are. I’m joking, but they absolutely had a different designer than the colliders
  • JoachimS 3y ago
    They really are quite beautiful. At least when they aren't submerged in liquid nitrogen. I like this picture since you probably can see what it also looks like when enclosed: https://spectrum.ieee.org/media-library/less-than-p-greater-than-a-researcher-at-ibms-thomas-j-watson-research-center-examines-some-of-the-quantum-hardware-being-constructed-there-less-than-p-greater-than.jpg?id=32303847 https://spectrum.ieee.org/media-library/less-than-p-greater-...
• 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 ago
    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!
  • NooneAtAll3 3y ago
    Intel reported being able to factor 35 three out of ten times or thereabouts in spring, iirc noise is hell in QC, sadly