71 search results - page 1 / 15 » Polynomial time quantum algorithm for the computation of the... |
STOC
2005
ACM
14 years 5 months ago
2005
ACM
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 t...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
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 solving Pell's eq...
ANTS
2004
Springer
13 years 10 months ago
2004
Springer
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
ISMVL
2002
IEEE
13 years 10 months ago
2002
IEEE
We present the role that spectral methods play in the development of the most impressive quantum algorithms, such as the polynomial time number factoring algorithm by Shor. While ...