On quantum and probabilistic communication: Las Vegas and one-way protocols
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Quantum communication and complexity
Theoretical Computer Science - Natural computing
Parallel Attribute-Efficient Learning of Monotone Boolean Functions
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Improved Quantum Communication Complexity Bounds for Disjointness and Equality
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On parallel attribute-efficient learning
Journal of Computer and System Sciences
What can be observed locally? round-based models for quantum distributed computing
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Scalable quantum consensus for crash failures
DISC'10 Proceedings of the 24th international conference on Distributed computing
| Hi-index | 0.00 |
Classical communication complexity has been intensively studied since its conception two decades ago. Recently, its quantum analogue, the quantum communication complexity model, was defined and studied. In this paper we present some of the main results in the area.