Title :
Quantum factoring, discrete logarithms, and the hidden subgroup problem
Author_Institution :
Dept. of Comput. Sci., Bristol Univ., UK
Abstract :
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
Keywords :
algorithm theory; quantum computing; discrete logarithms; efficient quantum algorithms; hidden subgroup problem; integer factorization; quantum computation; quantum factoring; Computer displays; Discrete Fourier transforms; Equations; Error probability; Fourier transforms; Modular construction; Polynomials; Quantum computing; Registers; Zinc;
Journal_Title :
Computing in Science & Engineering
DOI :
10.1109/5992.909000
