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:1206.5630

Separable states and the SPA of a positive map

Erling Størmer

Published Jun 25, 2012• 6 citations
arXivHTMLPDF

Abstract

being the nxn matrices, is separable. There are necessary conditionslike the PPT condition which are reasonablyeasy to verify, but no such sufficientconditions. In the present paper we introduce two necessary conditions whichare very easy to verify, and then apply them to show that the SPA of someoptimal maps introduced by Ha and Kye [3] do not correspond to separablestates, yielding a counter example to the conjecture in [5] stating that the SPAof an optimal unital map is separable. It was announced in [3] that some oftheir maps yield counter examples of the conjecture and that proofs will appearin [4].Another consequence of our analysis is that if φ:M

Related papers

Separable states, maximally entangled states, and positive maps

Erling Størmer

Using maximally entangled states we introduce an invariant S(a) for a ∈ M n ⊗ M n a\in M_n \otimes M_n , which is useful for distinguishing separable density matrices from entangled ones. The results obtained are then applied to study the SPA of a positive map.

Contemporary mathematics - American Mathematical Society•Jan 1, 2016•0 citations

k-Positive Maps: New Characterizations and a Generation Method

Frederik vom Ende, Sumeet Khatri, Sergey Denisov

We study [Formula: see text]-positive linear maps on matrix algebras and address two problems, (i) characterizations of [Formula: see text]-positivity and (ii) generation of nondecomposable [Formula: see text]-positive maps. On the characterization side, we derive optimization-based conditions equivalent to [Formula: see text]-positivity that (a) reduce to a simple check when [Formula: see text], (b) reveal a direct link to the spectral norm of certain order-3 tensors (aligning with known NP-hardness barriers for [Formula: see text]), and (c) recast [Formula: see text]-positivity as a novel optimization problem over separable states, thereby connecting it explicitly to separability testing. On the generation side, we introduce a Lie-semigroup-based method that, starting from a single [Formula: see text]-positive map, produces one-parameter families that remain [Formula: see text]-positive and nondecomposable for small enough times. We illustrate this by generating such families for [Formula: see text] and [Formula: see text]. We also formulate a semidefinite program (SDP) to test an equivalent form of the positive partial transpose (PPT) square conjecture (and do not find any violation of the latter). Our results provide practical computational tools for certifying [Formula: see text]-positivity and a systematic way to sample [Formula: see text]-positive nondecomposable maps.

arXiv:2508.21348•Open Systems & Information Dynamics•Dec 1, 2025•3 citations

Reply to “Comment on ‘Separability of completely symmetric states in a multipartite system’ ”

Yi Shen, Lin Chen, Lilong Qian +1 more

The author of the Comment [Phys. Rev. A 104, 016401 (2021)] pointed out the missing part in the proof of Theorem 20 in our work [L. Qian et al., Phys. Rev. A 99, 032312 (2019)], and presented a sufficient and necessary condition for the separability of completely symmetric (CS) states in the two-qutrit system. While being technically correct, the proposed example is still a separable CS state according to Ha's sufficient and necessary condition. We provide another proof to show that every bipartite CS state of rank five is separable. This result bridges the gap appearing in our previous proof. It turns out that every two-qutrit CS state is separable, and thus making our conclusion (Theorem 20 of our work) still valid.

Physical Review A•Jul 6, 2021•0 citations

Global Geometric Difference Between Separable and Positive Partial Transpose States

Kil-Chan Ha, Seung-Hyeok Kye

In the convex set of all 3 ⊗ 3 states with positive partial transposes, we show that one can take two extreme points whose convex combinations belong to the interior of the convex set. Their convex combinations may be even in the interior of the convex set of all separable states. In general, we need at least mn extreme points to get an interior point by their convex combination, for the case of the convex set of all m ⊗ n separable states. This shows a sharp distinction between PPT states and separable states. We also consider the same questions for positive maps and decomposable maps.

arXiv:1308.0952•Open Systems & Information Dynamics•Dec 1, 2014•0 citations

Structural physical approximations and entanglement witnesses

Bang-Hai Wang, Dongyang Long

The structural physical approximation (SPA) to a positive map is considered to be one of the most important methods to detect entanglement in the real physical world. We first show that an arbitrary entanglement witness (EW) $W$ can be constructed from a separable density matrix $\ensuremath{\sigma}$ in the form of $W=\ensuremath{\sigma}\ensuremath{-}{c}_{\ensuremath{\sigma}}I$, where ${c}_{\ensuremath{\sigma}}$ is a non-negative number and $I$ is the identity matrix. Following the general form of EWs from separable states, we show a sufficient condition and a sufficient and necessary condition in low dimensions of that SPAs to positive maps do not define entanglement-breaking channels. We show that either the SPA of an EW or the SPA of the partial transposition of the EW in low dimensions is an entanglement-breaking channel. We give sufficient conditions of violating the SPA conjecture [Phys. Rev. A 78, 062105 (2008)]. Our results indicate that the SPA conjecture is independent of whether or not positive maps are optimal.

