Polynomial-time quantum algorithms are given for the hidden subgroup problem over scalar-action semidirect products A semidirect Z_{p^k} and over quasi-Hamiltonian groups with a structured presentation.
Quantum Computation and Lattice Problems
1 Pith paper cite this work, alongside 197 external citations. Polarity classification is still indexing.
1
Pith paper citing it
197
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
The Hidden Subgroup Problem in Semidirect Products and Quasi-Hamiltonian Groups
Polynomial-time quantum algorithms are given for the hidden subgroup problem over scalar-action semidirect products A semidirect Z_{p^k} and over quasi-Hamiltonian groups with a structured presentation.