Decomposing Finite Abelian Groups

Details Decomposing Finite Abelian Groups Decomposing Finite Abelian Groups

2001-01-05

arxiv.org/abs/cs/0101004v1

Computer Science

Data Structures and Algorithms

6 pages

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Decomposing Finite Abelian Groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Decomposing Finite Abelian Groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decomposing Finite Abelian Groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-120054