A Robust Semidefinite Programming Approach to the Separability Problem

Abstract

We express the optimization of entanglement witnesses for arbitrary bipartite states in terms of a class of convex optimization problems known as Robust Semidefinite Programs (RSDP). We propose, using well known properties of RSDP, several new sufficient tests for the separability of mixed states. Our results are then generalized to multipartite density operators.

Revised version (minor spell corrections) . 6 pages; submitted to Physical Review A

References in corpus (1)

• A complete family of separability criteria

Cited by in corpus (3)

• Quantifying Entanglement with Witness Operators
• Computing finite-dimensional bipartite quantum separability
• How to fool the GHZ and W witnesses