Solution to the Hidden Subgroup Problem for a Class of Noncommutative Groups

Details Solution to the Hidden Subgroup Problem for a Class of Noncommutative Groups Solution to the Hidden Subgroup Problem for a Class of Noncommutative Groups

2011-04-07

arxiv.org/abs/1104.1361v1

Physics

Quantum Physics

12 pages

Scientific paper

The hidden subgroup problem (HSP) plays an important role in quantum computation, because many quantum algorithms that are exponentially faster than classical algorithms can be casted in the HSP structure. In this paper, we present a new polynomial-time quantum algorithm that solves the HSP over the group $\Z_{p^r} \rtimes \Z_{q^s}$, when $p^r/q= \up{poly}(\log p^r)$, where $p$, $q$ are any odd prime numbers and $r, s$ are any positive integers. To find the hidden subgroup, our algorithm uses the abelian quantum Fourier transform and a reduction procedure that simplifies the problem to find cyclic subgroups.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-718061