We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard, Høyer, and Tapp, and imply an O(N3=4 logN) quantum upper bound for the element distinctness problem in the comparison complexity model. This contrasts with (N logN) classical complexity. We also prove a lower bound of ...