Quantum Fast Factorization

Quantum Algorithm Given a composite number $N$ that is made up of two unknown primes $p$ and $q$. Then this algorithm can find this factorization in $O(n^2\lg n)$ time. This breaks RSA.