Running summarizing tools on a new article
Check the paper below, then start its synthesis.
Quantum Communication Complexity
Hartmut Klauck
arXiv: quant-ph/0005032v1 (quant-ph)
11 pages, LaTeX, to appear in: Workshop Proceedings of the 27th International Colloquium on Automata, Languages and Programming 2000, Workshop on Boolean Functions and Applications
License: not stated (all rights reserved)
Abstract: This paper surveys the field of quantum communication complexity. Some interesting recent results are collected concerning relations to classical communication, lower bound methods, one-way communication, and applications of quantum communication complexity.
Submitted to arXiv on 08 May. 2000