The central nature of the Hidden Subgroup problem

Details The central nature of the Hidden Subgroup problem The central nature of the Hidden Subgroup problem

2006-10-13

arxiv.org/abs/cs/0610086v2

Computer Science

Computational Complexity

12 pages, no figures. Corrected Proposition 3.3 and added discussion relating it to results of Childs and van Dam (quant-ph/05

Scientific paper

We show that several problems that figure prominently in quantum computing, including Hidden Coset, Hidden Shift, and Orbit Coset, are equivalent or reducible to Hidden Subgroup for a large variety of groups. We also show that, over permutation groups, the decision version and search version of Hidden Subgroup are polynomial-time equivalent. For Hidden Subgroup over dihedral groups, such an equivalence can be obtained if the order of the group is smooth. Finally, we give nonadaptive program checkers for Hidden Subgroup and its decision version.

Affiliated with

Also associated with

No associations

Rating

The central nature of the 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 The central nature of the Hidden Subgroup problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The central nature of the Hidden Subgroup problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-664681