2007 | OriginalPaper | Chapter
A Lower Bound on Entanglement-Assisted Quantum Communication Complexity
Authors : Ashley Montanaro, Andreas Winter
Published in: Automata, Languages and Programming
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.