arXiv:1106.5233•Physical Review A•Jun 21, 2013•14 citations

A Note on Positive Maps and Classification of States

Gen Kimura, Andrzej Kossakowski

The relation between positive maps on Mn and subsets of self-adjoint elements from Mn ⊗ Mn is investigated. It has been shown that there exists the isomorphism between the set of all positive normalized maps on Mn and the subset of separable states on Mn ⊗ Mn.

Open Systems & Information Dynamics•Mar 1, 2005•9 citations
being the nxn matrices, is separable. There are necessary conditionslike the PPT condition which are reasonablyeasy to verify, but no such sufficientconditions. In the present paper we introduce two necessary conditions whichare very easy to verify, and then apply them to show that the SPA of someoptimal maps introduced by Ha and Kye [3] do not correspond to separablestates, yielding a counter example to the conjecture in [5] stating that the SPAof an optimal unital map is separable. It was announced in [3] that some oftheir maps yield counter examples of the conjecture and that proofs will appearin [4].Another consequence of our analysis is that if φ:M
We study [Formula: see text]-positive linear maps on matrix algebras and address two problems, (i) characterizations of [Formula: see text]-positivity and (ii) generation of nondecomposable [Formula: see text]-positive maps. On the characterization side, we derive optimization-based conditions equivalent to [Formula: see text]-positivity that (a) reduce to a simple check when [Formula: see text], (b) reveal a direct link to the spectral norm of certain order-3 tensors (aligning with known NP-hardness barriers for [Formula: see text]), and (c) recast [Formula: see text]-positivity as a novel optimization problem over separable states, thereby connecting it explicitly to separability testing. On the generation side, we introduce a Lie-semigroup-based method that, starting from a single [Formula: see text]-positive map, produces one-parameter families that remain [Formula: see text]-positive and nondecomposable for small enough times. We illustrate this by generating such families for [Formula: see text] and [Formula: see text]. We also formulate a semidefinite program (SDP) to test an equivalent form of the positive partial transpose (PPT) square conjecture (and do not find any violation of the latter). Our results provide practical computational tools for certifying [Formula: see text]-positivity and a systematic way to sample [Formula: see text]-positive nondecomposable maps.
The author of the Comment [Phys. Rev. A 104, 016401 (2021)] pointed out the missing part in the proof of Theorem 20 in our work [L. Qian et al., Phys. Rev. A 99, 032312 (2019)], and presented a sufficient and necessary condition for the separability of completely symmetric (CS) states in the two-qutrit system. While being technically correct, the proposed example is still a separable CS state according to Ha's sufficient and necessary condition. We provide another proof to show that every bipartite CS state of rank five is separable. This result bridges the gap appearing in our previous proof. It turns out that every two-qutrit CS state is separable, and thus making our conclusion (Theorem 20 of our work) still valid.
In the convex set of all 3 ⊗ 3 states with positive partial transposes, we show that one can take two extreme points whose convex combinations belong to the interior of the convex set. Their convex combinations may be even in the interior of the convex set of all separable states. In general, we need at least mn extreme points to get an interior point by their convex combination, for the case of the convex set of all m ⊗ n separable states. This shows a sharp distinction between PPT states and separable states. We also consider the same questions for positive maps and decomposable maps.
The structural physical approximation (SPA) to a positive map is considered to be one of the most important methods to detect entanglement in the real physical world. We first show that an arbitrary entanglement witness (EW) WWW can be constructed from a separable density matrix $\ensuremath{\sigma}$ in the form of $W=\ensuremath{\sigma}\ensuremath{-}{c}_{\ensuremath{\sigma}}I$, where ${c}_{\ensuremath{\sigma}}$ is a non-negative number and III is the identity matrix. Following the general form of EWs from separable states, we show a sufficient condition and a sufficient and necessary condition in low dimensions of that SPAs to positive maps do not define entanglement-breaking channels. We show that either the SPA of an EW or the SPA of the partial transposition of the EW in low dimensions is an entanglement-breaking channel. We give sufficient conditions of violating the SPA conjecture [Phys. Rev. A 78, 062105 (2008)]. Our results indicate that the SPA conjecture is independent of whether or not positive maps are optimal.