QUIGS Seminar: The 2xM separability problem investigated via semidefinite programming and normal completions.

Hugo J. Woerdeman, Drexel University

This talk discusses two different viewpoints of the 2xM separablity problem. One method results in a construction of an increasing sequence of cones whose closed union consists of all 2xM separable states. Membership in each cone can be checked via semidefinite programming. The other approach links the separability problem to a question about normal completions of matrices, which in some special cases leads to simple new separability criteria.