On the distributional complexity of disjointness
Theoretical Computer Science
Communication complexity
Quantum vs. classical communication and computation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Exponential separation of quantum and classical communication complexity
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Exponential separation of quantum and classical one-way communication complexity
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Complexity classes in communication complexity theory
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Quantum one-way communication can be exponentially stronger than classical communication
Proceedings of the forty-third annual ACM symposium on Theory of computing
On quantum-classical equivalence for composed communication problems
Quantum Information & Computation
On the power of lower bound methods for one-way quantum communication complexity
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Quantum weakly nondeterministic communication complexity
Theoretical Computer Science
| Hi-index | 0.00 |
We demonstrate a two-player communication problem that can be solved in the one-way quantum model by a 0-error protocol of cost O(log n) but requires exponentially more communication in the classical interactive (bounded error) model.