Sciweavers

25 search results - page 4 / 5
» A new exponential separation between quantum and classical o...
Sort
View
STOC
2001
ACM
129views Algorithms» more  STOC 2001»
14 years 7 months ago
Interaction in quantum communication and the complexity of set disjointness
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...
Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David...
CORR
2006
Springer
97views Education» more  CORR 2006»
13 years 6 months ago
The one-way communication complexity of the Boolean Hidden Matching Problem
We give a tight lower bound of ( n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communica...
Iordanis Kerenidis, Ran Raz
COCO
2009
Springer
126views Algorithms» more  COCO 2009»
14 years 1 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
TCC
2007
Springer
104views Cryptology» more  TCC 2007»
14 years 24 days ago
Unifying Classical and Quantum Key Distillation
Assume that two distant parties, Alice and Bob, as well as an adversary, Eve, have access to (quantum) systems prepared jointly according to a tripartite state ρABE. In addition, ...
Matthias Christandl, Artur Ekert, Michal Horodecki...
COCO
2005
Springer
110views Algorithms» more  COCO 2005»
14 years 7 days 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