Journal of Algorithms
Communication complexity
The BNS-chung criterion for multi-party communication complexity
Computational Complexity
Quantum computation and quantum information
Quantum computation and quantum information
Nondeterministic Quantum Query and Communication Complexities
SIAM Journal on Computing
Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity
COCO '00 Proceedings of the 15th Annual IEEE Conference on Computational Complexity
Communication Complexity Lower Bounds by Polynomials
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Lower Bounds on Quantum Multiparty Communication Complexity
CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
Tensor Decompositions and Applications
SIAM Review
Quantum multiparty communication complexity and circuit lower bounds
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Tensor-rank and lower bounds for arithmetic formulas
Proceedings of the forty-second ACM symposium on Theory of computing
Tensor Rank: Some Lower and Upper Bounds
CCC '11 Proceedings of the 2011 IEEE 26th Annual Conference on Computational Complexity
Quantum weakly nondeterministic communication complexity
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Hi-index | 0.00 |
In this paper we study quantum nondeterminism in multiparty communication. There are three (possibly) different types of nondeterminism in quantum computation: i) strong, ii) weak with classical proofs, and iii) weak with quantum proofs. Here we focus on the first one. A strong quantum nondeterministic protocol accepts a correct input with positive probability, and rejects an incorrect input with probability 1. In this work we relate strong quantum nondeterministic multiparty communication complexity to the rank of the communication tensor in the Number-On-Forehead and Number-In-Hand models. In particular, by extending the definition proposed by de Wolf to nondeterministic tensor-rank (nrank ), we show that for any boolean function f , 1) in the Number-On-Forehead model, the cost is upper-bounded by the logarithm of nrank (f ); 2) in the Number-In-Hand model, the cost is lower-bounded by the logarithm of nrank (f ). This naturally generalizes previous results in the field and relates for the first time the concept of (high-order) tensor rank to quantum communication. Furthermore, we show that strong quantum nondeterminism can be exponentially stronger than classical multiparty nondeterministic communication. We do so by applying our results to the matrix multiplication problem.