Communication complexity
Lower Bounds for Quantum Communication Complexity
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Strengths and Weaknesses of Quantum Fingerprinting
CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
Complexity measures of sign matrices
Combinatorica
The pattern matrix method for lower bounds on quantum communication
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Towards computing the Grothendieck constant
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Learning complexity vs communication complexity
Combinatorics, Probability and Computing
Complexity Lower Bounds using Linear Algebra
Foundations and Trends® in Theoretical Computer Science
Unbounded-error classical and quantum communication complexity
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
The positive semidefinite Grothendieck problem with rank constraint
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Better gap-hamming lower bounds via better round elimination
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
An optimal lower bound on the communication complexity of gap-hamming-distance
Proceedings of the forty-third annual ACM symposium on Theory of computing
Quantum communication complexity of block-composed functions
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
A lower bound on entanglement-assisted quantum communication complexity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Multipartite entanglement in XOR games
Quantum Information & Computation
Hi-index | 0.00 |
We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory. This approach gives us access toseveral powerful tools from this area such as normed spaces duality and Grothendiek's inequality. This extends the arsenal of methods for deriving lower bounds in communication complexity. As we show,our method subsumes most of the previously known general approaches to lower bounds on communication complexity. Moreover, we extend all (but one) of these lower bounds to the realm of quantum communication complexity with entanglement. Our results also shed some light on the question how much communication can be saved by using entanglement.It is known that entanglement can save one of every two qubits, and examples for which this is tight are also known. It follows from our results that this bound on the saving in communication is tight almost always.