Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1005.3675 · Physical Review A

Degree of separability of bipartite quantum states

Guo Chuan Thiang

Published Jul 26, 2010• 5 citations
arXivHTMLPDF

Abstract

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 converge to the optimal one. This provides a systematic method to determine the so-called optimal Lewenstein-Sanpera decomposition of any bipartite state. Numerical results are provided to illustrate this procedure, and the special case of rank-2 states is also discussed.

DOI
10.1103/physreva.82.012332

Related papers

Optimal Lewenstein-Sanpera decomposition of two-qubit states using semidefinite programming

Guo Chuan Thiang, Philippe Raynal, Berthold‐Georg Englert

We use the language of semidefinite programming and duality to derive necessary and sufficient conditions for the optimal Lewenstein-Sanpera decomposition (LSD) of two-qubit states. We first provide a simple and natural derivation of the Wellens-Ku\ifmmode \acute{s}\else \'{s}\fi{} 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-Ku\ifmmode \acute{s}\else \'{s}\fi{} equations, and the rank-2 case, where the optimal decomposition is analytically known. We also give an analytic expression for the optimal LSD of a special class of rank-3 states. Finally, our formulation ensures efficient numerical procedures to return the optimal LSD for any arbitrary two-qubit state.

arXiv:0909.4599•Physical Review A•Nov 11, 2009•5 citations

Optimal Lewenstein–Sanpera decomposition for some bipartite systems

Seyed Javad Akhtarshenas, M. A. Jafarizadeh

It is shown that for a given bipartite density matrix and by choosing a suitable separable set (instead of a product set) on the separable–entangled boundary, the optimal Lewenstein–Sanpera (LS) decomposition (with respect to an arbitrary separable set) can be obtained via a direct optimization procedure for a generic entangled density matrix. On the basis of this, we obtain the optimal LS decomposition for some bipartite systems such as 2 ⊗ 2 and 2 ⊗ 3 Bell decomposable (BD) states, a generic two qubit state in Wootters basis, iso-concurrence decomposable states, states obtained from BD states via one-parameter and three-parameter local operations and classical communications (LOCC), d ⊗ d Werner and isotropic states and a one-parameter 3 ⊗ 3 state. We also obtain the optimal decomposition for multi-partite isotropic states. It is shown that in all 2 ⊗ 2 systems considered here the average concurrence of the decomposition is equal to the concurrence. We also show that for some 2 ⊗ 3 Bell decomposable states, the average concurrence of the decomposition is equal to the lower bound of the concurrence of the state presented recently in Lozinski et al (2003 Preprint quant-ph/0302144), so an exact expression for concurrence of these states is obtained. It is also shown that for a d ⊗ d isotropic state where decomposition leads to a separable and an entangled pure state, the average I-concurrence of the decomposition is equal to the I-concurrence of the state.

arXiv:quant-ph/0304019•Journal of Physics A Mathematical and General•Feb 11, 2004•14 citations

Separable approximations of density matrices of composite quantum systems

Sinisa Karnas, Maciej Lewenstein

We investigate optimal separable approximations (decompositions) of states ϱ of bipartite quantum systems A and B of arbitrary dimensions M × N following the lines of Lewenstein and Sanpera. Such approximations allow to represent in an optimal way any density operator as a sum of a separable state and an entangled state of a certain form. For two-qubit systems ( M = N = 2) the best separable approximation has the form of a mixture of a separable state and a projector onto a pure entangled state. We formulate a necessary condition that the pure state in the best separable approximation is not maximally entangled. We demonstrate that the weight of the entangled state in the best separable approximation in arbitrary dimensions provides a good entanglement measure. We prove for arbitrary M and N that the best separable approximation corresponds to a mixture of separable and entangled states, both of which are unique. We develop also a theory of optimal separable approximations for states with positive partial transpose (PPT states). Such approximations allow to decompose any density operator with positive partial transpose as a sum of a separable state and an entangled PPT state. We discuss procedures for constructing such decompositions.

arXiv:quant-ph/0011066•Journal of Physics A Mathematical and General•Aug 24, 2001•60 citations

BEST SEPARABLE APPROXIMATION WITH SEMI-DEFINITE PROGRAMMING METHOD

M. A. Jafarizadeh, Mehdi Mirzaee, M. Rezaee

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 semi-definite programming. In particular, we obtain the optimal Lewenstein–Sanpera decomposition for some examples such as: the Bell decomposable state, the iso-concurrence state, the generic two-qubit state in the Wootters basis, the 2⊗3 Bell decomposable state, the d⊗d Werner and isotropic states, a one parameter 3⊗3 state, and finally a multi-partite isotropic state.

arXiv:quant-ph/0606075•International Journal of Quantum Information•Dec 1, 2004•11 citations

Lewenstein-Sanpera decomposition For Bell Decomposable

Seyed Javad Akhtarshenas, M. A. Jafarizadeh

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.

arXiv:quant-ph/0207161•Jul 28, 2002•3 citations

Separability discrimination and decomposition of m -partite quantum mixed states

