  The Hidden Subgroup Problem is used in many quantum algorithms such as
Simon's algorithm and Shor's factoring and discrete log algorithms. A
polynomial time solution is known in case of abelian groups, and normal
subgroups of arbitrary finite groups. The general case is still open. An
efficient solution of the problem for symmetric group $S_n$ would give rise to
an efficient quantum algorithm for Graph Isomorphism Problem. We formulate a
hidden sub-hypergroup problem for finite hypergroups and solve it for finite
commutative hypergroups. The given algorithm is efficient if the corresponding
QFT could be calculated efficiently.
