235 search results - page 16 / 47 » Quantum certificate complexity |
110
Voted
TCS
2002
15 years 1 months ago
2002
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
152
click to vote
COCO
2005
Springer
15 years 7 months ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
114
Voted
CC
2010
Springer
14 years 11 months ago
2010
Springer
We describe a randomized algorithm that, given an integer a, produces a certificate that the integer is not a pure power of an integer in expected (log a)1+o(1) bit operations unde...
115
click to vote
STOC
2004
ACM
16 years 2 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
116
Voted
STOC
2006
ACM
16 years 2 months ago
2006
ACM
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...