Adversary Lower Bound for Element Distinctness
  In this note we construct an explicit optimal (negative-weight) adversary matrix for the element distinctness problem, given that the size of the alphabet is sufficiently large. 
Aleksandrs Belovs
quant-ph cs.CC