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

  title={Polynomial time quantum algorithm for the computation of the unit group of a number field},
  author={Arthur Schmidt and Ulrich Vollmer},
  booktitle={STOC '05},
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 [9] for the one-dimensional case corresponding to real-quadratic fields. 
Fast quantum algorithms for computing the unit group and class group of a number field
This work gives polynomial-time quantum algorithms for computing the unit group and class group of a number field when the number field has constant degree.
A quantum algorithm for computing the unit group of an arbitrary degree number field
A quantum algorithm is given that is polynomial in the degree of the field and the logarithm of its discriminant and a Gaussian-weighted superposition of lattice points can be used to provide a unique representation of a real-valued lattice.
Quantum Algorithm for Computing the Period Lattice of an Infrastructure
We present a quantum algorithm for computing the period lattice of infrastructures of fixed dimension. The algorithm applies to infrastructures that satisfy certain conditions. The latter are always
Quantum algorithms for number fields
This is a survey of recent results on quantum algorithms for the computation of invariants of number fields, namely the class number and the regulator. Most known classical algorithms for the
Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
It is shown that CGP and PIP reduce naturally to the computation of S-unit groups, which is another fundamental problem in number theory, and an efficient quantum reduction from computing S-units to the continuous hidden subgroup problem introduced in [11].
Efficient quantum algorithm for identifying hidden polynomials
A aquantum algorithm is presented that correctly identifies hidden m-variate polynomials for all but a finitenumber of values of d with constant probability and that has a running time that is onlypolylogarithmic in d.
Quantum Algorithms for many-to-one Functions to Solve the Regulator and the Principal Ideal Problem
New quantum algorithms to solve the regulator and the principal ideal problem in a real-quadratic number field are proposed and it is shown that even in this case Shor's algorithm computes the period with constant probability.
Quantum algorithms for algebraic problems
Quantum computers can execute algorithms that dramatically outperform classical computation. As the best-known example, Shor discovered an efficient quantum algorithm for factoring integers, whereas
Efficient Quantum Algorithm for the Hidden Parabola Problem
The success probability and the implementation of this measurement to certain classical problems involving polynomial equations are related and an efficient algorithm for hidden parabola is presented by establishing that the success probability of the measurement is lower bounded by a constant and that it can be implemented efficiently.
Quantum algorithms for one-dimensional infrastructures
This work generalizes Hallgren's quantum algorithms for quadratic number fields, while also providing a polynomial speedup over them, and shows that these quantum algorithms can also be applied to infrastructures obtained from complex cubic and totally complex quartic number fields.


Quantum measurements and the Abelian Stabilizer Problem
  • A. Kitaev
  • Computer Science, Mathematics
    Electron. Colloquium Comput. Complex.
  • 1996
A polynomial quantum algorithm for the Abelian stabilizer problem which includes both factoring and the discrete logarithm is presented, based on a procedure for measuring an eigenvalue of a unitary operator.
A subexponential algorithm for the determination of class groups and regulators of algebraic number fields
A new probabilistic algorithm for the determination of class groups and regulators of an algebraic number eld F is presented. Heuristic evidence is given which shows that the expected running time of
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
  • P. Shor
  • Computer Science, Mathematics
    SIAM Rev.
  • 1999
Efficient randomized algorithms are given for factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and have been used as the basis of several proposed cryptosystems.
On the period length of the generalized Lagrange algorithm
Abstract The generalized Lagrange algorithm is a number geometric generalization of Lagrange's continued fraction method for computing fundamental unit and class number of real quadratic number
Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract)
It is shown that any cryptosystem based on what is referred to as a ‘hidden linear form’ can be broken in quantum polynomial time and the notion of ‘junk bits’ is introduced which are helpful when performing classical computations that are not injective.
An improved quantum Fourier transform algorithm and applications
  • Lisa Hales, Sean Hallgren
  • Mathematics, Computer Science
    Proceedings 41st Annual Symposium on Foundations of Computer Science
  • 2000
We give an algorithm for approximating the quantum Fourier transform over an arbitrary Z/sub p/ which requires only O(n log n) steps where n=log p to achieve an approximation to within an arbitrary
The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer
It is pointed out how certain instances of Abelian hidden subgroup problems can be solved with only one control qubit, or flying qubits, instead of entire registers of control qubits.
Quantum algorithms and the fourier transform
The search for practical problems that can be solved exponentially faster on a quantum computer is one of the primary goals in research into algorithms for quantum computers. It has long been known
On the computation of units and class numbers by a generalization of Lagrange's algorithm
Based on a number geometric interpretation of the continued fraction algorithm in real quadratic fields an algorithm is developed by which one can compute a system of fundamental units of any order O
OLLER Abstract. We explain a variant of the Fiat-Shamir identication and sig- nature protocol which is based on the intractability of computing generators of principal ideals in algebraic number