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:1306.6184 · Physical Review A

Best separable approximation of multipartite diagonal symmetric states

Ruben Quesada, Anna Sanpera

Published May 15, 2014• 19 citations
arXivHTMLPDF

Abstract

The structural study of entanglement in multipartite systems is hindered by the lack of necessary and sufficient operational criteria able to discriminate among the various entanglement properties of a given mixed state. Here, we pursue a different route to the study of multipartite entanglement based on the closeness of a multipartite state to the set of separable ones. In particular, we analyze multipartite diagonal symmetric $N$-qubit states and provide the analytical expression for their best separable approximation (BSA, [Phys. Rev. Lett. 80, 2261 (1998)]), that is, their unique convex decomposition into a separable part and an entangled part, with maximal weight of the separable part.

DOI
10.1103/physreva.89.052319

Related papers

Best separable approximation of N-qubit symmetric states

Ruben Quesada, Anna Sanpera

The structural study of entanglement in multipartite systems is hindered by the lack of necessary and sufficient operational criteria able to discriminate among the various entanglement properties of a given mixed state. Here, we pursue a different route to the study of multipartite entanglement based on the closeness of a multipartite state to the set of separable ones. In particular, we analyze multipartite diagonal symmetric N qubit states and provide the analytical expression for their Best Separable Approximation (BSA [Phys. Rev. Lett. 80, 2261 (1998)]), that is, their unique convex decomposition into a separable part and an entangled one with maximal weight of the separable one.

•Jun 26, 2013•0 citations

Entanglement and Quantumness - New Numerical Approaches -

Fabian Bohnet-Waldraff

The main topic of this compilation thesis is the investigation of multipartite entanglement of finite dimensional systems. We developed a numerical algorithm that detects if a multipartite state is entangled or separable in a finite number of steps of a semi-definite optimization task. This method is an extension of previously known semi-definite methods, which are inconclusive when the state is separable. In our case, if the state is separable, an explicit decomposition into a mixture of separable states can be extracted. This was achieved by mapping the entanglement problem onto the mathematically well studied truncated moment problem. Additionally, a new way of writing the partially transposed state for symmetric multi-qubit states was developed which simplifies many results previously known in entanglement theory. This new way of writing the partial transpose criterion unifies different interpretations and alternative formulations of the partial transpose criterion and it is also a part in the aforementioned semi-definite algorithm. The geometric properties of entangled symmetric states of two qubits were studied in detail: We could answer the question of how far a given pure state is from the convex hull of symmetric separable states, as measured by the Hilbert-Schmidt distance, by giving an explicit formula for the closest separable symmetric state. For mixed states we could provide a numerical upper and analytical lower bound for this distance. For a larger number of qubits we investigated the ball of absolutely classical states, i.e. symmetric multi-qubit states that stay separable under any unitary transformation. We found an analytical lower bound for the radius of this ball around the maximally mixed symmetric state and gave a numerical upper bound on this radius, by searching for an entangled state as close as possible to the maximally mixed symmetric state. The tensor representation of a symmetric multi-qubit state, or spin-j state, allowed us to study entanglement properties based on the spectrum of the tensor via tensor eigenvalues. The definiteness of this tensor relates to the entanglement of the state it represents and, hence, the smallest tensor eigenvalue can be used to detect entanglement. However, the tensor eigenvalues are more difficult to determine than the familiar matrix eigenvalues which made the investigation computationally more challenging. The relationship between the value of the smallest tensor eigenvalue and the amount of entanglement in the state was also investigated. It turned out that they are strongly correlated for small system sizes, i.e. for up to six qubits. However, to investigate this correlation we needed an independent way to gauge the amount of entanglement of a state and in order to do so we improved existing numerical methods to determine the distance of a state to the set of separable symmetric states, using a combination of linear and quadratic programming. The tensor representation of symmetric multi-qubit states was also used to formally define a new tensor class of regularly decomposable tensors that corresponds to the set of separable symmetric multi-qubit states.

•Sep 29, 2017•0 citations

Multipartite entanglement of superpositions

Daniel Cavalcanti, Marcelo Terra Cunha, Antonio Acín

The entanglement of superpositions [Linden et al., Phys. Rev. Lett. 97, 100502 (2006)]is generalized to the multipartite scenario: an upper bound to the multipartite entanglement of a superposition is given in terms of the entanglement of the superposed states and the superposition coefficients. This bound is proven to be tight for a class of states composed of an arbitrary number of qubits. We also extend the result to a large family of quantifiers, which includes the negativity, the robustness of entanglement, and the best separable approximation measure.

arXiv:0705.2521•Physical Review A•Oct 23, 2007•19 citations

Radial Convex Geometry of Quantum States and Its Relation to Best Separable Approximation

Haonan Qiang

We study bipartite entanglement from the convex geometry of quantum states. Taking the maximally mixed state as a reference point, we define a geometric entangled-space quantity $G(ρ)=[1-L(ρ)]/L(ρ)$ from the relative positions of the separable and quantum-state boundaries, and introduce a relative entanglement degree $Q(ρ)=[(1-p)/p]/G(ρ)$ by comparing it with the robustness relative to the maximally mixed state. We apply this geometric construction to the Best Separable Approximation (BSA). For the optimal decomposition, we derive the general bound $(1-p)L_B/[p(1-L_B)]\leq p_0\leq Q(ρ)$ and show that the entangled component of the BSA has an entangled-space size no smaller than that of the original mixed state, namely $[1-L_R]/L_R\leq[1-L_B]/L_B$. For two-qubit states, the BSA entangled component is a pure entangled state. Using the PPT criterion, its geometric parameter can be evaluated explicitly, giving the bound $(1-p)/(2p)\leq p_0\leq Q(ρ)$. These results provide a simple geometric description of the relation between BSA, robustness, and the entangled region of the quantum-state space.

