Published December 2004
| Version Published + Submitted
Journal Article
Open
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 (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.
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.Attached Files
Published - PhysRevA.70.062309.pdf
Submitted - 0405008v2.pdf
Files
0405008v2.pdf
Additional details
Identifiers
- Eprint ID
- 67305
- Resolver ID
- CaltechAUTHORS:20160524-110104407
Related works
- Describes
- http://arxiv.org/abs/quant-ph/0405008 (URL)
Funding
- Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
- Institutos do Milênio-Informação Quântica
- Fundaçã de Amparo a Pesquisa de Minas Gerais (FAPEMIG)
Dates
- Created
-
2016-05-24Created from EPrint's datestamp field
- Updated
-
2021-11-11Created from EPrint's last_modified field