Related papers: A complete family of separability criteria
One of the most important problems in quantum information is the separability problem, which asks whether a given quantum state is separable. We investigate multipartite states of rank at most four which are PPT (i.e., all their partial…
Entanglement, or quantum inseparability, is a crucial resource in quantum information applications, and therefore the experimental generation of separated yet entangled systems is of paramount importance. Experimental demonstrations of…
Modern applications in quantum computation and quantum communication require the precise characterization of quantum states and quantum channels. In practice, this means that one has to determine the quantum capacity of a physical system 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…
Quantum entanglement serves as a fundamental resource in quantum information theory. This paper presents a comprehensive framework of separability criteria for detecting bipartite and multipartite entanglements. We construct a novel…
We analyze a class of entangled states for bipartite $d \otimes d$ systems, with $d$ non-prime. The entanglement of such states is revealed by the construction of canonically associated entanglement witnesses. The structure of the states is…
By combining a parameterized Hermitian matrix, the realignment matrix of the bipartite density matrix $\rho$ and the vectorization of its reduced density matrices, we present a family of separability criteria, which are stronger than the…
We provide necessary and sufficient conditions for the partial transposition of bipartite harmonic quantum states to be nonnegative. The conditions are formulated as an infinite series of inequalities for the moments of the state under…
The separability detecting problem of mixed states is one of the fundamental problems in quantum information theory. In the last 20 years, almost all methods are based on the sufficient or necessary conditions for entanglement. However, in…
We study the separability of bipartite quantum systems in arbitrary dimensions based on the Bloch representation of density matrices. We present two separability criteria for quantum states in terms of the matrices $T_{\alpha\beta}(\rho)$…
Multipartite entanglement is the key resource allowing quantum devices to outperform their classical counterparts, and entanglement certification is fundamental to assess any quantum advantage. The only scalable certification scheme relies…
Absolutely separable states form a special subset of the set of all separable states, as they remain separable under any global unitary transformation unlike other separable states. In this work we consider the set of absolutely separable…
Werner states are multipartite quantum states that are invariant under the diagonal conjugate action of the unitary group. This paper gives a complete characterization of their entanglement that is independent of the underlying local…
We give a criterion for a positive mapping on the space of operators on a Hilbert space to be indecomposable. We show that this criterion can be applied to two families of positive maps. These families of maps can then be used to form…
We present a method to derive separability criteria for the different classes of multiparticle entanglement, especially genuine multiparticle entanglement. The resulting criteria are necessary and sufficient for certain families of states.…
We propose a sufficient and necessary separability criterion for pure states in multipartite and high dimensional systems. Its main advantage is operational and computable. The obvious expressions of this criterion can be given out by the…
We present a stronger version of the Doherty-Parrilo-Spedalieri (DPS) hierarchy of approximations for the set of separable states. Unlike DPS, our hierarchy converges exactly at a finite number of rounds for any fixed input dimension. This…
We propose an algorithm which proves a given bipartite quantum state to be separable in a finite number of steps. Our approach is based on the search for a decomposition via a countable subset of product states, which is dense within all…
We introduce algebriac sets in the products of complex projective spaces for multipartite mixed states, which are independent of their eigenvalues and only measure the "position" of their eigenvectors, as their non-local invariants (ie.…
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…