Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone
Laurent,Monique Piovesan,Teresa
Laurent,Monique
Piovesan,Teresa
Abstract
We investigate the completely positive semidefinite cone CSn+, a new matrix cone consisting of all n×n matrices that admit a Gram representation by positive semidefinite matrices (of any size). In particular, we study relationships between this cone and the completely positive and the doubly nonnegative cone, and between its dual cone and trace positive non-commutative polynomials. We use this new cone to model quantum analogues of the classical independence and chromatic graph parameters α(G) and χ(G), which are roughly obtained by allowing variables to be positive semidefinite matrices instead of 0/1 scalars in the programs defining the classical parameters. We can formulate these quantum parameters as conic linear programs over the cone CSn+. Using this conic approach we can recover the bounds in terms of the theta number and define further approximations by exploiting the link to trace positive polynomials.
Description
Date
2015
Journal Title
Journal ISSN
Volume Title
Publisher
Research Projects
Organizational Units
Journal Issue
Keywords
quantum graph parameters, trace positive polynomials, copositive cone, chromatic number, quantum entanglement, nonlocal games
Citation
Laurent, M & Piovesan, T 2015, 'Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone', SIAM Journal on Optimization, vol. 25, no. 4, pp. 2461-2493. https://doi.org/10.1137/14097865X