Matrix analysis
Theory of linear and integer programming
Theory of linear and integer programming
Perceptrons: expanded edition
On the degree of polynomials that approximate symmetric Boolean functions (preliminary version)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Communication complexity
Interaction in quantum communication and the complexity of set disjointness
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum lower bounds by polynomials
Journal of the ACM (JACM)
Improved Quantum Communication Complexity Bounds for Disjointness and Equality
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Communication Complexity Lower Bounds by Polynomials
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Lower Bounds for Quantum Communication Complexity
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
The Quantum Communication Complexity of Sampling
SIAM Journal on Computing
Quantum lower bounds for the collision and the element distinctness problems
Journal of the ACM (JACM)
Strengths and Weaknesses of Quantum Fingerprinting
CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
Separating AC0 from depth-2 majority circuits
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Lower bounds in communication complexity based on factorization norms
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On Computation and Communication with Small Bias
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Learning Complexity vs. Communication Complexity
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
A Direct Product Theorem for Discrepancy
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Improved Separations between Nondeterministic and Randomized Multiparty Communication
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Improved Separations between Nondeterministic and Randomized Multiparty Communication
ACM Transactions on Computation Theory (TOCT)
Complexity Lower Bounds using Linear Algebra
Foundations and Trends® in Theoretical Computer Science
On the Tightness of the Buhrman-Cleve-Wigderson Simulation
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A strong direct product theorem for disjointness
Proceedings of the forty-second ACM symposium on Theory of computing
Hardness amplification in proof complexity
Proceedings of the forty-second ACM symposium on Theory of computing
ACM SIGACT News
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
SIAM Journal on Computing
An optimal lower bound on the communication complexity of gap-hamming-distance
Proceedings of the forty-third annual ACM symposium on Theory of computing
Communication complexities of symmetric XOR functions
Quantum Information & Computation
Quantum communication complexity of block-composed functions
Quantum Information & Computation
A note on quantum algorithms and the minimal degree of ε-error polynomials for symmetric 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
The multiparty communication complexity of set disjointness
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The relationship between inner product and counting cycles
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
The NOF multiparty communication complexity of composed functions
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Hi-index | 0.00 |
In a breakthrough result, Razborov (2003) gave optimal lower bounds on the communication complexity of every function f of the form f(x,y)=D(|x AND y|) for some D:{0,1,...,n}-{0,1}, in the bounded-error quantum model with and without prior entanglement. This was proved by the multidimensional discrepancy method. We give an entirely different proof of Razborov's result, using the original, one-dimensional discrepancy method. This refutes the commonly held intuition (Razborov 2003) that the original discrepancy method fails for functions such as DISJOINTNESS. More importantly, our communication lower bounds hold for a much broader class of functions for which no methods were available. Namely, fix an arbitrary function f:{0,1}n/4-{0,1} and let A be the Boolean matrix whose columns are each an application of f to some subset of the variables x1,x2,...,xn. We prove that the communication complexity of A in the bounded-error quantum model with and without prior entanglement is Omega(d), where d is the approximate degree of f. From this result, Razborov's lower bounds follow easily. Our result also establishes a large new class of total Boolean functions whose quantum communication complexity (regardless of prior entanglement) is at best polynomially smaller than their classical complexity. Our proof method is a novel combination of two ingredients. The first is a certain equivalence of approximation and orthogonality in Euclidean n-space, which follows by linear-programming duality. The second is a new construction of suitably structured matrices with low spectral norm, the pattern matrices, which we realize using matrix analysis and the Fourier transform over (Z2)n. The method of this paper has recently inspired important progress in multiparty communication complexity.