Related papers: Separability for Weak Irreducible matrices
In this paper we discuss the notion of reducibility for matrix weights and introduce a real vector space $\mathcal C_\mathbb{R}$ which encodes all information about the reducibility of $W$. In particular a weight $W$ reduces if and only if…
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…
We consider $p$-weak differentiable structures that were recently introduced by the first and last named authors, and prove that the product of $p$-weak charts is a $p$-weak chart. This implies that the product of two spaces with a $p$-weak…
A new layers method is presented for multipartite separability of density matrices from simple graphs. Full separability of tripartite states is studied for graphs on degree symmetric premise. The models are generalized to multipartite…
We express the positive partial transpose (PPT) separability criterion for symmetric states of multi-qubit systems in terms of matrix inequalities based on the recently introduced tensor representation for spin states. We construct a matrix…
We consider the problem of separability: decide whether a Hermitian operator on a finite dimensional Hilbert tensor product is separable or entangled. We show that the tensor convolution defined for certain mappings on an almost arbitrary…
We construct a density matrix whose elements are written in terms of expectation values of non-Hermitian operators and their products for arbitrary dimensional bipartite states. We then show that any expression which involves matrix…
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…
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)$…
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…
Positivity of the density operator reflects itself in terms of sequences of inequalities on observable moments. Uncertainty relations for non-commuting observables form a subset of these inequalities. In addition, criterion of positivity…
A general separability condition on the second moment (covariance matrix) for continuous variable two-party systems is derived by an analysis analogous to the derivation of the Kennard's uncertainty relation without referring to the…
We consider low rank density operators $\varrho$ supported on a $M\times N$ Hilbert space for arbitrary $M$ and $N$ ($M\leq N$) and with a positive partial transpose (PPT) $\varrho^{T_A}\ge 0$. For rank $r(\varrho) \leq N$ we prove that…
A set of linearly constrained permutation matrices are proposed for constructing a class of permutation codes. Making use of linear constraints imposed on the permutation matrices, we can formulate a minimum Euclidian distance decoding…
We search for faces of the convex set consisting of all separable states, which are affinely isomorphic to simplices, to get separable states with unique decompositions. In the two-qutrit case, we found that six product vectors spanning a…
This paper concerns matrix decompositions in which the factors are restricted to lie in a closed subvariety of a matrix group. Such decompositions are of relevance in control theory: given a target matrix in the group, can it be decomposed…
We introduce with geometric means a density matrix decomposition of a multipartite quantum system of a finite dimension into two density matrices: a separable one, also known as the best separable approximation, and an essentially entangled…
We present a quasipolynomial-time algorithm for solving the weak membership problem for the convex set of separable, i.e. non-entangled, bipartite density matrices. The algorithm decides whether a density matrix is separable or whether it…
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…
We investigate invertible matrices over finite additively idempotent semirings. The main result provides a criterion for the invertibility of such matrices. We also give a construction of the inverse matrix and a formula for the number of…