A Robust Semidefinite Programming Approach to the Separability Problem

Details A Robust Semidefinite Programming Approach to the Separability Problem A Robust Semidefinite Programming Approach to the Separability Problem

2004-05-03

arxiv.org/abs/quant-ph/0405008v2

Phys. Rev. A 70, 062309 (2004)

Physics

Quantum Physics

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

Scientific paper

10.1103/PhysRevA.70.062309

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.

Affiliated with

Also associated with

No associations

Rating

A Robust Semidefinite Programming Approach to the Separability Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Robust Semidefinite Programming Approach to the Separability Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Robust Semidefinite Programming Approach to the Separability Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-235358