Sciweavers

33 search results - page 3 / 7
» Unbounded-Error One-Way Classical and Quantum Communication ...
Sort
View
120
Voted
COCO
2008
Springer
108views Algorithms» more  COCO 2008»
15 years 5 months ago
Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity
We give the first exponential separation between quantum and classical multi-party communication complexity in the (non-interactive) one-way and simultaneous message passing setti...
Dmitry Gavinsky, Pavel Pudlák
104
Voted
CORR
2008
Springer
104views Education» more  CORR 2008»
15 years 3 months ago
New bounds on classical and quantum one-way communication complexity
In this paper we provide new bounds on classical and quantum distributional communication complexity in the two-party, one-way model of communication. In the classical one-way mode...
Rahul Jain, Shengyu Zhang
118
Voted
CORR
2010
Springer
185views Education» more  CORR 2010»
15 years 3 months ago
A new exponential separation between quantum and classical one-way communication complexity
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...
Ashley Montanaro
62
Voted
CORR
2008
Springer
69views Education» more  CORR 2008»
15 years 3 months ago
Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity
Rahul Jain, Pranab Sen, Jaikumar Radhakrishnan
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
15 years 8 months ago
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
Andris Ambainis, Ke Yang