222 search results - page 9 / 45 » Lower Bounds on Quantum Multiparty Communication Complexity |
COCO
2004
Springer
14 years 24 days ago
2004
Springer
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
STOC
2006
ACM
14 years 7 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...
ECCC
2007
13 years 7 months ago
2007
CORR
2002
Springer
13 years 7 months ago
2002
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
STOC
2002
ACM
14 years 7 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...