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/0608225 · International Journal of Quantum Information

EXACT CALCULATION OF ROBUSTNESS OF ENTANGLEMENT VIA CONVEX SEMI-DEFINITE PROGRAMMING

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

Published Sep 1, 2005• 12 citations
arXivHTMLPDF

Abstract

In general, the calculation of robustness of entanglement for the mixed entangled quantum states is rather difficult to handle analytically. Using the convex semi-definite programming method, we claculate exactly the robustness of entanglement of some mixed entangled quantum states such as the generic two-qubit state in the Wootters basis, 2 ⊗ 2 Bell decomposable (BD) states, iso-concurrence decomposable states, 2 ⊗ 3 Bell decomposable states, d ⊗ d Werner and isotropic states, a one parameter 3 ⊗ 3 state and a multi-partite isotropic state. The results are in agreement with those of 2 ⊗ 2 density matrices and have already been calculated in Refs. 1 and 2. Also, an analytic expression is given for separable states that wipe out all the entanglements. It is further shown that they are on the boundary of separable states, as pointed out in Ref. 3.

DOI
10.1142/s0219749905001043

Related papers

Robustness of entanglement for two qubit density matrix

Seyed Javad Akhtarshenas, M. A. Jafarizadeh

By considering the decomposition of a generic two qubit density matrix presented by Wootters [W. K. Wootters, Phys. Rev. Lett. {\bf 80} 2245 (1998)], the robustness of entanglement for any mixed state of two qubit systems is obtained algebraically. It is shown that the robustness of entanglement is proportional to concurrence and in Bell decomposable density matrices it is equal to the concurrence. We also give an analytic expression for two separable states which wipe out all entanglement of these states. Since thus obtained robustness is function of the norm of the vectors in the decomposition we give an explicit parameterization for the decomposition.

arXiv:quant-ph/0211156•Nov 24, 2002•1 citation

Robustness of Entanglement for Bell Decomposable States

Akhtarshenas, S J, Jafarizadeh, M A

We propose a simple geometrical approach for finding the robustness of entanglement for Bell decomposable states of 2 otimes 2 quantum systems. It is shown that the robustness of entanglement is equal to the concurrence. We also present an analytical expression for two separable states that wipe out all entanglement of these states. Finally the random robustness of these states is also obtained.

•Aug 3, 2002•2 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

Robustness of entanglement

Guifré Vidal, R. Tarrach

In the quest to completely describe entanglement in the general case of a finite number of parties sharing a physical system of finite-dimensional Hilbert space an entanglement magnitude is introduced for its pure and mixed states: robustness. It corresponds to the minimal amount of mixing with locally prepared states which washes out all entanglement. It quantifies in a sense the endurance of entanglement against noise and jamming. Its properties are studied comprehensively. Analytical expressions for the robustness are given for pure states of two-party systems, and analytical bounds for mixed states of two-party systems. Specific results are obtained mainly for the qubit-qubit system (qubit denotes quantum bit). As by-products local pseudomixtures are generalized, a lower bound for the relative volume of separable states is deduced, and arguments for considering convexity a necessary condition of any entanglement measure are put forward.

arXiv:quant-ph/9806094•Physical Review A•Jan 1, 1999•600 citations

Robustness of entanglement for W and Greenberger–Horne–Zeilinger mixed states

Zhu Zhen, Guo-Lin Lv, Maoke Miao +1 more

Abstract We study the robustness of entanglement for W and GHZ mixed states of three and four qubits. By using the definition of the robustness of entanglement and constructing multi-partite fully separable states, we obtain the analytical upper bound of the robustness of entanglement. By analyzing the entanglement witness , we obtain the lower bound of the robustness of entanglement. Then we find that the upper bound and the lower bound are fully coincident, which shows that our results are accurate and valuable.

Quantum Information Processing•Dec 26, 2024•1 citation

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
In general, the calculation of robustness of entanglement for the mixed entangled quantum states is rather difficult to handle analytically. Using the convex semi-definite programming method, we claculate exactly the robustness of entanglement of some mixed entangled quantum states such as the generic two-qubit state in the Wootters basis, 2 ⊗ 2 Bell decomposable (BD) states, iso-concurrence decomposable states, 2 ⊗ 3 Bell decomposable states, d ⊗ d Werner and isotropic states, a one parameter 3 ⊗ 3 state and a multi-partite isotropic state. The results are in agreement with those of 2 ⊗ 2 density matrices and have already been calculated in Refs. 1 and 2. Also, an analytic expression is given for separable states that wipe out all the entanglements. It is further shown that they are on the boundary of separable states, as pointed out in Ref. 3.
By considering the decomposition of a generic two qubit density matrix presented by Wootters [W. K. Wootters, Phys. Rev. Lett. {\bf 80} 2245 (1998)], the robustness of entanglement for any mixed state of two qubit systems is obtained algebraically. It is shown that the robustness of entanglement is proportional to concurrence and in Bell decomposable density matrices it is equal to the concurrence. We also give an analytic expression for two separable states which wipe out all entanglement of these states. Since thus obtained robustness is function of the norm of the vectors in the decomposition we give an explicit parameterization for the decomposition.
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.
In the quest to completely describe entanglement in the general case of a finite number of parties sharing a physical system of finite-dimensional Hilbert space an entanglement magnitude is introduced for its pure and mixed states: robustness. It corresponds to the minimal amount of mixing with locally prepared states which washes out all entanglement. It quantifies in a sense the endurance of entanglement against noise and jamming. Its properties are studied comprehensively. Analytical expressions for the robustness are given for pure states of two-party systems, and analytical bounds for mixed states of two-party systems. Specific results are obtained mainly for the qubit-qubit system (qubit denotes quantum bit). As by-products local pseudomixtures are generalized, a lower bound for the relative volume of separable states is deduced, and arguments for considering convexity a necessary condition of any entanglement measure are put forward.
Abstract We study the robustness of entanglement for W and GHZ mixed states of three and four qubits. By using the definition of the robustness of entanglement and constructing multi-partite fully separable states, we obtain the analytical upper bound of the robustness of entanglement. By analyzing the entanglement witness , we obtain the lower bound of the robustness of entanglement. Then we find that the upper bound and the lower bound are fully coincident, which shows that our results are accurate and valuable.
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.