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]  Lov K. Grover,et al.  Quantum computation , 1999, Proceedings Twelfth International Conference on VLSI Design. (Cat. No.PR00013).

[2]  A.Yu.Kitaev.  Quantum measurements and the Abelian Stabilizer Problem , 1995, quant-ph/9511026.

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

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

[5]  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.

[6]  T. Beth,et al.  Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of non-abelian Groups , 1998, quant-ph/9812070.

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

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

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

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

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

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

[13]  Daniel R. Simon,et al.  On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[14]  Richard J. Lipton,et al.  Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract) , 1995, CRYPTO.

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

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

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

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