A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space

Details A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space

2004-06-21

arxiv.org/abs/quant-ph/0406151v1

Physics

Quantum Physics

7 pages, 1 figure

Scientific paper

In a recent paper, Kuperberg described the first subexponential time
algorithm for solving the dihedral hidden subgroup problem. The space
requirement of his algorithm is super-polynomial. We describe a modified
algorithm whose running time is still subexponential and whose space
requirement is only polynomial.

Affiliated with

Also associated with

No associations

Rating

A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space 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 A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-669947