Andris Ambainis. Polynomial Degree and Lower Bounds in Quantum Complexity: Collision and Element Distinctness with Small Range. Theory of Computing, 1(1):37-46, 2005. [doi]
@article{Ambainis05,
title = {Polynomial Degree and Lower Bounds in Quantum Complexity: Collision and Element Distinctness with Small Range},
author = {Andris Ambainis},
year = {2005},
doi = {10.4086/toc.2005.v001a003},
url = {http://dx.doi.org/10.4086/toc.2005.v001a003},
researchr = {https://researchr.org/publication/Ambainis05},
cites = {0},
citedby = {0},
journal = {Theory of Computing},
volume = {1},
number = {1},
pages = {37-46},
}