Exact calculation of robustness of entanglement via convex semi-definite programming

Details Exact calculation of robustness of entanglement via convex semi-definite programming Exact calculation of robustness of entanglement via convex semi-definite programming

2006-08-29

arxiv.org/abs/quant-ph/0608225v1

International Journal of Quantum Information (IJQI) vol3, no 3 (2005) 511-533

Physics

Quantum Physics

33 pages 3 figures

Scientific paper

In general the calculation of robustness of entanglement for the mixed entangled quantum states is rather difficult to handle analytically. Using the the convex semi-definite programming method, the robustness of entanglement of some mixed entangled quantum states such as: $2\otimes 2$ Bell decomposable (BD) states, a generic two qubit state in Wootters basis, iso-concurrence decomposable states, $2\otimes 3$ Bell decomposable states, $d\otimes d$ Werner and isotropic states, a one parameter $3\otimes 3$ state and finally multi partite isotropic state, is calculated exactly, where thus obtained results are in agreement with those of :$2\otimes 2$ density matrices, already calculated by one of the authors in \cite{Bell1,Rob3}. Also an analytic expression is given for separable states that wipe out all entanglement and it is further shown that they are on the boundary of separable states as pointed out in \cite{du}. {\bf Keywords: Robustness of entanglement, Semi-definite programming, Bell decomposable states, Werner and isotropic states.}

Affiliated with

Also associated with

No associations

Rating

Exact calculation of robustness of entanglement via convex semi-definite programming 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 Exact calculation of robustness of entanglement via convex semi-definite programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exact calculation of robustness of entanglement via convex semi-definite programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-333926