Matrices with high completely positive semidefinite rank

DOI10.1016/j.laa.2016.10.015zbMath1349.15091arXiv1605.00988OpenAlexW2345805953MaRDI QIDQ344893

David de Laat, Monique Laurent, Sander Gribling

Publication date: 25 November 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.00988

zbMATH Keywords

Hadamard matricesClifford algebrasquantum correlationsmatrix factorizationcompletely positive semidefinite cone

Mathematics Subject Classification ID

Factorization of matrices (15A23) Semidefinite programming (90C22) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items

Separability of Hermitian tensors and PSD decompositions, Lifting for Simplicity: Concise Descriptions of Convex Sets, Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization, Approximate completely positive semidefinite factorizations and their ranks, Self-Dual Polyhedral Cones and Their Slack Matrices, Correlation matrices, Clifford algebras, and completely positive semidefinite rank, Universal rigidity of complete bipartite graphs, Completely positive semidefinite rank, Algorithms for positive semidefinite factorization, Lower bounds on matrix factorization ranks via noncommutative polynomial optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conic formulations of graph homomorphisms
• From seven to eleven: completely positive matrices with high cp-rank
• On vector configurations that can be realized in the cone of positive matrices
• Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope
• Positive semidefinite rank
• Expressing combinatorial optimization problems by linear programs
• Extremal bipartite matrices
• Quantum analogues of the Bell inequalities. The case of two spatially separated domains
• Positive semidefinite matrix completion, universal rigidity and the strong Arnold property
• Lie groups. An approach through invariants and representations
• Approximation of the Stability Number of a Graph via Copositive Programming
• Lower bounds on the entanglement needed to play XOR non-local games
• New results on the cp-rank and related properties of co(mpletely )positive matrices
• New Lower Bounds and Asymptotics for the cp-Rank
• Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone
• A Note on Extreme Correlation Matrices
• Completely positive matrices associated withM-matrices
• Lifts of Convex Sets and Cone Factorizations