1 paper
K. Kuriyama, S. Sano, S. Furuichi
A precise estimation of the computational complexity in Shor's factoring algorithm under the condition that the large integer we want to factorize is composed by the product of two…