Sciweavers

Share
COCO
2008
Springer

Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity

9 years 26 days 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 settings. For every k, we demonstrate a relational communication problem between k parties that can be solved exactly by a quantum simultaneous message passing protocol of cost O (log n) and requires protocols of cost nc/k2 , where c > 0 is a constant, in the classical non-interactive one-way message passing model with shared randomness and bounded error. Thus our separation of corresponding communication classes is superpolynomial as long as k = o log n log log n and exponential for k = O (1).
Dmitry Gavinsky, Pavel Pudlák
Added 18 Oct 2010
Updated 18 Oct 2010
Type Conference
Year 2008
Where COCO
Authors Dmitry Gavinsky, Pavel Pudlák
Comments (0)
books