STOC Conference 2001 Conference Paper
One-dimensional quantum walks
- Andris Ambainis
- Eric Bach 0001
- Ashwin Nayak 0001
- Ashvin Vishwanath
- John Watrous
Author name cluster
Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.
STOC Conference 2001 Conference Paper
SODA Conference 1994 Conference Paper
SODA Conference 1990 Conference Paper
STOC Conference 1987 Conference Paper
FOCS Conference 1985 Conference Paper
This paper discusses some new integer factoring methods involving cyclotomic polynomials. There are several polynomials f(X) known to have the following property: given a multiple of f(p), we can quickly split any composite number that has p as a prime divisor. For example -- taking f(X) to be X- 1 -- a multiple of p - 1 will suffice to easily factor any multiple of p, using an algorithm of Pollard. Other methods (due to Guy, Williams, and Judd) make use of X + 1, X2 + 1, and X2 ± X + 1. We show that one may take f to be Φk, the k-th cyclotomic polynomial. In constrast to the ad hoc methods used previously, we give a universal construction based on algebraic number theory that subsumes all the above results. Assuming generalized Riemann hypotheses, the expected time to factor N (given a multiple E of Φk(p)) is bounded by a polynomial in k, logE, and logN.
STOC Conference 1984 Conference Paper
STOC Conference 1983 Conference Paper
STOC Conference 1982 Conference Paper