“Using the D-Wave Advantage, we successfully factored a 22-bit RSA integer, demonstrating the potential for quantum machines to tackle cryptographic problems,”
This is trivial to do using msieve. By this logic, regular computers can tackle cryptographic problems too. The problem is that you cannot solve them in your lifetime on such machines and the current quantum machines cannot solve them no matter how much time is given, so there is no problem at the moment. I do not feel like this tells us anything we do not already know but maybe an actual cryptologist would be willing to read this and give his opinion.
The interesting thing isn't that they've factored a 22-bit number, the interesting part is that they've done it with quantum annealing - obviously factoring 22-bits is easy!
I've got no idea of what is actually said in the paper (it is in Chinese) - there was a little bit of discussion on it a couple of days of days ago here: https://news.ycombinator.com/item?id=41810563
This is trivial to do using msieve. By this logic, regular computers can tackle cryptographic problems too. The problem is that you cannot solve them in your lifetime on such machines and the current quantum machines cannot solve them no matter how much time is given, so there is no problem at the moment. I do not feel like this tells us anything we do not already know but maybe an actual cryptologist would be willing to read this and give his opinion.