Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of non-abelian Groups

We present a family of non-abelian groups for which the hidden subgroup problem can be solved efficiently on a quantum computer.Comment: 16 pages, LaTeX2e, 3 figure