Shor’s algorithm

Definition of Shor’s algorithm :

• Shor's algorithm is a polynomial-time quantum computer algorithm for integer factorization. Informally, it solves the following problem: Given an integer N, find its prime factors. It was invented in 1994 by the American mathematician Peter Shor. On a quantum computer, to factor an integer N, Shor's algorithm runs in polynomial time (the time taken is polynomial in the size of the integer given as input). Specifically, it takes quantum gates of order using fast multiplication, thus demonstrating that the integer-factorization problem can be efficiently solved on a quantum computer and is consequently in the complexity class BQP.