Decomposing finite Abelian groups
Copyright policy )Decomposing finite Abelian groups
This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups into a product of cyclic 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).
- University of Waterloo Canada
- University of Waterloo (Canada) Canada
FOS: Computer and information sciences, Finite abelian groups, Quantum Physics, F.1, Quantum computation, Computer Science - Data Structures and Algorithms, FOS: Physical sciences, Analysis of algorithms, Data Structures and Algorithms (cs.DS), Quantum Physics (quant-ph)
FOS: Computer and information sciences, Finite abelian groups, Quantum Physics, F.1, Quantum computation, Computer Science - Data Structures and Algorithms, FOS: Physical sciences, Analysis of algorithms, Data Structures and Algorithms (cs.DS), Quantum Physics (quant-ph)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).8 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!