Public vs. private coin flips in one round communication games (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Communication complexity
Exponential separation of quantum and classical communication complexity
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
Dense quantum coding and quantum finite automata
Journal of the ACM (JACM)
A linear lower bound on the unbounded error probabilistic communication complexity
Journal of Computer and System Sciences - Complexity 2001
Nondeterministic Quantum Query and Communication Complexities
SIAM Journal on Computing
On the power of quantum fingerprinting
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Randomized Simultaneous Messages: Solution Of A Problem Of Yao In Communication Complexity
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Communication Complexity Lower Bounds by Polynomials
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
A Class of Linear Positive Maps in Matrix Algebras
Open Systems & Information Dynamics
The Bloch-Vector Space for N-Level Systems: the Spherical-Coordinate Point of View
Open Systems & Information Dynamics
Bounded-error quantum state identification and exponential separations in communication complexity
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
Strengths and Weaknesses of Quantum Fingerprinting
CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Lower bounds in communication complexity based on factorization norms
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On Computation and Communication with Small Bias
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Lower Bounds for Quantum Communication Complexity
SIAM Journal on Computing
Geometrical realization of set systems and probabilistic communication complexity
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Complexity classes in communication complexity theory
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Probabilistic Communication Complexity
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Learning complexity vs communication complexity
Combinatorics, Probability and Computing
Unbounded-error one-way classical and quantum communication complexity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Unbounded-error quantum query complexity
Theoretical Computer Science
| Hi-index | 0.00 |
Since the seminal work of Paturi and Simon [26, FOCS'84 & JCSS'86], the unbounded-error classical communication complexity of a Boolean function has been studied based on the arrangement of points and hyperplanes. Recently, [14, ICALP'07] found that the unboundederror quantum communication complexity in the one-way communication model can also be investigated using the arrangement, and showed that it is exactly (without a difference of even one qubit) half of the classical one-way communication complexity. In this paper, we extend the arrangement argument to the two-way and simultaneous message passing (SMP) models. As a result, we show similarly tight bounds of the unbounded-error two-way/one-way/SMP quantum/classical communication complexities for any partial/total Boolean function, implying that all of them are equivalent up to a multiplicative constant of four. Moreover, the arrangement argument is also used to show that the gap between weakly unbounded-error quantum and classical communication complexities is at most a factor of three.