Ying Li, Guyan Ni

We propose an $E$-truncated $K$-moment and semidefinite relaxations (ETKM-SDR) method to check whether an $m$-partite quantum mixed state is separable and give a decomposition for it if it is. We first convert the separability discrimination problem of mixed states to the positive Hermitian decomposition problem of Hermitian tensors. Then, employing the $E$-truncated $K$-moment method, we obtain an optimization model for discriminating separability. Moreover, by applying the semidefinite relaxation method, we get a hierarchy of semidefinite relaxation optimization models and propose an algorithm for detecting the separability of mixed states. The algorithm can also be used for symmetric and nonsymmetric decomposition of separable mixed states. By numerical examples, we find that not all symmetric separable states have symmetric decompositions.

arXiv:1912.08985•Physical Review A•Jul 6, 2020•15 citations
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 converge to the optimal one. This provides a systematic method to determine the so-called optimal Lewenstein-Sanpera decomposition of any bipartite state. Numerical results are provided to illustrate this procedure, and the special case of rank-2 states is also discussed.
We use the language of semidefinite programming and duality to derive necessary and sufficient conditions for the optimal Lewenstein-Sanpera decomposition (LSD) of two-qubit states. We first provide a simple and natural derivation of the Wellens-Ku\ifmmode \acute{s}\else \'{s}\fi{} 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-Ku\ifmmode \acute{s}\else \'{s}\fi{} equations, and the rank-2 case, where the optimal decomposition is analytically known. We also give an analytic expression for the optimal LSD of a special class of rank-3 states. Finally, our formulation ensures efficient numerical procedures to return the optimal LSD for any arbitrary two-qubit state.
It is shown that for a given bipartite density matrix and by choosing a suitable separable set (instead of a product set) on the separable–entangled boundary, the optimal Lewenstein–Sanpera (LS) decomposition (with respect to an arbitrary separable set) can be obtained via a direct optimization procedure for a generic entangled density matrix. On the basis of this, we obtain the optimal LS decomposition for some bipartite systems such as 2 ⊗ 2 and 2 ⊗ 3 Bell decomposable (BD) states, a generic two qubit state in Wootters basis, iso-concurrence decomposable states, states obtained from BD states via one-parameter and three-parameter local operations and classical communications (LOCC), d ⊗ d Werner and isotropic states and a one-parameter 3 ⊗ 3 state. We also obtain the optimal decomposition for multi-partite isotropic states. It is shown that in all 2 ⊗ 2 systems considered here the average concurrence of the decomposition is equal to the concurrence. We also show that for some 2 ⊗ 3 Bell decomposable states, the average concurrence of the decomposition is equal to the lower bound of the concurrence of the state presented recently in Lozinski et al (2003 Preprint quant-ph/0302144), so an exact expression for concurrence of these states is obtained. It is also shown that for a d ⊗ d isotropic state where decomposition leads to a separable and an entangled pure state, the average I-concurrence of the decomposition is equal to the I-concurrence of the state.
We investigate optimal separable approximations (decompositions) of states ϱ of bipartite quantum systems A and B of arbitrary dimensions M × N following the lines of Lewenstein and Sanpera. Such approximations allow to represent in an optimal way any density operator as a sum of a separable state and an entangled state of a certain form. For two-qubit systems ( M = N = 2) the best separable approximation has the form of a mixture of a separable state and a projector onto a pure entangled state. We formulate a necessary condition that the pure state in the best separable approximation is not maximally entangled. We demonstrate that the weight of the entangled state in the best separable approximation in arbitrary dimensions provides a good entanglement measure. We prove for arbitrary M and N that the best separable approximation corresponds to a mixture of separable and entangled states, both of which are unique. We develop also a theory of optimal separable approximations for states with positive partial transpose (PPT states). Such approximations allow to decompose any density operator with positive partial transpose as a sum of a separable state and an entangled PPT state. We discuss procedures for constructing such decompositions.
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 semi-definite programming. In particular, we obtain the optimal Lewenstein–Sanpera decomposition for some examples such as: the Bell decomposable state, the iso-concurrence state, the generic two-qubit state in the Wootters basis, the 2⊗3 Bell decomposable state, the d⊗d Werner and isotropic states, a one parameter 3⊗3 state, and finally a multi-partite isotropic state.
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.
We propose an EEE-truncated KKK-moment and semidefinite relaxations (ETKM-SDR) method to check whether an mmm-partite quantum mixed state is separable and give a decomposition for it if it is. We first convert the separability discrimination problem of mixed states to the positive Hermitian decomposition problem of Hermitian tensors. Then, employing the EEE-truncated KKK-moment method, we obtain an optimization model for discriminating separability. Moreover, by applying the semidefinite relaxation method, we get a hierarchy of semidefinite relaxation optimization models and propose an algorithm for detecting the separability of mixed states. The algorithm can also be used for symmetric and nonsymmetric decomposition of separable mixed states. By numerical examples, we find that not all symmetric separable states have symmetric decompositions.