Algorithms for Quantum Computation: Discrete Log and Factoring (Extended Abstract)

This paper gives algorithms for the discrete log and the factoring problems that take random polynomial time on a quantum computer (thus giving the rst examples of quantum cryptanalysis).

[1]  Andrew Chi-Chih Yao,et al.  Quantum Circuit Complexity , 1993, FOCS.

[2]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[3]  D. Deutsch.  Quantum computational networks , 1989, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[4]  Gilles Brassard,et al.  The quantum challenge to structural complexity theory , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[5]  Daniel R. Simon,et al.  On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[6]  P. Benioff.  Quantum mechanical hamiltonian models of turing machines , 1982 .

[7]  R. Feynman.  Simulating physics with computers , 1999 .

[8]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[9]  Umesh V. Vazirani,et al.  Quantum complexity theory , 1993, STOC.