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

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 475-480

  Schmidt, Arthur ^a   Vollmer, Ulrich ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Number Field; Quantum Computer; Unit Group

Indexed keywords

NUMBER FIELD; QUANTUM COMPUTER; UNIT GROUP;

COMPUTATION THEORY; POLYNOMIALS; QUADRATIC PROGRAMMING; QUANTUM THEORY;

ALGORITHMS;

EID: 33748102438     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060661     Document Type: Conference Paper

References (15)

1. W. Banaszczyk. New bounds in some transference theorems in the geometry of numbers. Mathematische Annalen, 296:625-635, 1993.
2. D. Boneh and R. Lipton. Quantum cryptanalysis of hidden linear functions (extended abstract). In Don Coppersmith, editor, Advances in Cryptology - CRYPTO '95, volume 963 of Lecture Notes in Computer Science. Springer, 1995.
3. J. Buchmann. On the computation of units and class numbers by a generalization of Lagrange's algorithm. Journal of Number Theory, 26:8-30, 1987.
4. J. Buchmann. On the period length of the generalized Lagrange algorithm. Journal of Number Theory, 26:31-37, 1987.
5. Johannes Buchmann. Zur Komplexität der Berechnung von Einheiten und Klassenzahlen algebraischer Zahlkörper, 1987. Habilitationsschrift.
6. Johannes Buchmann. A subexponential algorithm for the determination of class groups and regulators of algebraic number fields. In Catherine Goldstein, editor, Séminaire de Théorie des Nombres, Paris 1988-1989, volume 91 of Progress in Mathematics, pages 21-41. Birkhäuser, 1990.
7. Johannes Buchmann, Max Jüntgen, and Michael Pohst. A practical version of the generalized lagrange algorithm. Exp. Math., (3):200-207, 1994.
8. Johannes Buchmann, Markus Maurer, and Bodo Möller. Cryptography based on number fields with large regulator. Technical Report T1-5/00, Technische Universität Darmstadt, Fachbereich Informatik, 2000. http: //www.Informatik.tu-darmastadt.de/TI/Veroeffentlichung/TR/.
9. Sean Hallgren. Polynomial-time quantum algorithms for pell's equation and the principal ideal problem. In Proceedings of the thiry-fourth annual ACM symposium on the theory of computing, pages 653-658. ACM Press, 2002.
10. Richard Jozsa. Quantum algorithms and the fourier transform. Proc Roy Soc Lond A, pages 323-337, 1998.
11. Alexei Kitaev. Quantum measurements and the abelian stabilizer problem. Electronic Colloquium on Computational Complexity (ECCC), 3(3), 1996.
12. Michele Mosca and Artur Ekert. The hidden subgroup problem and eigenvalue estimation on a quantum computer. Lecture Notes in Computer Science, 1509:174-188, 1999.
13. Peter W. Shor. Polynomial time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5): 1484-1509, 1997.
14. David R. Simon. On the power of quantum computation. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pages 116-123, Los Alamitos, CA, 1994. Institute of Electrical and Electronic Engineers Computer Society Press.
15. Christoph Thiel. On the complexity of some problems in algorithmic algebraic number theory. PhD thesis, Universität des Saarlandes, Saarbrücken, Germany, 1995.