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

DOI10.13001/1081-3810.3201zbMATH Open1375.15049arXiv1502.02842OpenAlexW2963471460MaRDI QIDQ4594657FDOQ4594657

Authors: Sabine Burgdorf, Teresa Piovesan, Monique Laurent 

Publication date: 24 November 2017

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

Abstract: We investigate structural properties of the completely positive semidefinite cone $mathcal{CS}_{+}^n$, consisting of all the $nimesn$ symmetric matrices that admit a Gram representation by positive semidefinite matrices of any size. This cone has been introduced to model quantum graph parameters as conic optimization problems. Recently it has also been used to characterize the set $mathcalQ$ of bipartite quantum correlations, as projection of an affine section of it. We have two main results concerning the structure of the completely positive semidefinite cone, namely about its interior and about its closure. On the one hand we construct a hierarchy of polyhedral cones which covers the interior of $mathcal{CS}_{+}^n$, which we use for computing some variants of the quantum chromatic number by way of a linear program. On the other hand we give an explicit description of the closure of the completely positive semidefinite cone, by showing that it consists of all matrices admitting a Gram representation in the tracial ultraproduct of matrix algebras.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• scientific article; zbMATH DE number 6744339
• Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone
• Completely positive semidefinite rank
• Matrices with high completely positive semidefinite rank
• Quantum chromatic numbers via operator systems

zbMATH Keywords

chromatic numberquantum graph parametersvon Neumann algebraquantum entanglementcopositive conenonlocal gamestrace nonnegative polynomials

Mathematics Subject Classification ID

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

Cited In (10)

• Separability of Hermitian tensors and PSD decompositions
• On the longest chain of faces of the completely positive and copositive cones
• Completely positive semidefinite rank
• Approximate completely positive semidefinite factorizations and their ranks
• Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
• Title not available (Why is that?)
• Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone
• The set of quantum correlations is not closed
• The convex structure of the cone of \(N\)-fermion positive-semidefinite 1-particle operators
• Quantum no-signalling correlations and non-local games

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4594657)