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

Authors:
Dmitry Gavinsky;Pavel Pudlák
Affiliations:
-;-
Venue:
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Year:
2008

Citing 0
Cited 4

Can quantum mechanics help distributed computing?

ACM SIGACT News
On quantum-classical equivalence for composed communication problems

Quantum Information & Computation
On the power of lower bound methods for one-way quantum communication complexity

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Tensor rank and strong quantum nondeterminism in multiparty communication

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.