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).
http://spectrum.ieee.org/tech-talk/computing/hardware/encryp...
The article has a broken link to the paper abstract, which is "Realization of a scalable Shor algorithm" available here:
http://science.sciencemag.org/content/351/6277/1068
And I'm yet to find a full copy of the paper anywhere, but it sure looks interesting...
Edit: Ah, here it is:
http://arxiv.org/abs/1507.08852
There's also "Compiling quantum algorithms for architectures with multi-qubit gates" which cites the above:
http://arxiv.org/abs/1601.06819