BEST SEPARABLE APPROXIMATION WITH SEMI-DEFINITE PROGRAMMING METHOD

From MaRDI portal



Abstract: 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, 2otimes3 Bell decomposable state, dotimesd Werner and isotropic states, a one parameter 3otimes3 state and finally multi partite isotropic state.












This page was built for publication: BEST SEPARABLE APPROXIMATION WITH SEMI-DEFINITE PROGRAMMING METHOD

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4659847)