Lewenstein-Sanpera decomposition For Bell Decomposable

S. J. Akhtarshenas, M. A. Jafarizadeh

备注：: 14 pages, Latex

英文摘要：

We propose a simple geometrical approach for finding the Lewenstein-Sanpera decomposition of Bell decomposable states of 2 otimes 2 quantum systems. We show that in these systems, the weight of the pure entangled part in the decomposition is equal to the concurrence of the state. It is also shown that the optimized separable part of L-S decomposition minimizes the von Neumann relative entropy. We also obtain the decomposition for a class of mixed states by using some LQCC actions. It is also shown that for these states the average concurrence of L-S decomposition is equal to their concurrence.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Remarks on Lewenstein-Sanpera Decomposition

We discuss in this letter Lewenstein-Sanpera (L-S) decomposition for a specific Werner state. Compared with the optimal case, we propose a quasi-optimal one which in the view of concurrence leads to the same entanglement measure for the entangled mixed state discussed. We think that in order to obtain entanglement of given state the optimal L-S decomposition is not necessary.

2000-12-28quant-ph

Lewenstein-Sanpera Decomposition for $2\otimes 2$ Systems

As it is well known, every bipartite $2\otimes 2$ density matrix can be obtained from Bell decomposable states via local quantum operations and classical communications (LQCC). Using this fact, the Lewenstein-Sanpera decomposition of an arbitrary bipartite $2\otimes 2$ density matrix has been obtained through LQCC action upon Lewenstein-Sanpera decomposition of Bell decomposable states of $2\otimes 2$ quantum systems, where the product states introduced by Wootters in [W. K. Wootters, Phys. Rev. Lett. {\bf 80} 2245 (1998)] form the best separable approximation ensemble for Bell decomposable st…

2002-09-05quant-ph

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

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,…

2006-08-29quant-ph

Lewenstein-Sanpera Decomposition for Iso-concurrence Decomposable States

We obtain Lewenstein-Sanpera decomposition of iso-concurrence decomposable states of $2\otimes 2$ quantum systems. It is shown that in these systems average concurrence of the decomposition is equal to the concurrence of the state and also it is equal to the amount of violation of positive partial transpose criterion. It is also shown that the product states introduced by Wootters in [W. K. Wootters, Phys. Rev. Lett. {\bf 80} 2245 (1998)] form the best separable approximation ensemble for these states.

2002-08-22quant-ph

Optimal Lewenstein-Sanpera decomposition of two-qubit states using Semidefinite Programming

We use the language of semidefinite programming and duality to derive necessary and sufficient conditions for the optimal Lewenstein-Sanpera Decomposition (LSD) of 2-qubit states. We first provide a simple and natural derivation of the Wellens-Kus equations for full-rank states. Then, we obtain a set of necessary and sufficient conditions for the optimal decomposition of rank-3 states. This closes the gap between the full-rank case, where optimality conditions are given by the Wellens-Kus equations, and the rank-2 case, where the optimal decomposition is analytically known. We also give an ana…

2009-09-25quant-ph

Lewenstein-Sanpera decomposition of a generic 2x2 density matrix by using Wootters's basis

The Lewenstein-Sanpera decomposition for a generic two-qubit density matrix is obtained by using Wootters's basis. It is shown that the average concurrence of the decomposition is equal to the concurrence of the state. It is also shown that all the entanglement content of the state is concentrated in the Wootters's state $|x_1>$ associated with the largest eigenvalue $λ_1$ of the Hermitian matrix $\sqrt{\sqrtρ\tildeρ\sqrtρ}$ >. It is shown that a given density matrix $ρ$ with corresponding set of positive numbers $λ_i$ and Wootters's basis can transforms under $SO(4,c)$ into a generic $2\times…

2002-11-09quant-ph

更多相关论文收起更多论文

Optimal Lewenstein-Sanpera Decomposition for some Biparatite Systems

It is shown that for a given bipartite density matrix and by choosing a suitable separable set (instead of product set) on the separable-entangled boundary, optimal Lewenstein-Sanpera (L-S) decomposition can be obtained via optimization for a generic entangled density matrix. Based on this, We obtain optimal L-S decomposition for some bipartite systems such as $2\otimes 2$ and $2\otimes 3$ Bell decomposable states, generic two qubit state in Wootters basis, iso-concurrence decomposable states, states obtained from BD states via one parameter and three parameters local operations and classical …

2003-04-02quant-ph

Best separable approximation with semi-definite programming method

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 s…

2006-06-08quant-ph

Optimal Unambiguous Discrimination of Quantum States

Unambiguously distinguishing between nonorthogonal but linearly independent quantum states is a challenging problem in quantum information processing. In this work, an exact analytic solution to an optimum measurement problem involving an arbitrary number of pure linearly independent quantum states is presented. To this end, the relevant semi-definite programming task is reduced to a linear programming one with a feasible region of polygon type which can be solved via simplex method. The strength of the method is illustrated through some explicit examples. Also using the close connection betwe…

2007-08-17quant-ph

Degree of separability of bipartite quantum states

We investigate the problem of finding the optimal convex decomposition of a bipartite quantum state into a separable part and a positive remainder, in which the weight of the separable part is maximal. This weight is naturally identified with the degree of separability of the state. In a recent work, the problem was solved for two-qubit states using semidefinite programming. In this paper, we describe a procedure to obtain the optimal decomposition of a bipartite state of any finite dimension via a sequence of semidefinite relaxations. The sequence of decompositions thus obtained is shown to c…

2010-05-20quant-ph