We show how to design families of operational criteria that distinguish entangled from separable quantum states. The simplest of these tests corresponds to the well-known Peres-Horodecki positive partial transpose (PPT) criterion, and the more complicated tests are strictly stronger. The new criteria are tractable due to powerful computational and theoretical methods for the class of convex optimization problems known as semidefinite programs. We successfully applied the results to many low-dimensional states from the literature where the PPT test fails. As a by-product of the criteria, we provide an explicit construction of the corresponding entanglement witnesses.
We show how to design families of operational criteria that distinguish entangled from separable quantum states. The simplest of these tests corresponds to the well-known Peres-Horodecki positive partial transpose (PPT) criterion, and the more complicated tests are strictly stronger. The new criteria are tractable due to powerful computational and theoretical methods for the class of convex optimization problems known as semidefinite programs. We successfully applied the results to many low-dimensional states from the literature where the PPT test fails. As a by-product of the criteria, we provide an explicit construction of the corresponding entanglement witnesses.
We study the application of sums of squares decompositions and semidefinite programming in the formulation of computational criteria for distinguishing entangled from separable quantum states. A hierarchy of tests is obtained, the simplest of which corresponds to the well-known positive partial transpose (PPT) sufficient criterion, with the more complicated tests being strictly stronger. The duality structure of the problem allows us to provide an explicit construction of the entanglement witnesses corresponding to our tests.
We introduce a family of separability criteria that are based on the existence of extensions of a bipartite quantum state \ensuremath{\rho} to a larger number of parties satisfying certain symmetry properties. It can be easily shown that all separable states have the required extensions, so the nonexistence of such an extension for a particular state implies that the state is entangled. One of the main advantages of this approach is that searching for the extension can be cast as a convex optimization problem known as a semidefinite program. Whenever an extension does not exist, the dual optimization constructs an explicit entanglement witness for the particular state. These separability tests can be ordered in a hierarchical structure whose first step corresponds to the well-known positive partial transpose (Peres-Horodecki) criterion, and each test in the hierarchy is at least as powerful as the preceding one. This hierarchy is complete, in the sense that any entangled state is guaranteed to fail a test at some finite point in the hierarchy, thus showing it is entangled. The entanglement witnesses corresponding to each step of the hierarchy have well-defined and very interesting algebraic properties that, in turn, allow for a characterization of the interior of the set of positive maps. Coupled with some recent results on the computational complexity of the separability problem, which has been shown to be NP hard, this hierarchy of tests gives a complete and also computationally and theoretically appealing characterization of mixed bipartite entangled states.
With a probability of success of 95% we solve the separability problem for Bell diagonal qutrit states with positive partial transposition (PPT). The separability problem, i.e. distinguishing separable and entangled states, generally lacks an efficient solution due to the existence of bound entangled states. In contrast to free entangled states that can be used for entanglement distillation via local operations and classical communication, these states cannot be detected by the Peres-Horodecki criterion or PPT criterion. We analyze a large family of bipartite qutrit states that can be separable, free entangled or bound entangled. Leveraging a geometrical representation of these states in Euclidean space, novel methods are presented that allow the classification of separable and bound entangled Bell diagonal states in an efficient way. Moreover, the classification allows the precise determination of relative volumes of the classes of separable, free and bound entangled states. In detail, out of all Bell diagonal PPT states [Formula: see text] are determined to be separable while [Formula: see text] are bound entangled and only [Formula: see text] remain unclassified. Moreover, our applied criteria are compared for their effectiveness and relation as detectors of bound entanglement, which reveals that not a single criterion is capable to detect all bound entangled states.
We present a simple semidefinite program whose optimal value is equal to the maximum probability of perfectly distinguishing orthogonal maximally entangled states using any PPT measurement (a measurement whose operators are positive under partial transpose). When the states to be distinguished are given by the tensor product of Bell states, the semidefinite program simplifies to a linear program. In Phys. Rev. Lett. 109, 020506 (2012), Yu, Duan, and Ying exhibit a set of four maximally entangled states in ${\mathbb{C}}^{4}\ensuremath{\bigotimes}{\mathbb{C}}^{4}$, which is distinguishable by any PPT measurement only with probability strictly less than 1. Using semidefinite programming, we show a tight bound of 7/8 on this probability (3/4 for the case of unambiguous PPT measurements). We generalize this result by demonstrating a simple construction of a set of k states in ${\mathbb{C}}^{k}\ensuremath{\bigotimes}{\mathbb{C}}^{k}$ with the same property, for any k that is a power of 2. By running numerical experiments, we show the local indistinguishability of certain sets of generalized Bell states in ${\mathbb{C}}^{5}\ensuremath{\bigotimes}{\mathbb{C}}^{5}$ and ${\mathbb{C}}^{6}\ensuremath{\bigotimes}{\mathbb{C}}^{6}$ previously considered in the literature.
It is well known that the positive partial transpose (PPT) criterion for determining separability is an operational separability criterion. However, in a high-dimensional (>6) situation, this criterion is not sufficient. How can we judge whether an entangled state in any high-dimensional quantum system is PPT or not? Here we propose a linear algebra method for checking the positivity of the partial transpose of a state and present a set of entangled mixed states with non-positive partial transpose.
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.