Evaluation of relative entropy of entanglement and derivation of optimal Lewenstein-Sanpera decomposition of Bell decomposable states via convex optimization

Abstract

We provide an analytical expression for optimal Lewenstein-Sanpera decomposition of Bell decomposable states by using semi-definite programming. Also using the Karush-Kuhn-Tucker optimization method, the minimum relative entropy of entanglement of Bell decomposable states has been evaluated and it is shown that the same separable Bell decomposable state lying at the boundary of convex set of separable Bell decomposable states, optimizes both Lewenstein-Sanpera decomposition and relative entropy of entanglement. {\bf Keywords: Minimum relative entropy of entanglement, Semi-definite programming, Convex optimization, Lewenstein-Sanpera decomposition, Bell decomposable states.} {\bf PACs Index: 03.65.Ud}