Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR96-003 | 4th December 1995 00:00

Quantum measurements and the Abelian Stabilizer Problem

RSS-Feed




TR96-003
Authors: Alexei Kitaev
Publication: 17th January 1996 13:38
Downloads: 1077
Keywords: 


Abstract:


We present a polynomial quantum algorithm for the Abelian stabilizer problem
which includes both factoring and the discrete logarithm. Thus we extend famous
Shor's results. Our method is based on a procedure for measuring an eigenvalue
of a unitary operator. Another application of this
procedure is a polynomial quantum Fourier transform algorithm for an arbitrary
finite Abelian group. The paper also contains a rather detailed introduction
to the theory of quantum computation.



ISSN 1433-8092 | Imprint