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 communication complexity linear in n, even in the presence of unlimited entanglement. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Montanaro, A., & Winter, A. (2007). A lower bound on entanglement-assisted quantum communication complexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4596 LNCS, pp. 122–133). Springer Verlag. https://doi.org/10.1007/978-3-540-73420-8_13
Mendeley helps you to discover research relevant for your work.