A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
On Quantum Algorithms for Noncommutative Hidden Subgroups
[chapter]
1999
Lecture Notes in Computer Science
Quantum algorithms for factoring and discrete logarithm have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the possibility of extending this general viewpoint to finding hidden subgroups of noncommutative groups. We present a quantum algorithm for the special case of dihedral groups which determines the hidden subgroup in a linear number of calls to the input function. We also explore the difficulties of developing an algorithm to process
doi:10.1007/3-540-49116-3_45
fatcat:nsuvwurevvh4bf6riimikqnwjq