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

2013/07/04 by Jeong San Kim, Eunok Bae, Kim, Jeong San +3
Computer Science · Mathematics · Physics and Astronomy · #Algebraic structures and combinatorial models #FOS: Mathematics #FOS: Physical sciences #Group Theory (math.GR) #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #math.GR #quant-ph

paper · pdf · doi:10.48550/arxiv.1307.1183

12 pages, No figures. arXiv admin note: text overlap with arXiv:1107.2189 by other authors

arxiv created 2013/07/04 · openalex publication_date 2013/07/04 · arxiv updated 2013/07/05 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

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.

Related

• Quantum algorithm for the hidden subgroup problem on a class of semidirect product groups
• Solution to the Hidden Subgroup Problem for a Class of Noncommutative Groups
• Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem
• An exact quantum hidden subgroup algorithm and applications to solvable groups
• Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of\n non-abelian Groups