On quantum algorithms

[1]  Gilles Brassard,et al.  Tight bounds on quantum searching , 1996, quant-ph/9605034.

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

[3]  Barenco,et al.  Approximate quantum Fourier transform and decoherence. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[4]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[5]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[6]  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.

[7]  J. A. Jones,et al.  Implementation of a quantum algorithm on a nuclear magnetic resonance quantum computer , 1998, quant-ph/9801027.

[8]  Richard J. Lipton,et al.  Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract) , 1995, CRYPTO.

[9]  R. Jozsa,et al.  Quantum Computation and Shor's Factoring Algorithm , 1996 .

[10]  Gilles Brassard,et al.  An exact quantum polynomial-time algorithm for Simon's problem , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.

[11]  Jonathan A. Jones,et al.  Implementation of a quantum search algorithm on a quantum computer , 1998, Nature.

[12]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[13]  Gilles Brassard,et al.  Quantum Counting , 1998, ICALP.

[14]  Lov K. Grover.  A framework for fast quantum mechanical algorithms , 1997, STOC '98.

[15]  P. Høyer.  Conjugated operators in quantum algorithms , 1999 .

[16]  R. Cleve,et al.  Quantum algorithms revisited , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.