On the closure of the completely positive semidefinite cone and linear approximations to quantum colorings

DOI10.13001/1081-3810.3201zbMath1375.15049arXiv1502.02842OpenAlexW2963471460MaRDI QIDQ4594657

Teresa Piovesan, Sabine Burgdorf, Monique Laurent

Publication date: 24 November 2017

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

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

zbMATH Keywords

von Neumann algebrachromatic numberquantum entanglementquantum graph parameterscopositive conenonlocal gamestrace nonnegative polynomials

Mathematics Subject Classification ID

Semidefinite programming (90C22) Combinatorial optimization (90C27) Positive matrices and their generalizations; cones of matrices (15B48) Quantum coherence, entanglement, quantum correlations (81P40)

Related Items (5)

Separability of Hermitian tensors and PSD decompositions ⋮ Approximate completely positive semidefinite factorizations and their ranks ⋮ THE SET OF QUANTUM CORRELATIONS IS NOT CLOSED ⋮ Completely positive semidefinite rank ⋮ Lower bounds on matrix factorization ranks via noncommutative polynomial optimization

This page was built for publication: On the closure of the completely positive semidefinite cone and linear approximations to quantum colorings