8 search results - page 1 / 2 » Optimal Direct Sum and Privacy Trade-off Results for Quantum... |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
COCO
2005
Springer
13 years 10 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...
JACM
2006
13 years 4 months ago
2006
We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of...
COCO
2009
Springer
13 years 11 months ago
2009
Springer
—Consider the following Simultaneous Message Passing (SMP) model for computing a relation f ⊆ X ×Y ×Z. In this model Alice, on input x ∈ X and Bob, on input y ∈ Y, send o...
COCO
2004
Springer
13 years 8 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...