On Quantum Algorithms for Noncommutative Hidden Subgroups

Quantum algorithms for factoring and finding discrete logarithms 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 the data to explicitly calculate a generating set for the subgroup. A general framework for the noncommutative hidden subgroup problem is discussed and we indicate future research directions.

[1]  D. Rockmore,et al.  Generalized FFT's- A survey of some recent results , 1996, Groups and Computation.

[2]  P. Høyer.  Efficient Quantum Transforms , 1997, quant-ph/9702028.

[3]  A. Selman,et al.  Complexity theory retrospective II , 1998 .

[4]  A. Berthiaume.  Quantum computation , 1998 .

[5]  R. Jozsa.  Quantum algorithms and the Fourier transform , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[6]  Daniel N. Rockmore,et al.  Some applications of generalized FFT's , 1997, Groups and Computation.

[7]  Alexei Y. Kitaev,et al.  Quantum measurements and the Abelian Stabilizer Problem , 1995, Electron. Colloquium Comput. Complex..

[8]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[9]  Jean-Pierre Serre,et al.  Linear representations of finite groups , 1977, Graduate texts in mathematics.

[10]  Daniel R. Simon.  On the Power of Quantum Computation , 1997, SIAM J. Comput..

[11]  R. Cleve,et al.  SUBSTITUTING QUANTUM ENTANGLEMENT FOR COMMUNICATION , 1997, quant-ph/9704026.

[12]  Avi Wigderson,et al.  Quantum vs. classical communication and computation , 1998, STOC '98.

[13]  Gilles Brassard,et al.  On The Power of Exact Quantum Polynomial Time , 1996 .

[14]  Dima Grigoriev,et al.  Testing Shift-Equivalence of Polynomials by Deterministic, Probabilistic and Quantum Machines , 1997, Theor. Comput. Sci..

[15]  Gilles Brassard,et al.  Quantum Counting , 1998, ICALP.

[16]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[17]  Gilles Brassard,et al.  An exact quantum polynomial-time algorithm for Simon's problem , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.

[18]  Robert Beals,et al.  Quantum computation of Fourier transforms over symmetric groups , 1997, STOC '97.