First implementation of the Shor's algorithm

A quantum computer provides a speed-up over some classical algorithms. As well, some complex calculations or quantum simulations can be realized only using a quantum computer.
Shor's algorithm, an example of these complex calculations, try to find the prime factors of a given an integer N.
Scientists in Austria and the US have implemented for the first time this algorithm using Quantum Mechanics, and even though the number was just 15, a door is open for larger numbers and the way ahead towards Quantum Computation.