Quantum algorithm for the hidden subgroup problem on a class of semidirect product groups

Simple item page
dc.creatorCosme, Carlos Magno M.
dc.creatorPortugal, Renato
dc.date2007-03-23
dc.date2007-04-23
dc.date.accessioned2026-07-07T07:57:43Z
dc.date.available2026-07-07T07:57:43Z
dc.descriptionWe present efficient quantum algorithms for the hidden subgroup problem (HSP) on the semidirect product of cyclic groups $\Z_{p^r}\rtimes_ϕ\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_ϕ\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.
dc.description5 pages, no figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0703223
dc.identifierhttp://arxiv.org/abs/quant-ph/0703223
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/127749
dc.subjectQuantum Physics
dc.titleQuantum algorithm for the hidden subgroup problem on a class of semidirect product groups
dc.typetext

Files

Collections

arXiv