Related papers: Approximating the Set of Separable States Using th…
We discuss the estimation of the distance of a given mixed many-body quantum state to the set of fully separable states, applied to the concrete scenario of collective spin states. Concretely, we discuss lower bounds to distances from the…
Following recent work of Beigi and Shor, we investigate PPT states that are "heavily entangled." We first exploit volumetric methods to show that in a randomly chosen direction, there are PPT states whose distance in trace norm from…
In this paper, we present new progress on the study of the symmetric extension criterion for separability. First, we show that a perturbation of order O(1/N) is sufficient and, in general, necessary to destroy the entanglement of any state…
In order to construct a measure of entanglement on the basis of a ``distance'' between two states, it is one of desirable properties that the ``distance'' is nonincreasing under every completely positive trace preserving map. Contrary to a…
We present a framework for deciding whether a quantum state is separable or entangled using covariance matrices of locally measurable observables. This leads to the covariance matrix criterion as a general separability criterion. We…
In this note a very crude but simple approximation to the set of separable states in an arbitrary simplex of commutative states is given using the fact that on the lines connecting the maximally mixed state and an arbitrary pure state the…
The partial transpose by which a subsystem's quantum state is solely transposed is of unique importance in quantum information processing from both fundamental and practical point of view. In this work, we present a practical scheme to…
We prove an analytic positive lower bound for the geometric distance between entangled positive partial transpose (PPT) states of a broad class and any private state that delivers one secure key bit. Our proof holds for any Hilbert space of…
We introduce a new technique to detect separable states using semidefinite programs. This approach provides a sufficient condition for separability of a state that is based on the existence of a certain local linear map applied to a known…
The notion of partial trace of a density operator is essential for the understanding of the entanglement and separability properties of quantum states. In this paper we investigate these notions putting an emphasis on the geometrical…
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…
In recent years considerable progress has been made towards developing a general theory of quantum entanglement. In particular, criteria to decide whether a given quantum state is entangled are of high theoretical and practical interest.…
The problem of of how many entangled or, respectively, separable states there are in the set of all quantum states is investigated. We study to what extent the choice of a measure in the space of density matrices describing N--dimensional…
We develop a strong and computationally simple entanglement criterion. The criterion is based on an elementary positive map Phi which operates on state spaces with even dimension N >= 4. It is shown that Phi detects many entangled states…
We show that multipartite quantum states that have a positive partial transpose with respect to all bipartitions of the particles can outperform separable states in linear interferometers. We introduce a powerful iterative method to find…
We present a generalized partial transposition separability criterion for the density matrix of a multipartite quantum system. This criterion comprises as special cases the famous Peres-Horodecki criterion and the recent realignment…
This research introduces the concept of the purity number, which represents the number of separable s-particle sub-states within an n-particle state ($s<n$ ). It establishes that, for any , achieving the maximum purity number is both a…
The problem of determining whether a given quantum state is entangled lies at the heart of quantum information processing, which is known to be an NP-hard problem in general. Despite the proposed many methods such as the positive partial…
Finding the closest separable state to a given target state is a notoriously difficult task, even more difficult than deciding whether a state is entangled or separable. To tackle this task, we parametrize separable states with a neural…
We show that the convex set of separable mixed states of the 2 x 2 system is a body of constant height. This fact is used to prove that the probability to find a random state to be separable equals 2 times the probability to find a random…