Teresa Piovesan

Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone

We investigate the completely positive semidefinite cone

On the Closure of the Completely Positive Semidefinite Cone and Linear Approximations to Quantum Colorings

{\mathcal{CS}_{+}^n}

Entanglement-Assisted Zero-Error Source-Channel Coding

, a new matrix cone consisting of all

Multiparty Zero-Error Classical Channel Coding With Entanglement

n\times n

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

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 noncommutative polynomials. We use this new cone to model quantum analogues of the classical independence and chromatic graph parameters

Zero-error source-channel coding with entanglement

\alpha(G)

Round Elimination in Exact Communication Complexity

and

A continuation approach to the optimization of hydropower operations

\chi(G)

A continuation approach to nonlinear model predictive control of open channel systems

, which are roughly obtained by allowing variables to be positive semidefinite matrices instead of