Adversary Lower Bounds for the Collision and the Set Equality Problems [article]

Aleksandrs Belovs, Ansis Rosmanis
2017 arXiv   pre-print
We prove tight Ω(n^1/3) lower bounds on the quantum query complexity of the Collision and the Set Equality problems, provided that the size of the alphabet is large enough. We do this using the negative-weight adversary method. Thus, we reprove the result by Aaronson and Shi, as well as a more recent development by Zhandry.
arXiv:1310.5185v4 fatcat:iy732z4akvdxjk324sjxfn5us4