3 ms·

Somehow the submitted link got mangled: http://spectrum.ieee.org/tech-talk/computing/hardware/encryptionbusting-quantum-computer-practices-factoring-in-scalabl

by jcr 11y ago

Somehow the submitted link got mangled: http://spectrum.ieee.org/tech-talk/computing/hardware/encryptionbusting-quantum-computer-practices-factoring-in-scalable-fiveatom-experiment 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 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 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 http://arxiv.org/abs/1601.06819

xyzzy123 11y ago
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).
dang 11y ago
Ok, we changed the URL from http://spectrum.ieee.org/tech-talk/computing/hardware/ http://spectrum.ieee.org/tech-talk/computing/hardware/. Thanks! Btw, http://www.scottaaronson.com/blog/?p=2673 http://www.scottaaronson.com/blog/?p=2673 (via https://news.ycombinator.com/item?id=11235186 https://news.ycombinator.com/item?id=11235186) is also about this.