A Caltech Library Service

Robust semidefinite programming approach to the separability problem

Brandão, Fernando G. S. L. and Vianna, Reinaldo O. (2004) Robust semidefinite programming approach to the separability problem. Physical Review A, 70 (6). Art. No. 062309. ISSN 1050-2947. doi:10.1103/PhysRevA.70.062309.

[img] PDF - Published Version
See Usage Policy.

[img] PDF - Submitted Version
See Usage Policy.


Use this Persistent URL to link to this item:


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 (RSDPs). We propose, using well known properties of RSDPs, several sufficient tests for separability of mixed states. Our results are then generalized to multipartite density operators.

Item Type:Article
Related URLs:
URLURL TypeDescription Paper
Brandão, Fernando G. S. L.0000-0003-3866-9378
Additional Information:© 2004 The American Physical Society. Received 4 May 2004; published 9 December 2004. Financial support from the Brazilian agencies CNPq, Institutos do Milênio-Informação Quântica, and FAPEMIG is acknowledged.
Funding AgencyGrant Number
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)UNSPECIFIED
Institutos do Milênio-Informação QuânticaUNSPECIFIED
Fundaçã de Amparo a Pesquisa de Minas Gerais (FAPEMIG)UNSPECIFIED
Issue or Number:6
Classification Code:PACS: 03.67.Mn
Record Number:CaltechAUTHORS:20160524-110104407
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:67305
Deposited By: Tony Diaz
Deposited On:24 May 2016 18:27
Last Modified:11 Nov 2021 00:30

Repository Staff Only: item control page