Related papers: Separability for Weak Irreducible matrices

It is shown that any separable state on Hilbert space ${\cal H}={\cal H}_1\otimes{\cal H}_2$, can be written as a convex combination of N pure product states with $N\leq (dim{\cal H})^2$. Then a new separability criterion for mixed states…

In this paper, we consider a subclass of quantum states in the multipartite system, namely, the supersymmetric states. We investigate the problem whether they admit the symmetrically separable decomposition, i.e., each term in this…

A quantum system consisting of two subsystems is separable if its density matrix can be written as $\rho=\sum_A w_A\,\rho_A'\otimes\rho_A''$, where $\rho_A'$ and $\rho_A''$ are density matrices for the two subsytems. In this Letter, it is…

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…

We investigate the canonical forms of positive partial transposition (PPT) density matrices in ${\cal C}^2 \otimes {\cal C}^M \otimes {\cal C}^N$ composite quantum systems with rank $N$. A general expression for these PPT states are…

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…

For any prime p, we construct, and simultaneously count, all of the complex Specht modules in a given p-block of the symmetric group which remain irreducible when reduced modulo p. We call the Specht modules with this property p-irreducible…

Matrices are built and designed by applying procedures from lower order matrices. Matrix tensor products, direct sums or multiplication of matrices are such procedures and a matrix built from these is said to be a {\em separable} matrix. A…

In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…

A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…

We give sufficient conditions on a matrix A ensuring the existence of a partition of this matrix into two submatrices with extremely small norm of the image of any vector. Under some weak conditions on a matrix A we obtain a partition of A…

We show that all $2\otimes 4$ states with strong positive partial transposes (SPPT) are separable. We also construct a family of $2\otimes 5$ entangled SPPT states, so the conjecture on the separability of SPPT states are completely…

In this work, we present a method to exponentiate non-sparse indefinite low-rank matrices on a quantum computer. Given an operation for accessing the elements of the matrix, our method allows singular values and associated singular vectors…

Employing a recently proposed separability criterion we develop analytical lower bounds for the concurrence and for the entanglement of formation of bipartite quantum systems. The separability criterion is based on a nondecomposable…

This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…

The decision problems on matrices were intensively studied for many decades as matrix products play an essential role in the representation of various computational processes. However, many computational problems for matrix semigroups are…

We study the separability of bipartite quantum systems in arbitrary dimensions using the Bloch representation of their density matrix. This approach enables us to find an alternative characterization of the separability problem, from which…

Reduced density matrices are a powerful tool in the analysis of entanglement structure, approximate or coarse-grained dynamics, decoherence, and the emergence of classicality. It is straightforward to produce a reduced density matrix with…

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…

We investigate the separability of quantum states based on covariance matrices. Separability criteria are presented for multipartite states. The lower bound of concurrence proposed in Phys. Rev. A. 75, 052320 (2007) is improved by…