Decomposing Finite Abelian Groups
Data Structures and Algorithms
2007-05-23 v1 Quantum Physics
Abstract
This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann Hypothesis) also leads to an efficient algorithm for computing class numbers (known to be at least as difficult as factoring).
Cite
@article{arxiv.cs/0101004,
title = {Decomposing Finite Abelian Groups},
author = {Kevin K. H. Cheung and Michele Mosca},
journal= {arXiv preprint arXiv:cs/0101004},
year = {2007}
}
Comments
6 pages