Sciweavers

7 search results - page 2 / 2
» Advice Coins for Classical and Quantum Computation
Sort
View
COCO
2005
Springer
110views Algorithms» more  COCO 2005»
15 years 3 months ago
Prior Entanglement, Message Compression and Privacy in Quantum Communication
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...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
COCO
2009
Springer
126views Algorithms» more  COCO 2009»
15 years 4 months ago
New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques
—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...
Rahul Jain, Hartmut Klauck