dorsal/arxiv
View SchemaA Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space
| Authors | Oded Regev |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0406151 |
| URL | https://arxiv.org/abs/quant-ph/0406151 |
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.
{
"annotation_id": "8512c996-a4ee-442a-a4d3-a72ab75e776f",
"date_created": "2026-03-02T18:02:09.063000Z",
"date_modified": "2026-03-02T18:02:09.063000Z",
"file_hash": "37000b4aef24ac724fe0732a6bf467fa7dbe80033ec8a8626b245e082529597e",
"private": false,
"record": {
"abstract": "In a recent paper, Kuperberg described the first subexponential time\nalgorithm for solving the dihedral hidden subgroup problem. The space\nrequirement of his algorithm is super-polynomial. We describe a modified\nalgorithm whose running time is still subexponential and whose space\nrequirement is only polynomial.",
"arxiv_id": "quant-ph/0406151",
"authors": [
"Oded Regev"
],
"categories": [
"quant-ph"
],
"title": "A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space",
"url": "https://arxiv.org/abs/quant-ph/0406151"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "282b8ed9-8253-480b-a0d1-b1c97a07d88f",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}