Decomposing Finite Abelian Groups

Simple item page
dc.creatorCheung, Kevin K. H.
dc.creatorMosca, Michele
dc.date2001-01-05
dc.date.accessioned2026-07-07T03:16:50Z
dc.date.available2026-07-07T03:16:50Z
dc.descriptionThis 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).
dc.description6 pages
dc.identifierhttps://arxiv.org/abs/cs/0101004
dc.identifierhttp://arxiv.org/abs/cs/0101004
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30501
dc.subjectData Structures and Algorithms
dc.subjectQuantum Physics
dc.subjectF.1
dc.titleDecomposing Finite Abelian Groups
dc.typetext

Files

Collections

arXiv