61 search results - page 2 / 13 » Multi-party Quantum Communication Complexity with Routed Mes... |
ICALP
2003
Springer
13 years 10 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
COCO
2004
Springer
13 years 9 months ago
2004
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
2001
ACM
14 years 5 months ago
2001
ACM
One of the most intriguing facts about communication using quantum states is that these states cannot be used to transmit more classical bits than the number of qubits used, yet i...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
We study the simultaneous message passing model of communication complexity. Building on the quantum fingerprinting protocol of Buhrman et al., Yao recently showed that a large cl...
STOC
2004
ACM
14 years 5 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...