Matrices with high completely positive semidefinite rank
arXiv:1605.00988 · doi:10.1016/j.laa.2016.10.015
Abstract
A real symmetric matrix is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size . The smallest such is called the (complex) completely positive semidefinite rank of , and it is an open question whether there exists an upper bound on this number as a function of the matrix size. We construct completely positive semidefinite matrices of size with complex completely positive semidefinite rank for any positive integer . This shows 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.
arXiv comment21 pages
References in corpus (7)
- Lifts of convex sets and cone factorizations
- Bounding the dimension of bipartite quantum systems
- Positive semidefinite rank
- New results on the cp rank and related properties of co(mpletely)positive matrices
- Lower bounds on the entanglement needed to play XOR non-local games
- Binary Constraint System Games and Locally Commutative Reductions
- Universal Rigidity of Complete Bipartite Graphs
Cited by in corpus (9)
- Algorithms for Positive Semidefinite Factorization
- Lifting for Simplicity: Concise Descriptions of Convex Sets
- Structure of the set of quantum correlators via semidefinite programming
- Completely positive semidefinite rank
- Universal Rigidity of Complete Bipartite Graphs
- Separability of Hermitian Tensors and PSD Decompositions
- Self-dual polyhedral cones and their slack matrices
- Exterior Point Method for Completely Positive Factorization
- Approximate Completely Positive Semidefinite Factorizations and their Ranks