An Improved Query for the Hidden Subgroup Problem

Details An Improved Query for the Hidden Subgroup Problem An Improved Query for the Hidden Subgroup Problem

2011-01-05

arxiv.org/abs/1101.1053v3

Physics

Quantum Physics

26 pages. Expanded the introduction

Scientific paper

An equal superposition query with |0> in the response register is used in the "standard method" of single-query algorithms for the hidden subgroup problem (HSP). Here we introduce a different query, the character query, generalizing the well-known phase kickback trick. This query maximizes the success probability of subgroup identification under a uniform prior, for the HSP in which the oracle functions take values in a finite abelian group. We then apply our results to the case when the subgroups are drawn from a set of conjugate subgroups and obtain a success probability greater than that found by Moore and Russell.

Affiliated with

Also associated with

No associations

Rating

An Improved Query for 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 An Improved Query for the Hidden Subgroup Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Improved Query for the Hidden Subgroup Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-267610