Related papers: A universal framework for entanglement detection u…
In a multipartite scenario quantum entanglement manifests its most dramatic form when the state is genuinely entangled. Such a state is more beneficial for information theoretic applications if it contains distillable entanglement in every…
Positive maps applied to a subsystem of a bipartite quantum state constitute a central tool in characterising entanglement. In the multipartite case, however, the direct application of a positive but not completely positive map cannot…
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…
We show that all quantum states that do not have a positive partial transpose are distillable via channels, which preserve the positivity of the partial transpose. The question whether NPT bound entanglement exist is therefore closely…
We analyze a class of positive partial transpose states (PPT) such that the positivity of its partial transposition is recognized with respect to canonical factorization of the original density operator (Cholesky block decomposition). We…
Ever since entanglement was identified as a computational and cryptographic resource, researchers have sought efficient ways to tell whether a given density matrix represents an unentangled, or separable, state. This paper gives the first…
In bipartite quantum systems of dimension 3x3 entangled states that are positive under partial transposition (PPT) can be constructed with the use of unextendible product bases (UPB). As discussed in a previous publication all the lowest…
It is known how to construct, in a bipartite quantum system, a unique low rank entangled mixed state with positive partial transpose (a PPT state) from an unextendible product basis (a UPB), defined as an unextendible set of orthogonal…
The bipartite entanglement of a pure quantum state is known to be characterized by its Schmidt decomposition. In particular the state is maximally entangled when all the Schmidt coefficients are equal. We point out a convenient method which…
Efficiently detecting entanglement based on measurable quantities is a basic problem for quantum information processing. Recently, the measurable quantities called partial-transpose (PT)-moments have been proposed to detect and characterize…
We construct a class of entangled states in $\mathcal{H}=\mathcal{H}_{A}\otimes\mathcal{H}_{B}\otimes\mathcal{H}_{C}$ quantum systems with $dim\mathcal{H}_{A}=dim\mathcal{H}_{B}=dim\mathcal{H}_{C}=2$ and classify those states with respect…
Genuine high-dimensional entanglement, i.e. the property of having a high Schmidt number, constitutes a resource in quantum communication, overcoming limitations of low-dimensional systems. States with a positive partial transpose (PPT), on…
We investigate conditions on a finite set of multi-partite product vectors for which separable states with corresponding product states have unique decomposition, and show that this is true in most cases if the number of product vectors is…
According to usual definitions, entangled states cannot be given a separable decomposition in terms of products of local density operators. If we relax the requirement that the local density operators be positive, then an entangled quantum…
Multipartite entanglement has been widely regarded as key resources in distributed quantum computing, for instance, multi-party cryptography, measurement based quantum computing, quantum algorithms. It also plays a fundamental role in…
Experimental detection of entanglement of an arbitrary state of a given bipartite system is crucial for exploring many areas of quantum information. But such a detection should be made in a device independent way if the preparation process…
We give a new separability criterion, a necessary condition for separability of $N$-partite quantum states. The criterion is based on the Bloch representation of a $N$-partite quantum state and makes use of multilinear algebra, in…
Ever since entanglement was identified as a computational and cryptographic resource, effort has been made to find an efficient way to tell whether a given density matrix represents an unentangled, or separable, state. Essentially, this is…
One of the most important questions in quantum information theory is the so-called separability problem. It involves characterizing the set of separable (or, equivalently entangled) states among mixed states of a multipartite quantum…
In this paper we present a necessary and sufficient condition of distinguishability of bipartite quantum states. It is shown that the operators to reliably distinguish states need only rounds of projective measurements and classical…