In 1994, the field of quantum computing had a significant breakthrough when Peter Shor introduced a quantum algorithm that factors integers in (probabilistic) polynomial time. In these talks, I'll explain the mathematical aspects of Shor's algorithm.
