A Robust Semidefinite Programming Approach to the Separability Problem

Simple item page
dc.creatorBrandao, Fernando. G. S. L.
dc.creatorVianna, Reinaldo O.
dc.date2004-05-03
dc.date2004-07-23
dc.date.accessioned2026-07-07T06:22:36Z
dc.date.available2026-07-07T06:22:36Z
dc.descriptionWe 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.
dc.descriptionRevised version (minor spell corrections) . 6 pages; submitted to Physical Review A
dc.identifierhttps://arxiv.org/abs/quant-ph/0405008
dc.identifierhttp://arxiv.org/abs/quant-ph/0405008
dc.identifierPhys. Rev. A 70, 062309 (2004)
dc.identifierdoi:10.1103/PhysRevA.70.062309
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/95954
dc.subjectQuantum Physics
dc.titleA Robust Semidefinite Programming Approach to the Separability Problem
dc.typetext

Files

Collections

arXiv