Yilei Chen posted a preprint, claiming to give a polynomial-time quantum algorithm to solve lattice problems.
If it’s correct, this is an extremely big deal. It doesn’t quite break the main lattice-based cryptosystems, but it would put those cryptosystems into a precarious position, vulnerable to a mere further polynomial improvement in the approximation factor.
/nosanitize
You are correct.
There is NO quantum computer, now or in the near future, that could run such an algorithm.
But you know, theory guys ....
Follow
but that does bring us to an interesting question... how many qbits _are_ needed to run the type of algorithm we are talking about, in a time frame that is less than say 2 months? I doubt 1000 would be enough.