Exécution de notre outil de synthèse sur un nouvel article
Vérifiez l’article ci-dessous, puis lancez sa synthèse.
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
Licence : non indiquée (tous droits réservés)
Résumé : 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.
Soumis à arXiv le 08 Mai. 2000