Shor's algorithm and its realization

The most spectacular discovery in quantum computing is that quantum computers can effienctly perform some tasks which are not feasible on a classical computer.In 1994, Peter Shor came up with a quantum algorithm that calculates the prime factors of a large number vastly more efficiently than a classical computer. Shor's algorithm is so important because it could be used to break public-key cryptography schemes, such as the RSA (Rivest–Shamir–Adleman) scheme. In this talk, I will introduce the RSA scheme and the detailed procedure of Shor's algorithm which is based on the quantum fouier transform. I will also introduce the recent experimental realization of Shor's algorithm.

Ref:

Nielsen, Michael A., and Isaac Chuang. "Quantum computation and quantum information."

Monz T, Nigg D, Martinez E A, et al. Science, 2016, 351(6277): 1068-1070.