Free versus bound entanglement, a NP-hard problem tackled by machine learning

Entanglement detection in high dimensional systems is a NP-hard problem since it is lacking an efficient way. Given a bipartite quantum state of interest free entanglement can be detected efficiently by the PPT-criterion (Peres-Horodecki criterion), in contrast to detecting bound entanglement, i.e. a curious form of entanglement that can also not be distilled into maximally (free) entangled states. Only a few bound entangled states have been found, typically by constructing dedicated entanglement witnesses, so naturally the question arises how large is the volume of those states. We define a large family of magically symmetric states of bipartite qutrits for which we find $$82\%$$ 82 % to be free entangled, $$2\%$$ 2 % to be certainly separable and as much as $$10\%$$ 10 % to be bound entangled, which shows that this kind of entanglement is not rare. Via various machine learning algorithms we can confirm that the remaining $$6\%$$ 6 % of states are more likely to belonging to the set of separable states than bound entangled states. Most important we find via dimension reduction algorithms that there is a strong two-dimensional (linear) sub-structure in the set of bound entangled states. This revealed structure opens a novel path to find and characterize bound entanglement towards solving the long-standing problem of what the existence of bound entanglement is implying.

Detection Power of Separability Criteria Based on a Correlation Tensor: A Case Study

Detection power of separability criteria based on a correlation tensor is tested within a family of generalized isotropic states in [Formula: see text]. For [Formula: see text] all these criteria are weaker than the positive partial transposition (PPT) criterion. Interestingly, our analysis supports the recent conjecture that a criterion based on symmetrically informationally complete positive operator-valued measure (SIC-POVMs) is stronger than realignment criterion.

A note on the degree conjecture for separability of multipartite quantum states

The degree conjecture for bipartite quantum states which are normalized graph Laplacians was first put forward by Braunstein et al. [Phys. Rev. A 73 (2006) 012320]. The degree criterion, which is equivalent to PPT criterion, is simpler and more efficient to detect the separability of quantum states associated with graphs. Hassan et al. settled the degree conjecture for the separability of multipartite quantum states in [J. Math. Phys. 49 (2008) 0121105]. It is proved that the conjecture is true for pure multipartite quantum states. However, the degree condition is only necessary for separability of a class of quantum mixed states. It does not apply to all mixed states. In this paper, we show that the degree conjecture holds for the mixed quantum states of nearest point graph. As a byproduct, the degree criterion is necessary and sufficient for multipartite separability of [Formula: see text]-qubit quantum states associated with graphs.

Geometry and Entanglement of Two-Qubit States in the Quantum Probabilistic Representation

A new geometric representation of qubit and qutrit states based on probability simplexes is used to describe the separability and entanglement properties of density matrices of two qubits. The Peres–Horodecki positive partial transpose (ppt) -criterion and the concurrence inequalities are formulated as the conditions that the introduced probability distributions must satisfy to present entanglement. A four-level system, where one or two states are inaccessible, is considered as an example of applying the elaborated probability approach in an explicit form. The areas of three Triadas of Malevich’s squares for entangled states of two qubits are defined through the qutrit state, and the critical values of the sum of their areas are calculated. We always find an interval for the sum of the square areas, which provides the possibility for an experimental checkup of the entanglement of the system in terms of the probabilities.

Separability of diagonal symmetric states: a quadratic conic optimization problem

We study the separability problem in mixtures of Dicke states i.e., the separability of the so-called Diagonal Symmetric (DS) states. First, we show that separability in the case of DS inCd⊗Cd(symmetric qudits) can be reformulated as a quadratic conic optimization problem. This connection allows us to exchange concepts and ideas between quantum information and this field of mathematics. For instance, copositive matrices can be understood as indecomposable entanglement witnesses for DS states. As a consequence, we show that positivity of the partial transposition (PPT) is sufficient and necessary for separability of DS states ford≤4. Furthermore, ford≥5, we provide analytic examples of PPT-entangled states. Second, we develop new sufficient separability conditions beyond the PPT criterion for bipartite DS states. Finally, we focus onN-partite DS qubits, where PPT is known to be necessary and sufficient for separability. In this case, we present a family of almost DS states that are PPT with respect to each partition but nevertheless entangled.

Indecomposability of entanglement witnesses

We present a way to construct indecomposable entanglement witnesses from any permutations pi with pi^2 not equal to id for any finite dimensional bipartite systems. Some new bounded entangled states are also found, which can be detected by such witnesses while cannot be distinguished by PPT criterion, realignment criterion, etc.

ENTANGLEMENT OF CONVEX LINEAR COMBINATION AND CONSTRUCTION OF PPT ENTANGLED STATES

Given two bipartite quantum states and the convex linear combination of them, we discuss the relation between the entanglement of the convex linear combination state and the entanglement of states being combined. This is achieved by characterizing quantum states quantitatively via the positive partial transpose (PPT) criterion and the computable cross-norm or realignment (CCNR) criterion. Inspired by the Horodecki's 3 ⊗ 3 quantum states, we also give explicit examples to illustrate all possible cases of convex linear combination. Finally, as an application of this method, we show how to construct new bipartite PPT entangled states from known PPT entangled states by convex linear combination.

PPT classifiable families of bipartite states

We construct a family of bipartite states of arbitrary dimension whose eigenvalues of the partially transposed matrix can be inferred directly from the block structure of the global density matrix. We identify from this several subfamilies in which the PPT criterion is both necessary and sufficient. A sufficient criterion of separability is obtained, which is fundamental for the discussion. We show how several examples of states known to be classifiable by the PPT criterion indeed belong to this general set. Possible uses of these states in numerical analysis of entanglement and in the search of PPT bound entangled states are briefly discussed.

A NOTE ON QUANTUM ENTANGLEMENT AND PPT

We study quantum states for which the PPT criterion is both sufficient and necessary for separability. We present a class of 3 × 3 bipartite mixed states and show that these states are separable if and only if they are PPT.

Combinatorial laplacians and positivity under partial transpose

The density matrices of graphs are combinatorial laplacians normalised to have trace one (Braunstein et al. 2006b). If the vertices of a graph are arranged as an array, its density matrix carries a block structure with respect to which properties such as separability can be considered. We prove that the so-called degree-criterion, which was conjectured to be necessary and sufficient for the separability of density matrices of graphs, is equivalent to the PPT-criterion. As such, it is not sufficient for testing the separability of density matrices of graphs (we provide an explicit example). Nonetheless, we prove the sufficiency when one of the array dimensions has length two (see Wu (2006) for an alternative proof). Finally, we derive a rational upper bound on the concurrence of density matrices of graphs and show that this bound is exact for graphs on four vertices.