A Lower Bound on Entanglement-Assisted Quantum Communication Complexity

  • Ashley Montanaro
  • Andreas Winter
Conference paper

DOI: 10.1007/978-3-540-73420-8_13

Volume 4596 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Montanaro A., Winter A. (2007) A Lower Bound on Entanglement-Assisted Quantum Communication Complexity. In: Arge L., Cachin C., Jurdziński T., Tarlecki A. (eds) Automata, Languages and Programming. ICALP 2007. Lecture Notes in Computer Science, vol 4596. Springer, Berlin, Heidelberg

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 communication complexity linear in n, even in the presence of unlimited entanglement.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Ashley Montanaro
    • 1
  • Andreas Winter
    • 2
  1. 1.Department of Computer Science, University of Bristol, Bristol, BS8 1UB, U.K 
  2. 2.Department of Mathematics, University of Bristol, Bristol, BS8 1TW, U.K