We give necessary and sufficient conditions under which a density matrix acting on a two-fold tensor product space is separable. Our conditions are given in terms of quantum conditional information transmission.
A quantum system consisting of two subsystems is separable if its density matrix can be written as $\ensuremath{\rho}\phantom{\rule{0ex}{0ex}}=\phantom{\rule{0ex}{0ex}}\ensuremath{\Sigma}{A}^{}{w}_{A}{\ensuremath{\rho}}_{A}^{\ensuremath{'}}\ensuremath{\bigotimes}{\ensuremath{\rho}}_{A}^{\ensuremath{'}\ensuremath{'}},$ where ${\ensuremath{\rho}}_{A}^{\ensuremath{'}}$ and ${\ensuremath{\rho}}_{A}^{\ensuremath{'}\ensuremath{'}}$ are density matrices for the two subsystems, and the positive weights wA satisfy $\ensuremath{\Sigma}{w}_{A}\phantom{\rule{0ex}{0ex}}=\phantom{\rule{0ex}{0ex}}1$. In this Letter, it is proved that a necessary condition for separability is that a matrix, obtained by partial transposition of \ensuremath{\rho}, has only non-negative eigenvalues. Some examples show that this criterion is more sensitive than Bell's inequality for detecting quantum inseparability.
The state that an observer attributes to a quantum system depends on the information available to that observer. If two or more observers have different information about a single system, they will in general assign different states. Is there any restriction on what states can be assigned, given reasonable assumptions about how the observers use their information? We derive necessary and sufficient conditions for a group of general density matrices to characterize what different people may know about one and the same physical system. These conditions are summarized by a single criterion, which we term compatibility.
Separability of Rank-Two Quantum States in CM⊗CN Composite Quantum Systems
We investigate separability of Laplacian matrices of graphs when seen as density matrices. This is a family of quantum states with many combinatorial properties. We firstly show that the well-known matrix realignment criterion can be used to test separability of this type of quantum states. The criterion can be interpreted as novel graph-theoretic idea. Then, we prove that the density matrix of the tensor product of N graphs is N-separable. However, the converse is not necessarily true. Additionally, we derive a sufficient condition for N-partite entanglement in star graphs and propose a necessary and sufficient condition for separability of nearest point graphs.