Bounding the separable rank via polynomial optimization
Linear Algebra and its Applications , Volume 648 p. 1- 55
We investigate questions related to the set SEPd consisting of the linear maps ρ acting on Cd⊗Cd that can be written as a convex combination of rank one matrices of the form xx∗⊗yy∗. Such maps are known in quantum information theory as the separable bipartite states, while nonseparable states are called entangled. In particular we introduce bounds for the separable rank ranksep(ρ), defined as the smallest number of rank one states xx∗⊗yy∗ entering the decomposition of a separable state ρ. Our approach relies on the moment method and yields a hierarchy of semidefinite-based lower bounds, that converges to a parameter τsep(ρ), a natural convexification of the combinatorial parameter ranksep(ρ). A distinguishing feature is exploiting the positivity constraint ρ −xx∗⊗yy∗ 0 to impose positivity of a polynomial matrix localizing map, the dual notion of the notion of sum-of-squares polynomial matrices. Our approach extends naturally to the multipartite setting and to the real separable rank, and it permits strengthening some known bounds for the completely positive rank. In addition, we indicate how the moment approach also applies to define hierarchies of semidefinite relaxations for the set SEPd and permits to give new proofs, using only tools from moment theory, for convergence results on the DPS hierarchy from Doherty et al. (2002) .
|, , , , ,|
|Linear Algebra and its Applications|
|Polynomial Optimization, Efficiency through Moments and Algebra|
|Organisation||Networks and Optimization|
Gribling, S.J, Laurent, M, & Steenkamp, J.A.J. (2022). Bounding the separable rank via polynomial optimization. Linear Algebra and its Applications, 648, 1–55. doi:10.1016/j.laa.2022.04.010