Related papers: Separability for Weak Irreducible matrices

We present separability criteria for both bipartite and multipartite quantum states. These criteria include the criteria based on the correlation matrix and its generalized form as special cases. We show by detailed examples that our…

This paper proposes a novel matrix rank-one decomposition for quaternion Hermitian matrices, which admits a stronger property than the previous results in (sturm2003cones,huang2007complex,ai2011new). The enhanced property can be used to…

Correlation matrices (positive semidefinite matrices with ones on the diagonal) are of fundamental interest in quantum information theory. In this work we introduce and study the set of $r$-decomposable correlation matrices: those that can…

We study a nonlinear decomposition of a positive definite matrix into two components: the inverse of another positive definite matrix and a symmetric matrix constrained to lie in a prescribed linear subspace. Equivalently, the inverse…

The operator Schmidt rank is the minimum number of terms required to express a state as a sum of elementary tensor factors. Here we provide a new proof of the fact that any bipartite mixed state with operator Schmidt rank two is separable,…

We consider the separability of rank two quantum states on multiple quantum spaces with different dimensions. The sufficient and necessary conditions for separability of these multiparty quantum states are explicitly presented. A…

We study families of positive and completely positive maps acting on a bipartite system $\mathbb{C}^M\otimes \mathbb{C}^N$ (with $M\leq N$). The maps have a property that when applied to any state (of a given entanglement class) they result…

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 propose necessary and sufficient conditions for an integer matrix to be decomposable in terms of its Hermite normal form. Specifically, to each integer matrix of maximal row rank without columns of zeros, we associate a symmetric whole…

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…

The detection and estimation of quantum entanglement are the essential issues in the theory of quantum entanglement. We construct matrices based on the realignment of density matrices and the vectorization of the reduced density matrices,…

Schmidt decomposition is a powerful tool in quantum information. While Schmidt decomposition is universal for bipartite states, its not for multipartite states. In this article, we review properties of bipartite Schmidt decompositions and…

Given a set of integers W, the Partition problem determines whether W can be divided into two disjoint subsets with equal sums. We model the Partition problem as a system of polynomial equations, and then investigate the complexity of a…

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…

Explicitly separable density matrices are constructed for all separable two-qubits states based on Hilbert-Schmidt (HS) decompositions. For density matrices which include only two-qubits correlations the number of HS parameters is reduced…

The concepts of differentiation and integration for matrices are known. As far as each matrix is differentiable, it is not clear a priori whether a given matrix is integrable or not. Recently some progress was obtained for diagonalizable…

By definition a separable state has the form \sum A_i \otimes B_i, where 0 \leq A_i, B_i for each i. In this paper we consider the class of states which admit such a decomposition with B_1, ..., B_p having independent images. We give a…

The problem of determining whether a given quantum state is entangled lies at the heart of quantum information processing, which is known to be an NP-hard problem in general. Despite the proposed many methods such as the positive partial…

Motivated by the Kronecker product approximation technique, we have developed a very simple method to assess the inseparability of bipartite quantum systems, which is based on a realigned matrix constructed from the density matrix. For any…

Hermitian and unitary matrices are two representatives of the class of normal matrices whose full eigenvalue decomposition can be stably computed in quadratic computing com plexity. Recently, fast and reliable eigensolvers dealing with low…