A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space
Quantum Physics
2007-05-23 v1
Abstract
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.
Cite
@article{arxiv.quant-ph/0406151,
title = {A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space},
author = {Oded Regev},
journal= {arXiv preprint arXiv:quant-ph/0406151},
year = {2007}
}
Comments
7 pages, 1 figure