pith. sign in

arxiv: 1307.1183 · v1 · pith:AXWYBIBAnew · submitted 2013-07-04 · 🪐 quant-ph · math.GR

Quantum computational algorithm for hidden symmetry subgroup problems on semi-direct product of cyclic groups

classification 🪐 quant-ph math.GR
keywords groupsalgorithmcomputationalcyclichiddenprimeproductquantum
0
0 comments X
read the original abstract

We characterize the algebraic structure of semi-direct product of cyclic groups, $\Z_{N}\rtimes\Z_{p}$, 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.