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:quant-ph/9707043 · Physical Review Letters

Separability and Entanglement of Composite Quantum Systems

Maciej Lewenstein, Anna Sanpera

Published Mar 16, 1998• 230 citations
arXivHTMLPDF

Abstract

We provide a constructive algorithm to find the best separable approximation to an arbitrary density matrix of a composite quantum system of finite dimensions. The method leads to a condition of separability and to a measure of entanglement.
DOI
10.1103/physrevlett.80.2261

Related papers

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

Separable approximation for mixed states of composite quantum systems

Thomas Wellens, Marek Kuś

We describe a purely algebraic method for finding the best separable approximation to a mixed state of a composite $2\ifmmode\times\else\texttimes\fi{}2$ quantum system, consisting of a decomposition of the state into a linear combination of a mixed separable part and a pure entangled one. We prove that, in a generic case, the weight of the pure part in the decomposition equals the concurrence of the state.

arXiv:quant-ph/0104098•Physical Review A•Oct 2, 2001•43 citations

A matrix realignment method for recognizing entanglement

K. Chen, Ling-An Wu

Motivated by the Kronecker product approximation technique, we have developed a very simple method to assess the inseparability of bipartite quantum systems, which is based on a realigned matrix constructed from the density matrix. For any separable state, the sum of the singular values of the matrix should be less than or equal to $1$. This condition provides a very simple, computable necessary criterion for separability, and shows powerful ability to identify most bound entangled states discussed in the literature. As a byproduct of the criterion, we give an estimate for the degree of entanglement of the quantum state.

arXiv:quant-ph/0205017•Quantum Information and Computation•May 1, 2003•484 citations

A statistical-mechanical description of quantum entanglement

Jarosław K. Korbicz, F. Hulpke, Andreas Osterloh +1 more

We present a description of finite-dimensional quantum entanglement based on a study of the space of all convex decompositions of a given density matrix. On this space we construct a system of real polynomial equations describing separable states. We further study this system using methods of statistical mechanics. As an example, we finally apply our techniques to Werner states of two qubits and obtain a sufficient criterion for separability.

arXiv:0704.3357•Journal of Physics A Mathematical and Theoretical•Aug 11, 2008•3 citations

Separability and entanglement in 2xN composite quantum systems

Maciej Lewenstein, J. I. Cirac, Siniša Karnas

We show that all density operators of 2$\times N$--dimensional quantum systems that remain invariant after partial transposition with respect to the first system are separable. Based on this criterion, we derive a sufficient separability condition for general density operators in such quantum systems. We also give a simple proof of the separability criterion in $2\times 2$--dimensional systems [A. Peres, Phys. Rev. Lett {\bf 77}, 1413 (1996)]

arXiv:quant-ph/9903012•Mar 3, 1999•11 citations

THE PROBLEM OF ENTANGLEMENT OF QUANTUM STATES

On Matem, Atica Argentina

We give a brief and incomplete survey of the problem of entanglement of states of composite quantum systems.

Revista de la Unión Matemática Argentina•Jan 1, 2008•0 citations
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.
Motivated by the Kronecker product approximation technique, we have developed a very simple method to assess the inseparability of bipartite quantum systems, which is based on a realigned matrix constructed from the density matrix. For any separable state, the sum of the singular values of the matrix should be less than or equal to 111. This condition provides a very simple, computable necessary criterion for separability, and shows powerful ability to identify most bound entangled states discussed in the literature. As a byproduct of the criterion, we give an estimate for the degree of entanglement of the quantum state.
We show that all density operators of 2×N\times N×N--dimensional quantum systems that remain invariant after partial transposition with respect to the first system are separable. Based on this criterion, we derive a sufficient separability condition for general density operators in such quantum systems. We also give a simple proof of the separability criterion in 2×22\times 22×2--dimensional systems [A. Peres, Phys. Rev. Lett {\bf 77}, 1413 (1996)]