Quantum computational algorithm for hidden symmetry subgroup problems on semi-direct product of cyclic groups
Abstract
We characterize the algebraic structure of semi-direct product of cyclic groups, Np, where p is an odd prime number which does not divide q-1 for any prime factor q of N, and provide a polynomial-time quantum computational algorithm solving hidden symmetry subgroup problem of the groups.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.