Communication Complexity Lower Bounds by Polynomials
<|reference_start|>Communication Complexity Lower Bounds by Polynomials: The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPR-pairs). Some lower bound techniques are available for qubit communication complexity, but except for the inner product function, no bounds are known for the model with unlimited prior entanglement. We show that the log-rank lower bound extends to the strongest model (qubit communication + unlimited prior entanglement). By relating the rank of the communication matrix to properties of polynomials, we are able to derive some strong bounds for exact protocols. In particular, we prove both the "log-rank conjecture" and the polynomial equivalence of quantum and classical communication complexity for various classes of functions. We also derive some weaker bounds for bounded-error quantum protocols.<|reference_end|>
@article{buhrman1999communication,
    title={Communication Complexity Lower Bounds by Polynomials},
    author={Harry Buhrman (CWI, Amsterdam) and Ronald de Wolf (CWI and U of
  Amsterdam)},
    journal={arXiv preprint arXiv:cs/9910010},
    year={1999},
    archivePrefix={arXiv},
    eprint={cs/9910010},
    primaryClass={cs.CC quant-ph}
}