Quantum multiparty communication complexity and circuit lower bounds

Authors:
Iordanis Kerenidis
Affiliations:
Cnrs, lri-université de paris-sud, paris, france email: jkeren@lri.fr
Venue:
Mathematical Structures in Computer Science
Year:
2009

Citing 17
Cited 0

Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs

Journal of Computer and System Sciences
The BNS lower bound for multi-party protocols is nearly optimal

Information and Computation
On ACC

Computational Complexity - Special issue on circuit complexity
Communication complexity

Communication complexity
Exponential separation of quantum and classical communication complexity

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
The BNS-chung criterion for multi-party communication complexity

Computational Complexity
Quantum computation and quantum information

Quantum computation and quantum information
Exponential lower bound for 2-query locally decodable codes via a quantum argument

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Multi-party protocols

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A Lattice Problem in Quantum NP

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Lower bounds for local search by quantum arguments

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Exponential separation of quantum and classical one-way communication complexity

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Lattice Problems in NP " coNP

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Exponential separations for one-way quantum communication complexity, with applications to cryptography

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
ON ACC and threshold circuits

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Improved lower bounds for locally decodable codes and private information retrieval

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Lower bounds on matrix rigidity via a quantum argument

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define a quantum model for multiparty communication complexity and prove a simulation theorem between the classical and quantum models. As a result, we show that if the quantum k-party communication complexity of a function f is Ω(n/2k), its classical k-party communication is Ω(n/2k/2). Finding such an f would allow us to prove strong classical lower bounds for k ≥ log n players and make progress towards solving a major open question about symmetric circuits.