S. Aaronson and A. Ambainis, The need for structure in quantum speedups, Theory of Computing, vol.10, issue.6, pp.133-166, 2014.

A. Ambainis, Polynomial degree and lower bounds in quantum complexity: Collision and element distinctness with small range, Theory of Computing, vol.1, issue.3, pp.37-46, 2005.

A. Ambainis, Understanding Quantum Algorithms via Query Complexity, 2017.

S. Aaronson and Y. Shi, Quantum lower bounds for the collision and the element distinctness problems, J. ACM, vol.51, issue.4, pp.595-605, 2004.

C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani, Strengths and weaknesses of quantum computing, SIAM J. Comput, vol.26, issue.5, pp.1510-1523, 1997.

R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. Wolf, Quantum lower bounds by polynomials, J. ACM, vol.48, issue.4, pp.778-797, 2001.
DOI : 10.1145/502090.502097

URL : http://arxiv.org/pdf/quant-ph/9802049

D. Deutsch and R. Jozsa, Rapid solution of problems by quantum computation, Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences, vol.439, pp.553-558, 1907.
DOI : 10.1098/rspa.1992.0167

URL : http://hexagon.physics.wisc.edu/teaching/2014f+ph805+quantum+information/papers/deutsch+jozsa+prsa+1992.pdf

S. Kutin, Quantum lower bound for the collision problem with small range, Theory of Computing, vol.1, issue.2, pp.29-36, 2005.

W. Peter and . Shor, Algorithms for quantum computation: Discrete logarithms and factoring, IEEE Symposium on Foundations of Computer Science, pp.124-134, 1994.

D. R. Simon, On the power of quantum cryptography, 35th Annual Symposium on Foundations of Computer Science, pp.116-123, 1994.

M. Zhandry, A note on the quantum collision and set equality problems, Quantum Info. Comput, vol.15, issue.7-8, pp.557-567, 2015.