Matrices With High Completely Positive Semidefinite Rank

David de Laat, Sander Gribling , Monique Laurent

Research output: Working paperOther research output

Abstract

A real symmetric matrix M is completely positive semidefinite if it admits a Gram representation by positive semidefinite matrices (of any size d ). The smallest such d is called the completely positive semidefinite rank of M , and it is an open question whether there exists an upper bound on this number as a function of the matrix size. We show that if such an upper bound exists, it has to be at least exponential in the matrix size. For this we exploit connections to quantum information theory and we construct extremal bipartite correlation matrices of large rank. We also exhibit a class of completely positive matrices with quadratic (in terms of the matrix size) completely positive rank, but with linear completely positive semidefinite rank, and we make a connection to the existence of Hadamard matrices.
Original languageEnglish
Place of PublicationIthaca
PublisherCornell University Library
Number of pages17
Publication statusPublished - 3 May 2016

Publication series

NamearXiv
Volume1605.00988

Fingerprint Dive into the research topics of 'Matrices With High Completely Positive Semidefinite Rank'. Together they form a unique fingerprint.

  • Cite this

    de Laat, D., Gribling , S., & Laurent, M. (2016). Matrices With High Completely Positive Semidefinite Rank. (arXiv; Vol. 1605.00988). Cornell University Library. http://arxiv.org/abs/1605.00988