Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alexeev, B., Forbes, M., Tsimerman, J.: Tensor rank: Some lower and upper bounds. In: Proceedings of the 26th Annual IEEE Conference on Computational Complexity (2011)
Buhrman, H., de Wolf, R.: Communication complexity lower bounds by polynomials. In: Proceedings of the 16th Annual IEEE Conference on Computational Complexity, pp. 120–130 (2001)
Gavinsky, D., Pudlák, P.: Exponential separation of quantum and classical non-interactive multi-party communication complexity. In: Proceedings of the 23rd IEEE Annual Conference on Computational Complexity, pp. 332–339 (2008)
Håstad, J.: Tensor rank is np-complete. Journal of Algorithms 11(4), 644–654 (1990)
Kerenidis, I.: Quantum Multiparty Communication Complexity and Circuit Lower Bounds. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol. 4484, pp. 306–317. Springer, Heidelberg (2007)
Kolda, T., Bader, B.: Tensor decompositions and applications. SIAM Review 51(3), 455–500 (2009)
Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press (1997)
Le Gall, F.: Quantum Weakly Nondeterministic Communication Complexity. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 658–669. Springer, Heidelberg (2006)
Lee, T., Schechtman, G., Shraibman, A.: Lower bounds on quantum multiparty communication complexity. In: Proceedings of the 24th IEEE Conference on Computational Complexity (2009)
Lee, T., Shraibman, A.: Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model. In: Proceedings of the 23rd IEEE Annual Conference on Computational Complexity (2008)
Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press (2000)
Raz, R.: The bns-chung criterion for multi-party communication complexity. Computational Complexity 9, 113–122 (2000)
Raz, R.: Tensor-rank and lower bounds for arithmetical formulas. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, pp. 659–666 (2010)
Villagra, M., Nakanishi, M., Yamashita, S., Nakashima, Y.: Tensor rank and strong quantum nondeterminism in multiparty communication. Tech. Rep. TR12-004, Electronic Colloqium on Computational Complexity (2012)
de Wolf, R.: Characterization of non-deterministic quantum query and quantum communication complexity. In: Proceedings of the 15th Annual IEEE Conference on Computational Complexity, pp. 271–278 (2000)
de Wolf, R.: Nondeterministic quantum query and quantum communication complexities. SIAM Journal on Computing 32(3), 681–699 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Villagra, M., Nakanishi, M., Yamashita, S., Nakashima, Y. (2012). Tensor Rank and Strong Quantum Nondeterminism in Multiparty Communication. In: Agrawal, M., Cooper, S.B., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2012. Lecture Notes in Computer Science, vol 7287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29952-0_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-29952-0_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29951-3
Online ISBN: 978-3-642-29952-0
eBook Packages: Computer ScienceComputer Science (R0)