Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem

Details Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem

2001-02-02

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

Physics

Quantum Physics

10 pages

Scientific paper

In this paper we show that certain special cases of the hidden subgroup problem can be solved in polynomial time by a quantum algorithm. These special cases involve finding hidden normal subgroups of solvable groups and permutation groups, finding hidden subgroups of groups with small commutator subgroup and of groups admitting an elementary Abelian normal 2-subgroup of small index or with cyclic factor group.

Affiliated with

Also associated with

No associations

Rating

Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup 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 Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-203371