Approximate completely positive semidefinite factorizations and their ranks

DOI10.1016/j.laa.2023.08.005zbMath1527.15008arXiv2012.06471OpenAlexW4386074712MaRDI QIDQ6051147

Andreas Klingler, Tim Netzer, Paria Abbasi

Publication date: 19 September 2023

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

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

zbMATH Keywords

completely positiveapproximate rankapproximate Carathéodory theoremJohnson-Lindenstrauss lemmacompletely positive semidefinite

Mathematics Subject Classification ID

Factorization of matrices (15A23) Positive matrices and their generalizations; cones of matrices (15B48) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrices with high completely positive semidefinite rank
• On vector configurations that can be realized in the cone of positive matrices
• Linear conic formulations for two-party correlations and values of nonlocal games
• Positive semidefinite rank
• Non-closure of the set of quantum correlations via graphs
• Completely positive semidefinite rank
• On the cp-Rank and Minimal cp Factorizations of a Completely Positive Matrix
• 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
• On the Matrix Equation X′X = A
• On the closure of the completely positive semidefinite cone and linear approximations to quantum colorings
• THE SET OF QUANTUM CORRELATIONS IS NOT CLOSED
• Why Are Big Data Matrices Approximately Low Rank?
• Theorems of Carathéodory, Helly, and Tverberg without dimension

This page was built for publication: Approximate completely positive semidefinite factorizations and their ranks