Related papers: Sufficient criteria for absolute separability in a…
In the convex set of all $3\ot 3$ states with positive partial transposes, we show that one can take two extreme points whose convex combinations belong to the interior of the convex set. Their convex combinations may be even in the…
The equivalence between absolutely separable states and absolutely positive partial transposed (PPT) states in general remains an open problem in quantum entanglement theory. In this work, we study an analogous question for symmetric…
The set of all separable quantum states is compact and convex. We focus on the two-qubit quanum system and study the boundary of the set. Then we give the criterion to determine whether a separable state is on the boundary. Some…
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…
Let $H$ and $K$ be (finite or infinite dimensional) complex Hilbert spaces. A characterization of positive completely bounded normal linear maps from ${\mathcal B}(H)$ into ${\mathcal B}(K)$ is given, which particularly gives a…
Absolutely separable states $\varrho$ remain separable under arbitrary unitary transformations $U \varrho U^{\dag}$. By example of a three qubit system we show that in multipartite scenario neither full separability implies bipartite…
One of the most fundamental questions in quantum information theory is PPT-entanglement of quantum states, which is an NP-hard problem in general. In this paper, however, we prove that all PPT $(\overline{\pi}_A\otimes \pi_B)$-invariant…
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…
We introduce a generalization of the set of completely positive matrices that we call "pairwise completely positive" (PCP) matrices. These are pairs of matrices that share a joint decomposition so that one of them is necessarily positive…
We deal with linear programming problems involving absolute values in their formulations, so that they are no more expressible as standard linear programs. The presence of absolute values causes the problems to be nonconvex and nonsmooth,…
Linear maps preserving pure states of a quantum system of any dimension are characterized. This is then used to establish a structure theorem for linear maps that preserve separable pure states in multipartite systems. As an application, a…
We introduce a new family of separability criteria that are based on the existence of extensions of a bipartite quantum state $\rho$ to a larger number of parties satisfying certain symmetry properties. It can be easily shown that all…
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…
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…
Recently, a new and powerful separability criterion was introduced in [O. Rudolph, quant-ph/0202121] and [Chen {\it et al.}, quant-ph/0205017]. Composing the main idea behind the above criterion and the necessary and sufficient condition in…
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…
In this paper, a characterization of maps between quantum states that preserve pure states and strict convex combinations is obtained. Based on this characterization, a structural theorem for maps between multipartite quantum states that…
We construct faces of the convex set of all $2\otimes 4$ bipartite separable states, which are affinely isomorphic to the simplex $\Delta_{9}$ with ten extreme points. Every interior point of these faces is a separable state which has a…
Physical transformations are described by linear maps that are completely positive and trace preserving (CPTP). However, maps that are positive (P) but not completely positive (CP) are instrumental to derive separability/entanglement…
The absolute separability problem asks for a characterization of the quantum states $\rho \in M_m\otimes M_n$ with the property that $U\rho U^\dagger$ is separable for all unitary matrices $U$. We investigate whether or not it is the case…