CENTER
Carnegie
Mellon School
of Computer Science|
Abstracts
|
The Joint ALADDIN/Theory/Operations Research Seminar |
|||||||||||||||||||||||||||||
|
Fast Quantum Algorithms for Computing the Unit Group and Class Group of a Number Field Abstract Computing the unit group and class group of a number field are two of the main tasks in computational algebraic number theory. Factoring integers reduces to a special case of computing the unit group, solving Pell's equation, but a reduction in the other direction is not known and appears more difficult. We give polynomial-time quantum algorithms for computing the unit group and class group when the number field has constant degree. Coffee and doughnuts available afterwards, at 4:00, in Wean Hall 7423. |
|||||||||||||||||||||||||||||
 |
This material is based upon work
supported by National Science Foundation under Grant No. 0122581.
Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation |
Aladdin
