Decomposing Finite Abelian Groups

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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).
6 pages

Keywords

Data Structures and Algorithms, Quantum Physics, F.1

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/30501

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0101004
 http://arxiv.org/abs/cs/0101004

Collections

arXiv