Hidden Subhypergroup Problem

Details Hidden Subhypergroup Problem Hidden Subhypergroup Problem

2006-09-28

arxiv.org/abs/quant-ph/0609220v1

Physics

Quantum Physics

part of a technical report to IPM, Tehran

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Hidden Subhypergroup Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hidden Subhypergroup Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hidden Subhypergroup Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-532176