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

Simple item page
dc.creatorRegev, Oded
dc.date2004-06-21
dc.date.accessioned2026-07-07T06:09:58Z
dc.date.available2026-07-07T06:09:58Z
dc.descriptionIn 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.
dc.description7 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/quant-ph/0406151
dc.identifierhttp://arxiv.org/abs/quant-ph/0406151
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/92143
dc.subjectQuantum Physics
dc.titleA Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space
dc.typetext

Files

Collections

arXiv