Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

17

STOC
2005
ACM

favoriteEmaildiscussreport

158views Algorithms» more STOC 2005»

Polynomial time quantum algorithm for the computation of the unit group of a number field

14 years 5 months ago

Polynomial time quantum algorithm for the computation of the unit group of a number field

Download www.cdc.informatik.tu-darmstadt.de

We present a quantum algorithm for the computation of the irrational period lattice of a function on Zn which is periodic in a relaxed sense. This algorithm is applied to compute the unit group of finite extensions of Q. Execution time for fixed field degree over Q is polynomial in the discriminant of the field. Our algorithms generalize and improve upon Hallgren's work [Hal02] for the one-dimensional case corresponding to real-quadratic fields.

Arthur Schmidt, Ulrich Vollmer

Real-time Traffic

Algorithms | Fixed Field Degree | Irrational Period Lattice | Quantum Algorithm | STOC 2005 |

claim paper

Related Content

» Fast quantum algorithms for computing the unit group and class group of a number field

» On the Complexity of Computing Units in a Number Field

» Algorithms for ray class groups and Hilbert class fields

» The Role of SuperFast Transforms in Speeding Up Quantum Computations

» Exact Quantum Algorithms for the Leader Election Problem

» Quantum Query Complexity of Multilinear Identity Testing

» On Class Group Computations Using the Number Field Sieve

» Succinct quantum proofs for properties of finite groups

» An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2005
Where	STOC
Authors	Arthur Schmidt, Ulrich Vollmer

Comments (0)