Quantum factoring, discrete logarithms, and the hidden subgroup problem
Richard Jozsa · Computing in Science & Engineering · 2001
Among the most remarkable successes of quantum computation are Shor's efficient quantum algorithms for the computational tasks of integer factorization and the evaluation of discrete logarithms. This article reviews the essential ingredients of these algorithms and draws out the unifying generalization of the so-called hidden subgroup problem.