Nowadays, probably Peter Shor’s algorithm for function period finding is the most significant achievement in the field of quantum computing. It allows us to factor big composite numbers in polynomial time. However for the classical computations, this problem is believed to be hard. For a big number N = p × q, where p and … Continue reading Shor’s Algorithm