A quantum lower bound for the collision problem

Abstract

We extend Shi's 2002 quantum lower bound for collision in $r$-to-one functions with $n$ inputs. Shi's bound of $\Omega ((n/r{)}^{1/3})$ is tight, but his proof applies only in the case where the range has size at least $3n/2$. We give a modified version of Shi's argument which removes this restriction.

6 pages Extension of work in quant-ph/0112086

References in corpus (1)

• Quantum Lower Bounds by Polynomials

Cited by in corpus (7)

• Quantum algorithms for testing properties of distributions
• Quantum walk algorithm for element distinctness
• Limits on Efficient Computation in the Physical World
• Quantum Complexity of Testing Group Commutativity
• Polynomial Degree and Lower Bounds in Quantum Complexity: Collision and Element Distinctness with Small Range
• A polynomial quantum query lower bound for the set equality problem
• Quantum lower bounds for the set equality problems