A Robust Semidefinite Programming Approach to the Separability Problem

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Quantum Physics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/95954

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/quant-ph/0405008
 http://arxiv.org/abs/quant-ph/0405008
 Phys. Rev. A 70, 062309 (2004)
 doi:10.1103/PhysRevA.70.062309

Collections

arXiv