62 search results - page 3 / 13 » Quantum lower bound for the collision problem |
TOC
2010
13 years 14 days ago
2010
Abstract: We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of the adversary method, by analyzing the eigenspace structur...
IPL
2006
13 years 5 months ago
2006
At the heart of the Goldreich-Levin Theorem is the problem of determining an n-bit string a by making queries to two oracles, referred to as IP (inner product) and EQ (equivalence...
JC
2006
13 years 5 months ago
2006
FOCS
2006
IEEE
13 years 12 months ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
STOC
2006
ACM
14 years 6 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...