Related papers: Separability for Weak Irreducible matrices
The quantum separability problem consists in deciding whether a bipartite density matrix is entangled or separable. In this work, we propose a machine learning pipeline for finding approximate solutions for this NP-hard problem in…
We investigate the Peres-Horodecki positive partial transpose (PPT) criterion in the context of conserved quantities and derive a condition of in- separability for a composite bipartite system depending only on the dimen- sions of its…
We introduce a class of states so-called semi-SSPPT (semi super strong positive partial transposition) states in infinite-dimensional bipartite systems by the Cholesky decomposition in terms of operator matrices and show that every…
This paper studies the problem of decomposing a low-rank matrix into a factor with binary entries, either from $\{\pm 1\}$ or from $\{0,1\}$, and an unconstrained factor. The research answers fundamental questions about the existence and…
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.
In this paper, we give out some effective criterions which can be used to judge the separability of multipartite pure states. We obtain the relationship between separability and Schmidt decomposable of multipartite pure states in Theorem1.…
Quantum entanglement is the core resource in quantum information processing and quantum computing. It is an significant challenge to effectively characterize the entanglement of quantum states. Recently, elegant separability criterion is…
The detection of entanglement in a bipartite state is a crucial issue in quantum information science. Based on realignment of density matrices and the vectorization of the reduced density matrices, we introduce a new set of separability…
We address two sets of long-standing open questions in probability theory, from a computational complexity perspective: divisibility of stochastic maps, and divisibility and decomposability of probability distributions. We prove that finite…
In this paper, we discuss the partial separability and its criteria problems of multipartite qubit mixed-states. First we strictly define what is the partial separability of a multipartite qubit system. Next we give a reduction way from…
It is shown that, for the block matrices belonging to $M(nd,\mathbb{C})$ with commuting and normal block entries of dimension $d$, the separability of such a block matrices is equivalent to its semi-positive definity. The separability…
We analyze a class of positive partial transpose states (PPT) such that the positivity of its partial transposition is recognized with respect to canonical factorization of the original density operator (Cholesky block decomposition). We…
We use the generalized concurrence approach to investigate the general multipartite separability problem. By extending the preconcurrence matrix formalism to arbitrary multipartite systems, we show that the separability problem can be…
We study certain quantum states for which the PPT criterion is both sufficient and necessary for separability. A class of $n\times n$ bipartite mixed states is presented and the conditions of PPT for these states are derived. The separable…
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…
In this paper, we study the separability of quantum states in bosonic system. Our main tool here is the "separability witnesses", and a connection between "separability witnesses" and a new kind of positivity of matrices--- "Power Positive…
We show how to design families of operational criteria that distinguish entangled from separable quantum states. The simplest of these tests corresponds to the well-known Peres-Horodecki positive partial transpose (PPT) criterion, and the…
Ever since entanglement was identified as a computational and cryptographic resource, researchers have sought efficient ways to tell whether a given density matrix represents an unentangled, or separable, state. This paper gives the first…
It is known that he bipartite quantum states, with rank strictly smaller than the maximum of the ranks of its two reduced states, are distillable by local operations and classical communication. Our first main result is that this is also…
We present a novel approach to the separability problem for Gaussian quantum states of bosonic continuous variable systems. We derive a simplified necessary and sufficient separability criterion for arbitrary Gaussian states of $m$ vs $n$…