Quantum Communication Complexity
| dc.creator | Klauck, Hartmut | |
| dc.date | 2000-05-08 | |
| dc.date.accessioned | 2026-07-07T05:59:56Z | |
| dc.date.available | 2026-07-07T05:59:56Z | |
| dc.description | 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. | |
| dc.description | 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 | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0005032 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0005032 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/88870 | |
| dc.subject | Quantum Physics | |
| dc.title | Quantum Communication Complexity | |
| dc.type | text |