Quantum lower bound for the collision problem
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Quantum time-space tradeoffs for sorting
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
ACM SIGACT News
Lower bounds for local search by quantum arguments
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Graph entropy and quantum sorting problems
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Quantum and classical query complexities of local search are polynomially related
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Quantum lower bounds for the collision and the element distinctness problems
Journal of the ACM (JACM)
The quantum query complexity of the hidden subgroup problem is polynomial
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Guest Column: NP-complete problems and physical reality
ACM SIGACT News
Quantum algorithms for the triangle problem
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the power of Ambainis lower bounds
Theoretical Computer Science
Improved algorithms for quantum identification of Boolean oracles
Theoretical Computer Science
Quantum sampling for balanced allocations
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Quantum algorithms for subset finding
Quantum Information & Computation
Quantum property testing for bounded-degree graphs
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
On the black-box complexity of sperner's lemma
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Hi-index | 0.00 |
Given a function f as an oracle, the collision problem is to find two distinct inputs i and j such that f(i) = f(j) under the promise that such inputs exist. In this paper, we prove that any quantum algorithm for finding a collision in an r -to-one function must evaluate the function\Omega (({n \mathord{\left/ {\vphantom {n r}} \right. \kern-\nulldelimiterspace} r}){1 \mathord{\left/ {\vphantom {1 {3)}}} \right. \kern-\nulldelimiterspace} {3)}} times, where n is the size of the domain and {r \mathord{\left/ {\vphantom {r n}} \right. \kern-\nulldelimiterspace} n}. This lower bound matches, up to a constant factor, the upper bound of Brassard, Hyer, and Tapp [ACM SIGACT News, 28:14-19, 1997], which uses the quantum algorithm of Grover [Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 212-219, 1996] in a novel way. The previously best quantum lower bound is \Omega (({n \mathord{\left/ {\vphantom {n {r)^{{1 \mathord{\left/ {\vphantom {1 5}} \right. \kern-\nulldelimiterspace} 5}} }}} \right. \kern-\nulldelimiterspace} {r)^{{1 \mathord{\left/ {\vphantom {1 5}} \right. \kern-\nulldelimiterspace} 5}} }}) evaluations, due to Aaronson [Proceedings of the Thirty-Fourth Annual ACM Symposium on the Theory of Computing, pages 635-642, 2002]. Our result implies a quantum lower bound of \Omega (n^{{2 \mathord{\left/ {\vphantom {2 3}} \right. \kern-\nulldelimiterspace} 3}}) queries to the inputs for another well studied problem, the element distinctness problem, which is to determine whether or not the given n real numbers are distinct. The previous best lower bound is \Omega (\sqrt n ) queries in the black-box model; and \Omega (\sqrt n \log n) comparisons in the comparisons-only model, due to Hyer, Neerbek, and Shi [Lecture Notes in ComputerScience, Vol. 2076, pp. 346-357, 2001].