Related papers: Separability criteria based on the realignment of …
We show that any state which violates the computable cross norm (or realignment) criterion for separability also violates the separability criterion of the local uncertainty relations. The converse is not true. The local uncertainty…
We consider the entanglement marginal problem, which consists of deciding whether a number of reduced density matrices are compatible with an overall separable quantum state. To tackle this problem, we propose hierarchies of semidefinite…
Quantum entanglement plays a key role in quantum computation and quantum information processing. It is of great significance to find efficient and experimentally friend separability criteria to detect entanglement. In this paper, we firstly…
Separability criteria are typically of the necessary, but not sufficient, variety, in that satisfying some separability criterion, such as positivity of eigenvalues under partial transpose, does not strictly imply separability. Certifying…
We express the optimization of entanglement witnesses for arbitrary bipartite states in terms of a class of convex optimization problems known as Robust Semidefinite Programs (RSDP). We propose, using well known properties of RSDP, several…
This article introduces an iterative method for solving nonsingular non-Hermitian positive semidefinite systems of linear equations. To construct the iteration process, the coefficient matrix is split into two non-Hermitian positive…
We study geometrical aspects of entanglement, with the Hilbert--Schmidt norm defining the metric on the set of density matrices. We focus first on the simplest case of two two-level systems and show that a ``relativistic'' formulation leads…
A general and computable criterion for k-(in)separability in continuous multipartite quantum systems is presented. The criterion can be experimentally implemented with a finite and comparatively low number of local observables. We discuss…
For finite-dimensional bipartite quantum systems, we find the exact size of the largest balls, in spectral $l_p$ norms for $1 \le p \le \infty$, of separable (unentangled) matrices around the identity matrix. This implies a simple and…
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…
Inseparability criteria for continuous and discrete bipartite quantum states based on moments of annihilation and creation operators are studied by developing the idea of Shchukin-Vogel criterion [Phys. Rev. Lett. {\bf 95}, 230502 (2005)].…
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…
We present three necessary separability criteria for bipartite mixed states, the violation of each of these conditions is a sufficient condition for entanglement. Some ideas on the issue of finding a necessary and sufficient criterion of…
Mutually unbiased measurements (MUMs) are generalized from the concept of mutually unbiased bases (MUBs) and include the complete set of MUBs as a special case, but they are superior to MUBs as they do not need to be rank one projectors. We…
We reduce the question whether a given quantum mixed state is separable or entangled to the problem of existence of a certain full family of commuting normal matrices whose matrix elements are partially determined by components of the pure…
We derive a combinatorial criterion for detecting k-separability of N-partite Dicke states. The criterion is efficiently computable and implementable without full state tomography. We give examples in which the criterion succeeds, where…
We derive a collection of separability conditions for bipartite systems of dimensions d X d which is based on the entropic version of the uncertainty relations. A detailed analysis of the two-qubit case is given by comparing the new…
Detecting multipartite quantum coherence usually requires quantum state reconstruction, which is quite inefficient for large-scale quantum systems. Along this line of research, several efficient procedures have been proposed to detect…
To determine whether a given multipartite quantum state is separable with respect to some partition we construct a family of entanglement measures R_m. This is done utilizing generalized concurrences as building blocks which are defined by…
We investigate the detection of entanglement in $n$-partite quantum states. We obtain practical separability criteria to identify genuinely entangled and non-separable mixed quantum states. No numerical optimization or eigenvalue evaluation…