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

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.

• Type: Conference
• Year: 2005
• Where: STOC
• Authors: Arthur Schmidt, Ulrich Vollmer
• Keywords: Algorithms, Fixed Field Degree, Irrational Period Lattice, Quantum Algorithm, STOC 2005