We construct a simplex for multipartite qubit states of even number
n of qubits, which has the same geometry concerning separability, mixedness, kind of entanglement, amount of entanglement, and nonlocality as the bipartite qubit states. We derive the entanglement of the class of states which can be described by only three real parameters with the help of a multipartite measure for all discrete systems. We prove that the bounds on this measure are optimal for the whole class of states and that it reveals that the states possess only
n-partite entanglement and not, e.g., bipartite entanglement. We then show that this
n-partite entanglement can be increased by stochastic local operations and classical communication to the purest maximal entangled states. However, pure
n-partite entanglement cannot be distilled; consequently all entangled states in the simplex are
n-partite bound entangled. We study also Bell inequalities and find the same geometry as for bipartite qubits. Moreover, we show how the (hidden) nonlocality for all
n-partite bound entangled states can be revealed.
In this paper we show an explicit construction of multipartite class of entangled states with the PPT (Positive Partial Transposition) property in every cut. We investigate properties of this class of states focusing on the trace distance from the set of separable states. We provide an explicit sub-class of the multipartite entangled PPT states which are arbitrary far from the set of separable states. We argue, that in the multipartite case the mentioned distance increases with dimension of the local Hilbert space. In our construction is we do not have to use many copies of initial state living on the smaller space to boost the trace distance as in the previous attempts to this problem.
We compare the classification as entangled or separable of Bell diagonal bipartite qudits with positive partial transposition (PPT) and their properties for different dimensions. For dimension [Formula: see text], a form of entanglement exists that is hard to detect and called bound entanglement due to the fact that such entangled states cannot be used for entanglement distillation. Up to this date, no efficient solution is known to differentiate bound entangled from separable states. We address and compare this problem named separability problem for a family of bipartite Bell diagonal qudits with special algebraic and geometric structures and applications in quantum information processing tasks in different dimensions. Extending analytical and numerical methods and results for Bell diagonal qutrits ([Formula: see text]), we successfully classify more than [Formula: see text] of representative Bell diagonal PPT states for [Formula: see text]. Via those representative states we are able to estimate the volumes of separable and bound entangled states among PPT ququarts ([Formula: see text]). We find that at least [Formula: see text] of all PPT states are separable, [Formula: see text] bound entangled and for [Formula: see text] it remains unclear whether they are separable or bound entangled. Comparing the structure of bound entangled states and their detectors, we find considerable differences in the detection capabilities for different dimensions and relate those to differences of the Euclidean geometry for qutrits ([Formula: see text]) and ququarts ([Formula: see text]). Finally, using a detailed visual analysis of the set of separable and bound entangled Bell diagonal states in both dimensions, qualitative observations are made that allow to better distinguish bound entangled from separable states.
The discovery of entangled quantum states from which one cannot distill pure entanglement constitutes a fundamental recent advance in the field of quantum information. Such bipartite bound-entangled (BE) quantum states could fall into two distinct categories: (1) Inseparable states with positive partial transposition (PPT), and (2) states with negative partial transposition (NPT). While the existence of PPT BE states has been confirmed, only one class of conjectured NPT BE states has been discovered so far. We provide explicit constructions of a variety of multicopy undistillable NPT states, and conjecture that they constitute families of NPT BE states. For example, we show that for every pure state of Schmidt rank greater than or equal to 3, one can construct n-copy undistillable NPT states, for any
n> 1. The abundance of such conjectured NPT BE states, we believe, considerably strengthens the notion that being NPT is only a necessary condition for a state to be distillable.
In this contribution we relate two different key concepts: mutually unbiased bases (MUBs) and entanglement. We provide a general toolbox for analyzing and comparing entanglement of quantum states for different dimensions and numbers of particles. In particular we focus on bound entanglement, i.e. highly mixed states which cannot be distilled by local operations and classical communications. For a certain class of states—for which the state-space forms a ‘ magic ’ simplex—we analyze the set of bound entangled states detected by the MUB criterion for different dimensions d and number of particles n . We find that the geometry is similar for different d and n , consequently the MUB criterion opens possibilities to investigate the typicality of positivity under partial transposition (PPT)-bound and multipartite bound entanglement more deeply and provides a simple experimentally feasible tool to detect bound entanglement.
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.