Quantum computation of zeta functions of curves

Computational Complexity

Volumn 15, Issue 1, 2006, Pages 1-19

  Kedlaya, Kiran S ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Algebraic curves; Class groups; Cyclic resultants; Finite fields; Quantum computation; Zeta functions

Indexed keywords

EID: 33646528659     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/s00037-006-0204-7     Document Type: Article

References (28)

1. L. M. ADLEMAN & M.-D. HUANG (1996). Counting rational points on curves and abelian varieties over finite fields. In Algorithmic Number Theory (Talence), Lecture Notes in Comput. Sci. 1122, Springer, Berlin, 1-16.
2. L. BABAI & E. SZEMERÉDI (1984). On the complexity of matrix group problems I. In Proc. 25th Annual IEEE Symposium on Foundations of Computer Science (Singer Island, FL), IEEE Comput. Soc. Press, 229-240.
3. W. VAN DAM (2004). Quantum computing and zeroes of zeta functions. ArXiv preprint quant-ph/0405081.
4. ab-curves using Monsky-Washnitzer cohomology. Preprint available at www.esat.kuleuven.ac.be/~fvercaut.
5. B. DWORK (1960). On the rationality of the zeta function of an algebraic variety. Amer. J. Math. 82, 631-648.
6. P, ERDOS & A. RÉNYI (1965). Probabilistic methods in group theory. J. Anal. Math. 14, 127-138.
7. D. FRIED (1988). Cyclic resultants of reciprocal polynomials. In Holomorphic Dynamics (Mexico, 1986), Lecture Notes in Math. 1345, Springer, Berlin, 124-128.
8. W. FULTON (1989). Algebraic Curves. Advanced Book Classics, Addison-Wesley, Redwood City, CA.
9. G. HARMAN (2005). On the greatest prime factor of p - 1 with effective constants. Math. Comp. 74, 2035-2041 (electronic).
10. R. HARTSHORNE (1977). Algebraic Geometry. Grad. Texts in Math. 52, Springer, New York.
11. C. J. HILLAR (2005). Cyclic resultants. J. Symbolic Comput. 39, 653-669.
12. C. J. HILLAR & L. LEVINE (2004). Polynomial recurrence relations and cyclic resultants. ArXiv preprint math. AG/0411414.
13. M.-D. HUANG & D. IERARDI (1994). Efficient algorithms for the Riemann-Roch problem and for addition in the Jacobian of a curve. J. Symbolic Comput. 18, 519-539.
14. K. S. KEDLAYA (2004). Computing zeta functions via p-adic cohomology. In Algorithmic Number Theory, Lecture Notes in Comput. Sci. 3076, Springer, Berlin, 1-17.
15. D. KOZEN (1994). Efficient resolution of singularities of plane curves. In Foundations of Software Technology and Theoretical Computer Science (Madras), Lecture Notes in Comput. Sci. 880, Springer, Berlin, 1-11.
16. A. G. B. LAUDER & D. WAN (2002). Counting points on varieties over finite fields of small characteristic. Preprint available at www.maths.ox.ac.uk/~lauder.
17. C. LOMONT (2004). The hidden subgroup problem-review and open problems. ArXiv preprint quant-ph/0411037.
18. D. LORENZINI (1996). An Invitation to Arithmetic Geometry. Grad. Stud. Math. 9, Amer. Math. Soc., Providence, RI.
19. J. MILNE (1998). Abelian varieties. Notes online at www.jmilne.org.
20. I. PAK (1999). On probability of generating a finite group. Preprint available at math.mit.edu/~pak.
21. I. PAK (2001). Probability and computation on groups. Course notes available at math.mit.edu/~pak.
22. J. PILA (1990). Frobenius maps of abelian varieties and finding roots of unity in finite fields. Math. Comp. 55, 745-763.
23. R. SCHOOF (1985). Elliptic curves over finite fields and the computation of square roots mod p. Math. Comp. 44, 483-494.
24. P. W. SHOR (1999). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41, 303-332.
25. E. J. VOLCHECK (1994a). Computing in the Jacobian of a plane algebraic curve. In Algorithmic Number Theory (Ithaca, NY), Lecture Notes in Comput. Sci. 877, Springer, Berlin, 221-233.
26. E. J. VOLCHECK (1994b). Resolving singularities and computing in the Jacobian of a plane algebraic curve. Ph.D. thesis. UCLA.
27. J. WATROUS (2000). Succinct quantum proofs for properties of finite groups. In 41st Annual Symposium on Foundations of Computer Science (Redondo Beach, CA), IEEE Comput. Soc. Press, Los Alamitos, CA, 537-546.
28. J. WATROUS (2001). Quantum algorithms for solvable groups. In Proc. 33rd Annual ACM Symposium on Theory of Computing, ACM, New York, 60-67.