dorsal/arxiv
View SchemaQuantum algorithm for the hidden subgroup problem on a class of semidirect product groups
| Authors | Carlos Magno M. Cosme, Renato Portugal |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0703223 |
| URL | https://arxiv.org/abs/quant-ph/0703223 |
Abstract
We present efficient quantum algorithms for the hidden subgroup problem (HSP) on the semidirect product of cyclic groups $\Z_{p^r}\rtimes_{\phi}\Z_{p^2}$, where $p$ is any odd prime number and $r$ is any integer such that $r>4$. We also address the HSP in the group $\Z_{N}\rtimes_{\phi}\Z_{p^2}$, where $N$ is an integer with a special prime factorization. These quantum algorithms are exponentially faster than any classical algorithm for the same purpose.
{
"annotation_id": "82d41fd4-cff8-4368-ae69-dc42d2b7928e",
"date_created": "2026-03-02T18:02:37.243000Z",
"date_modified": "2026-03-02T18:02:37.243000Z",
"file_hash": "0ba849aa2836b4860392f50dbe9d0466dd47d9dc04aea40aca927f80bffe8b63",
"private": false,
"record": {
"abstract": "We present efficient quantum algorithms for the hidden subgroup problem (HSP)\non the semidirect product of cyclic groups $\\Z_{p^r}\\rtimes_{\\phi}\\Z_{p^2}$,\nwhere $p$ is any odd prime number and $r$ is any integer such that $r\u003e4$. We\nalso address the HSP in the group $\\Z_{N}\\rtimes_{\\phi}\\Z_{p^2}$, where $N$ is\nan integer with a special prime factorization. These quantum algorithms are\nexponentially faster than any classical algorithm for the same purpose.",
"arxiv_id": "quant-ph/0703223",
"authors": [
"Carlos Magno M. Cosme",
"Renato Portugal"
],
"categories": [
"quant-ph"
],
"title": "Quantum algorithm for the hidden subgroup problem on a class of semidirect product groups",
"url": "https://arxiv.org/abs/quant-ph/0703223"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "138be923-c6a8-4743-82af-129de5697e20",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}