The title is also a bit clickbaity. Yes, QC are "closer" to breaking RSA... but... "Briefly, the new work uses Kitaev’s version of Shor’s factoring algorithm,

The title is also a bit clickbaity. Yes, QC are "closer" to breaking RSA... but... "Briefly, the new work uses Kitaev’s version of Shor’s factoring algorithm, running on an ion-trap quantum computer with five calcium ions, to prove that, with at least 90% confidence, 15 equals 3×5..... So, what’s new is that a QC has now factored 15 “scalably”: that is, with much less cheating than before." - (Scott Aaronson).