Quantum algorithm for the hidden subgroup problem on a class of semidirect product groups

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

5 pages, no figures

Scientific paper

We present efficient quantum algorithms for the hidden subgroup problem (HSP) on the semidirect product of cyclic groups $\Z_{p^r}\rtimes_{\phi}\Z_{p^2}$, where $p$ is any odd prime number and $r$ is any integer such that $r>4$. We also address the HSP in the group $\Z_{N}\rtimes_{\phi}\Z_{p^2}$, where $N$ is an integer with a special prime factorization. These quantum algorithms are exponentially faster than any classical algorithm for the same purpose.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Quantum algorithm for the hidden subgroup problem on a class of semidirect product 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 Quantum algorithm for the hidden subgroup problem on a class of semidirect product groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum algorithm for the hidden subgroup problem on a class of semidirect product groups will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-165188

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.