Theory of Quantum Information and Computation: Hugo J. Woerdeman
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 separability 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.