31 search results - page 5 / 7 » Unbounded-Error Classical and Quantum Communication Complexi... |
COCO
2005
Springer
14 years 16 days 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...
COCO
2005
Springer
14 years 16 days ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
STOC
2006
ACM
14 years 7 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 ...
COCO
2008
Springer
13 years 8 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...