quant-pharXiv:2608.20050•Aug 21, 2026•0 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

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
The structural study of entanglement in multipartite systems is hindered by the lack of necessary and sufficient operational criteria able to discriminate among the various entanglement properties of a given mixed state. Here, we pursue a different route to the study of multipartite entanglement based on the closeness of a multipartite state to the set of separable ones. In particular, we analyze multipartite diagonal symmetric NNN-qubit states and provide the analytical expression for their best separable approximation (BSA, [Phys. Rev. Lett. 80, 2261 (1998)]), that is, their unique convex decomposition into a separable part and an entangled part, with maximal weight of the separable part.
The structural study of entanglement in multipartite systems is hindered by the lack of necessary and sufficient operational criteria able to discriminate among the various entanglement properties of a given mixed state. Here, we pursue a different route to the study of multipartite entanglement based on the closeness of a multipartite state to the set of separable ones. In particular, we analyze multipartite diagonal symmetric N qubit states and provide the analytical expression for their Best Separable Approximation (BSA [Phys. Rev. Lett. 80, 2261 (1998)]), that is, their unique convex decomposition into a separable part and an entangled one with maximal weight of the separable one.
The main topic of this compilation thesis is the investigation of multipartite entanglement of finite dimensional systems. We developed a numerical algorithm that detects if a multipartite state is entangled or separable in a finite number of steps of a semi-definite optimization task. This method is an extension of previously known semi-definite methods, which are inconclusive when the state is separable. In our case, if the state is separable, an explicit decomposition into a mixture of separable states can be extracted. This was achieved by mapping the entanglement problem onto the mathematically well studied truncated moment problem. Additionally, a new way of writing the partially transposed state for symmetric multi-qubit states was developed which simplifies many results previously known in entanglement theory. This new way of writing the partial transpose criterion unifies different interpretations and alternative formulations of the partial transpose criterion and it is also a part in the aforementioned semi-definite algorithm. The geometric properties of entangled symmetric states of two qubits were studied in detail: We could answer the question of how far a given pure state is from the convex hull of symmetric separable states, as measured by the Hilbert-Schmidt distance, by giving an explicit formula for the closest separable symmetric state. For mixed states we could provide a numerical upper and analytical lower bound for this distance. For a larger number of qubits we investigated the ball of absolutely classical states, i.e. symmetric multi-qubit states that stay separable under any unitary transformation. We found an analytical lower bound for the radius of this ball around the maximally mixed symmetric state and gave a numerical upper bound on this radius, by searching for an entangled state as close as possible to the maximally mixed symmetric state. The tensor representation of a symmetric multi-qubit state, or spin-j state, allowed us to study entanglement properties based on the spectrum of the tensor via tensor eigenvalues. The definiteness of this tensor relates to the entanglement of the state it represents and, hence, the smallest tensor eigenvalue can be used to detect entanglement. However, the tensor eigenvalues are more difficult to determine than the familiar matrix eigenvalues which made the investigation computationally more challenging. The relationship between the value of the smallest tensor eigenvalue and the amount of entanglement in the state was also investigated. It turned out that they are strongly correlated for small system sizes, i.e. for up to six qubits. However, to investigate this correlation we needed an independent way to gauge the amount of entanglement of a state and in order to do so we improved existing numerical methods to determine the distance of a state to the set of separable symmetric states, using a combination of linear and quadratic programming. The tensor representation of symmetric multi-qubit states was also used to formally define a new tensor class of regularly decomposable tensors that corresponds to the set of separable symmetric multi-qubit states.
The entanglement of superpositions [Linden et al., Phys. Rev. Lett. 97, 100502 (2006)]is generalized to the multipartite scenario: an upper bound to the multipartite entanglement of a superposition is given in terms of the entanglement of the superposed states and the superposition coefficients. This bound is proven to be tight for a class of states composed of an arbitrary number of qubits. We also extend the result to a large family of quantifiers, which includes the negativity, the robustness of entanglement, and the best separable approximation measure.
We study bipartite entanglement from the convex geometry of quantum states. Taking the maximally mixed state as a reference point, we define a geometric entangled-space quantity G(ρ)=[1−L(ρ)]/L(ρ)G(ρ)=[1-L(ρ)]/L(ρ)G(ρ)=[1−L(ρ)]/L(ρ) from the relative positions of the separable and quantum-state boundaries, and introduce a relative entanglement degree Q(ρ)=[(1−p)/p]/G(ρ)Q(ρ)=[(1-p)/p]/G(ρ)Q(ρ)=[(1−p)/p]/G(ρ) by comparing it with the robustness relative to the maximally mixed state. We apply this geometric construction to the Best Separable Approximation (BSA). For the optimal decomposition, we derive the general bound (1−p)LB/[p(1−LB)]≤p0≤Q(ρ)(1-p)L_B/[p(1-L_B)]\leq p_0\leq Q(ρ)(1−p)LB​/[p(1−LB​)]≤p0​≤Q(ρ) and show that the entangled component of the BSA has an entangled-space size no smaller than that of the original mixed state, namely [1−LR]/LR≤[1−LB]/LB[1-L_R]/L_R\leq[1-L_B]/L_B[1−LR​]/LR​≤[1−LB​]/LB​. For two-qubit states, the BSA entangled component is a pure entangled state. Using the PPT criterion, its geometric parameter can be evaluated explicitly, giving the bound (1−p)/(2p)≤p0≤Q(ρ)(1-p)/(2p)\leq p_0\leq Q(ρ)(1−p)/(2p)≤p0​≤Q(ρ). These results provide a simple geometric description of the relation between BSA, robustness, and the entangled region of the quantum-state space.
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.