Factoring problem with quantum Fourier transform: an intuitive approach
in Blog
One major application of quantum computing is cryptography. The commonly used encryption method RSA based on multiplying two large prime numbers \(N=xy\). In classical computing, there is no easy way to figure out the two prime numbers \(x,y\) given their product \(N\). With quantum computing, the decomposition can be found in polynomial time, much faster than existing classical computing algorithms.
