Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
Mathematical Programming , Volume 170 - Issue 1 p. 5- 42
In this paper we study optimization problems related to bipartite quantum correlations using techniques from tracial noncommutative polynomial optimization. First we consider the problem of finding the minimal entanglement dimension of such correlations. We construct a hierarchy of semidefinite programming lower bounds and show convergence to a new parameter: the minimal average entanglement dimension, which measures the amount of entanglement needed to reproduce a quantum correlation when access to shared randomness is free. Then we study optimization problems over synchronous quantum correlations arising from quantum graph parameters. We introduce semidefinite programming hierarchies and unify existing bounds on quantum chromatic and quantum stability numbers by placing them in the framework of tracial polynomial optimization.
|Approximation Algorithms, Quantum Information and Semidefinite Optimization , Progress in quantum computing:Algorithms, communication, and applications
|Networks and Optimization
Gribling, S., de Laat, D., & Laurent, M. (2018). Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization. Mathematical Programming, 170(1), 5–42. doi:10.1007/s10107-018-1287-z