Best separable approximation with semi-definite programming method

Details Best separable approximation with semi-definite programming method Best separable approximation with semi-definite programming method

2006-06-08

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

Physics

Quantum Physics

23 pages

Scientific paper

The present methods for obtaining the optimal Lewenestein- Sanpera decomposition of a mixed state are difficult to handle analytically. We provide a simple analytical expression for the optimal Lewenstein-Sanpera decomposition by using semidefinite programming. Specially, we obtain the optimal Lewenstein-Sanpera decomposition for some examples such as: Bell decomposable state, Iso-concurrence state, generic two qubit state in Wootters's basis, $2\otimes 3$ Bell decomposable state, $d\otimes d$ Werner and isotropic states, a one parameter $3\otimes 3$ state and finally multi partite isotropic state.

Affiliated with

Also associated with

No associations

Rating

Best separable approximation with semi-definite programming method 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 Best separable approximation with semi-definite programming method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Best separable approximation with semi-definite programming method will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-507621