We construct faces of the convex set of all $2\ensuremath{\bigotimes}4$ bipartite separable states, which are affinely isomorphic to the simplex ${\ensuremath{\Delta}}_{9}$ with 10 extreme points. Every interior point of these faces is a separable state which has a unique decomposition into 10 product states, even though the ranks of the state and its partial transpose are 5 and 7, respectively. We also note that the number 10 is greater than $2\ifmmode\times\else\texttimes\fi{}4$, to disprove a conjecture on the lengths of qubit-qudit separable states. This face is inscribed in the corresponding face of the convex set of all PPT states so that subsimplices ${\ensuremath{\Delta}}_{k}$ of ${\ensuremath{\Delta}}_{9}$ share the boundary if and only if $k\ensuremath{\le}5$. This enables us to find a large class of $2\ensuremath{\bigotimes}4$ PPT entangled edge states with rank 5.
We investigate the geometric structure of the set of spectra of bipartite absolute separable states (
ASEPm,n) and absolute positive partial transpose states (
APPTm,n), \emph{i.e.}, bipartite quantum states that remain separable or PPT, respectively, under all global unitary transformations. First, we establish general geometric properties of absolute convex sets of matrices, their spectra and extreme points. Regarding absolute separability, we present a permutation-symmetric reformulation of the absolute PPT criterion and use it to demonstrate that
APPTm,n is a spectrahedron for all
m≤n: in particular, all its faces are exposed. While
ASEP2,n is a spectrahedron, too, for
ASEPm,n we can in general only show that it is a semialgebraic set for all
m,n≥3. Furthermore, we provide a complete characterization of the faces and extreme points of
APPTm,n and demonstrate that the dimension of a face is determined by the rank of a certain matrix, with maximal proper faces having dimension
mn−m−1.
In the quantitative setting, we provide a rigorous lower bound on the maximal attainable purity of
APPTm,n via an inscribed polytope
Pm,n and conjecture that the maximal purity of
APPTm,n (along with its spectra) coincides with the polytope for arbitrary dimensions except when
m=n=2. Additionally, we also provide a rigorous upper bound on the minimal von Neumann entropy of
APPTm,n and demonstrate numerically that the minimum entropy eventually coincides with the polytope
Pm,n as the local system dimension
n increases. Finally, we show that the relative spectral volume of
APPTm,n decays exponentially in
n by a constant multiplicative factor of the relative volume of the inscribed polytope
Pm,n.
The absolutely separable (resp. PPT) states remain separable (resp. positive partial transpose) under any global unitary operation. We present a compact form of the extreme points in the sets of absolutely separable states and PPT states in two-qubit and qubit-qudit systems. The results imply that each extreme point has at most three distinct eigenvalues. We establish a necessary and sufficient condition for determining extreme points of the set of absolutely PPT states in two-qutrit and qutrit-qudit systems, expressed as solvable linear equations. We also demonstrate that any extreme point in qutrit-qudit system has at most seven distinct eigenvalues. We introduce the concept of robustness of nonabsolute separability. It quantifies the minimal amount by which a state needs to mix with other states such that the overall state is absolutely separable. We show that the robustness satisfies positivity, invariance under unitary transformation, monotonicity and convexity, so it is a good measure within the resource theory of nonabsolute separability. Analytical expressions for this measure are given for pure states in arbitrary system and rank-two mixed states in two-qubit system.
Deciding whether a mixed quantum state is separable or entangled is a difficult problem in general. Separable states are positive under partial transposition [they are positive-partial-transpose (PPT) states], but this simple test does not exclude all entangled states. In order to understand the entangled PPT states, having so-called bound entanglement, we want to study the extremal PPT states. An extremal PPT state is either a pure product state, then it is separable, or it is entangled, in which case the state and its partial transpose must still be rather low-rank density matrices, although it is known that the rank must be at least 4. In a previous paper we presented a complete classification of the rank-4 entangled PPT states in dimension $3\ifmmode\times\else\texttimes\fi{}3$, generalizing the construction by Bennett et al. from unextendible sets of orthogonal product vectors. In the present paper we continue our investigations of the low-rank entangled PPT states, mostly in dimension $3\ifmmode\times\else\texttimes\fi{}3$, using a combination of analytical and numerical methods. We use perturbation theory in order to construct rank-5 entangled PPT states close to the known rank-4 states, and in order to compute dimensions and study the geometry of surfaces of low-rank PPT states. We exploit the close connection between low-rank PPT states and product vectors. In particular, we show how to reconstruct a low-rank PPT state from a sufficient number of product vectors in its kernel. It may seem surprising that the number of product vectors needed may be smaller than the dimension of the kernel.
Whether the sets of absolutely separable (AS) and absolutely two-qutrit positive-partial-transpose (AP) states are the same has been an open problem in entanglement theory for decades. Since they are both convex sets, we investigate the boundary and extreme points of full-rank two-qutrit AP states with exactly three distinct eigenvalues. We show that every boundary point is an extreme point, with exactly one exception. We explicitly characterize the expressions of such points, each of which turns out to contain at most one parameter in some intervals. When the parameter approaches the ends of intervals, most points become the known extreme points of exactly two distinct eigenvalues. We present our results by tables and figures.