A lower bound on entanglement-assisted quantum communication complexity
Quantum Physics
2011-11-09 v2
Abstract
We prove a general lower bound on the bounded-error entanglement-assisted quantum communication complexity of Boolean functions. The bound is based on the concept that any classical or quantum protocol to evaluate a function on distributed inputs can be turned into a quantum communication protocol. As an application of this bound, we give a very simple proof of the statement that almost all Boolean functions on n+n bits have linear communication complexity, even in the presence of unlimited entanglement.
Cite
@article{arxiv.quant-ph/0610085,
title = {A lower bound on entanglement-assisted quantum communication complexity},
author = {Ashley Montanaro and Andreas Winter},
journal= {arXiv preprint arXiv:quant-ph/0610085},
year = {2011}
}
Comments
10 pages; v2 adds references and fixes typos