Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone

Monique Laurent, Teresa Piovesan

Research output: Contribution to journalArticleScientificpeer-review

22 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)2461-2493
JournalSIAM Journal on Optimization
Volume25
Issue number4
DOIs
Publication statusPublished - 2015

Keywords

  • quantum graph parameters
  • trace positive polynomials
  • copositive cone
  • chromatic number
  • quantum entanglement
  • nonlocal games

Fingerprint Dive into the research topics of 'Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone'. Together they form a unique fingerprint.

Cite this