### Abstract

Original language | Undefined |
---|---|

Article number | quant-ph/0406151 |

Journal | arXiv |

State | Published - Jun 21 2004 |

### Keywords

- quant-ph

### Cite this

*arXiv*, [quant-ph/0406151].

**A subexponential time algorithm for the dihedral hidden subgroup problem with polynomial space.** / Regev, Oded.

Research output: Contribution to journal › Article

}

TY - JOUR

T1 - A subexponential time algorithm for the dihedral hidden subgroup problem with polynomial space

AU - Regev, Oded

N1 - 7 pages, 1 figure

PY - 2004/6/21

Y1 - 2004/6/21

N2 - 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.

AB - 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.

KW - quant-ph

M3 - Article

JO - arXiv

JF - arXiv

M1 - quant-ph/0406151

ER -