5 ms·
A Quantum Leap in Factoring
- phkahler 2y agoSo they took n^(1/2) out of the gate complexity and put it into the time complexity. An interesting trade.
- ggm 2y agoA theoretical method, highly dependent on stable Qbits, which has now had a theoretical improvement in its O(function) level complexity, but which alongside the modelling of Shor, depends on the theory meeting practice. Still: not good, if you aren't prepared for a PQC world.