2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/92143In 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.7 pages, 1 figureQuantum Physicstext