Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem

Details Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem

2011-12-14

arxiv.org/abs/1112.3333v1

Physics

Quantum Physics

10 pages

Scientific paper

We give an algorithm for the hidden subgroup problem for the dihedral group $D_N$, or equivalently the cyclic hidden shift problem, that supersedes our first algorithm and is suggested by Regev's algorithm. It runs in $\exp(O(\sqrt{\log N}))$ quantum time and uses $\exp(O(\sqrt{\log N}))$ classical space, but only $O(\log N)$ quantum space. The algorithm also runs faster with quantumly addressable classical space than with fully classical space. In the hidden shift form, which is more natural for this algorithm regardless, it can also make use of multiple hidden shifts. It can also be extended with two parameters that trade classical space and classical time for quantum time. At the extreme space-saving end, the algorithm becomes Regev's algorithm. At the other end, if the algorithm is allowed classical memory with quantum random access, then many trade-offs between classical and quantum time are possible.

Affiliated with

Also associated with

No associations

Rating

Another subexponential-time quantum algorithm for the dihedral 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 Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-561104