Euclidean Distance Matrices and Separations in Communication Complexity Theory

Article

Abstract

A Euclidean distance matrix \(D(\alpha )\) is defined by \(D_{ij}=(\alpha _i-\alpha _j)^2\), where \(\alpha =(\alpha _1,\ldots ,\alpha _n)\) is a real vector. We prove that \(D(\alpha )\) cannot be written as a sum of \(\left[ 2\sqrt{n}-2\right] \) nonnegative rank-one matrices, provided that the coordinates of \(\alpha \) are algebraically independent. As a corollary, we provide an asymptotically optimal separation between the complexities of quantum and classical communication protocols computing a given matrix in expectation.

Keywords

Nonnegative matrix factorization Extended formulations of polytopes Positive semidefinite rank Communication complexity 

Mathematics Subject Classification

15A23 52B12 81P45 

Notes

Acknowledgements

I would like to thank Troy Lee for pointing my attention to this problem and helpful comments. I am also grateful to the editor János Pach for handling my paper and to anonymous referees for helpful comments and suggestions, which allowed me to improve the presentation of my results. The article was prepared within the framework of the Academic Fund Program at the National Research University Higher School of Economics (HSE) in 2017–2018 (Grant No. 17-01-0049) and by the ‘Russian Academic Excellence Project 5-100’.

References

  1. 1.
    Beasley, L.B., Laffey, T.J.: Real rank versus nonnegative rank. Linear Algebra Appl. 431, 2330–2335 (2009)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Braun, G., Fiorini, S., Pokutta, S., Steurer, D.: Approximation limits of linear programs (beyond hierarchies). Math. Oper. Res. 40(3), 756–772 (2015)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Cohen, J.E., Rothblum, U.G.: Nonnegative ranks, decompositions, and factorizations of nonnegative matrices. Linear Algebra Appl. 190, 149–168 (1993)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Faenza, Y., Fiorini, S., Grappe, R., Tiwary, H.R.: Extended formulations, nonnegative factorizations, and randomized communication protocols. Math. Program. 153(1), 75–94 (2015)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Fawzi, H., Gouveia, J., Parrilo, P.A., Robinson, R.Z., Thomas, R.R.: Positive semidefinite rank. Math. Program. 153(1), 133–177 (2015)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Fiorini, S., Massar, S., Pokutta, S., Tiwary, H.R., de Wolf, R.: Exponential lower bounds for polytopes in combinatorial optimization. J. ACM 62(2) (2015). Art. No. 17Google Scholar
  7. 7.
    Fiorini, S., Rothvoß, T., Tiwary, H.R.: Extended formulations for polygons. Discrete Comput. Geom. 48(3), 658–668 (2012)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Gillis, N., Glineur, F.: On the geometric interpretation of the nonnegative rank. Linear Algebra Appl. 437(11), 2685–2712 (2012)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Gouveia, J., Pashkovich, K., Robinson, R.R., Thomas, R.R.: Four dimensional polytopes of minimum positive semidefinite rank. J. Comb. Theory A 145, 184–226 (2017)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Hrubeš, P.: On the nonnegative rank of distance matrices. Inf. Process. Lett. 112(11), 457–461 (2012)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Jain, R., Shi, Y., Wei, Z., Zhang, S.: Efficient protocols for generating bipartite classical distributions and quantum states. IEEE Trans. Inf. Theory 59(8), 5171–5178 (2013)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Kubjas, K., Robeva, E., Sturmfels, B.: Fixed points of the EM algorithm and nonnegative rank boundaries. Ann. Stat. 43(1), 422–461 (2015)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)CrossRefMATHGoogle Scholar
  14. 14.
    Lee, D.D., Seung, S.H.: Learning the parts of objects by non-negative matrix factorization. Nature 401, 788–791 (1999)CrossRefMATHGoogle Scholar
  15. 15.
    Lee, T., Zhaohui, W., de Wolf, R.: Some upper and lower bounds on PSD-rank. Math. Program. 162(1–2), 495–521 (2017)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Padrol, A.: Extension complexity of polytopes with few vertices or facets. SIAM J. Discrete Math. 30(4), 2162–2176 (2016)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Padrol, A., Pfeifle, J.: Polygons as sections of higher-dimensional polytopes. Electron. J. Comb. 22(1) (2015). Art. No. 24Google Scholar
  18. 18.
    Pashkovich, K.: Extended Formulations for Combinatorial Polytopes. PhD thesis, Magdeburg Universität (2012)Google Scholar
  19. 19.
    Shitov, Ya.: An upper bound for nonnegative rank. J. Comb. Theory Ser. A 122, 126–132 (2014)MathSciNetCrossRefMATHGoogle Scholar
  20. 20.
    Shitov, Ya.: Sublinear extensions of polygons (2014). arXiv:1412.0728
  21. 21.
    Yannakakis, M.: Expressing combinatorial optimization problems by linear programs. J. Comput. Syst. Sci. 43(3), 441–466 (1991)MathSciNetCrossRefMATHGoogle Scholar
  22. 22.
    Zhang, S.: Quantum strategic game theory. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (ITCS’12), pp. 39–59. ACM, New York (2012)Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.National Research University — Higher School of EconomicsMoscowRussia

Personalised recommendations