Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1311.7275 · Quantum Information and Computation

Separability for weakly irreducible matrices

Daniel Cariello

Published Nov 1, 2014• 16 citations
arXivHTMLPDF

Abstract

This paper is devoted to the study of the separability problem in the field of Quantum information theory. We focus on the bipartite finite dimensional case and on two types of matrices: SPC and PPT matrices (see definitions 32 and 33). We prove that many results hold for both types. If these matrices have specific Hermitian Schmidt decompositions then they are separable in a very strong sense (see theorem 38 and corollary 39). We prove that both types have what we call \textbf{split decompositions} (see theorems 41 and 42). We also define the notion of weakly irreducible matrix (see definition 43), based on the concept of irreducible state defined recently in \cite{chen1}, \cite{chen} and \cite{chen2}.}{These split decomposition theorems imply that every SPC $($PPT$)$ matrix can be decomposed into a sum of $s+1$ SPC $($PPT$)$ matrices of which the first $s$ are weakly irreducible, by theorem 48, and the last one has a further split decomposition of lower tensor rank, by corollary 49. Thus the SPC $($PPT$)$ matrix is decomposed in a finite number of steps into a sum of weakly irreducible matrices. Different components of this sum have support on orthogonal local Hilbert spaces, therefore the matrix is separable if and only if each component is separable. This reduces the separability problem for SPC $($PPT$)$ matrices to the case of weakly irreducible SPC $($PPT$)$ matrices. We also provide a complete description of weakly irreducible matrices of both types (see theorem 46).}{Using the fact that every positive semidefinite Hermitian matrix with tensor rank 2 is separable (see theorem 58), we found sharp inequalites providing separability for both types (see theorems 61 and 62).

DOI
10.26421/qic14.15-16-4

Related papers

Does symmetry Imply PPT Property?

Daniel Cariello

Recently it was proved that many results that are true for density matrices which are positive under partial transposition (or simply PPT), also hold for another class of matrices with a certain symmetry in their Hermitian Schmidt decompositions. These matrices were called symmetric with positive coefficients (or simply SPC). A natural question appeared: What is the connection between SPC matrices and PPT matrices? Is every SPC matrix PPT? Here we show that every SPC matrix is PPT in $M_2\otimes M_2$. This theorem is a consequence of the fact that every density matrix in $M_2\otimes M_m$, with tensor rank smaller or equal to 3, is separable. Although, in $M_3\otimes M_3$, we present an example of SPC matrix with tensor rank 3 that is not PPT. We shall also provide a non trivial example of a family of matrices in $M_k\otimes M_k$, in which both, the SPC and PPT properties, are equivalent. Within this family, there exists a non trivial subfamily in which the SPC property is equivalent to separability.

arXiv:1405.3634•Quantum Information and Computation•Jul 1, 2015•7 citations

Separability of Hermitian tensors and PSD decompositions

Mareike Dressler, Jiawang Nie, Zi Yang

Hermitian tensors are natural generalizations of Hermitian matrices, while possessing rather different properties. A Hermitian tensor is separable if it has a Hermitian decomposition with only positive coefficients, i.e. it is a sum of rank-1 psd Hermitian tensors. This paper studies how to detect the separability of Hermitian tensors. It is equivalent to the long-standing quantum separability problem in quantum physics, which asks to tell if a given quantum state is entangled or not. We formulate this as a truncated moment problem and then provide a semidefinite relaxation algorithm to solve it. Moreover, we study psd decompositions of separable Hermitian tensors. When the psd rank is low, we first flatten them into cubic order tensors and then apply tensor decomposition methods to compute psd decompositions. We prove that this method works well if the psd rank is low. In computation, this flattening approach can detect the separability for much larger-sized Hermitian tensors. This method is a good starting point to determine psd ranks of separable Hermitian tensors.

arXiv:2011.08132•Linear and Multilinear Algebra•Aug 27, 2021•11 citations

A conjecture on the absolute separability of eight by eight positive semi-definite matrices

Mark Yutong Zhao

The separability problem, a long-standing open challenge in mathematics and quantum information theory. In this work, we propose and investigate a conjecture as a sub-question of the separability problem. Specifically, we investigate whether the form is separable for any eight-dimensional unit vector . This is actually the so-called absolute separability problem. For studying the conjecture, we classify the vectors in a finitely-dimensional bipartite Hilbert space, and construct their equivalence classes in terms of the so-called Schmidt rank, under both product general linear and product linear groups. Then we construct seven equivalence classes of , using which we partially prove the conjecture. Our results highlight the the complexity of the difference between bipartite and tripartite spaces.

Transactions on Computer Science and Intelligent Systems Research•Aug 13, 2026•0 citations

Another dual formulation of the separability problem

Salgado, D., J. L. Sánchez‐Gómez, Miguel Ferrero

We show how the separability problem is dual to that of decomposing any given matrix into a conic combination of rank-one partial isometries, thus offering a duality approach different to the positive maps characterization problem. Several inmediate consequences are analyzed: (i) a sufficient criterion for separability for bipartite quantum systems, (ii) a complete solution to the separability problem for pure states also of bipartite systems independent of the classical Schmidt decomposition method and (iii) a natural generalization of these results to multipartite systems.

arXiv:quant-ph/0509124•Sep 19, 2005•0 citations

Analytical techniques on multilinear problems

Daniel Cariello

This Ph.D. dissertation mainly focuses on three multilinear problems and itsaimistodescribe analytical and topological techniques that we found useful to tackle these problems. The first problem comes from Quantum Information theory, it is the so-called the Separability Problem, and the other two were proposed by Gurariy. Let Mk denote the set of complex matrices of order k and let Pk be the set of positive semidefinite Hermitian matrices of Mk. The aim of this problem is to find a deterministic criterion to distinguish the separable states from the entangled states. In this work we shall only deal with the bipartite finite dimensional case, therefore the states are elements in the tensor product space Mk ⊗Mm. We say that B ∈ Mk ⊗Mm is separable if B =Σin=1 Ci ⊗Di, where Ci ∈ Pk and Di ∈ Pm, for every i. If B is not separable then B is entangled. Denote by VMkV the set {V XV,X ∈ Mk}, where V ∈ Mk is an orthogonal projection. We say that a linear transformation T :VMkV →WMmW is a positive map, if T(Pk ∩VMkV )⊂ Pm ∩WMmW. We say that a non null positive map T : VMkV →VMkV is irreducible if V ′ MkV ′ ⊂ VMkV is such that T(V ′ MkV ′)⊂ V ′ MkV ′ then V ′ = V or V ′ = 0. Let us say that T : VMkV → VMkV is a completely reducible map, if it is a positive map and if there are orthogonal projections V1,...,Vs ∈ Mk such that ViVj = 0 (i ≠ j), ViV = Vi (1 ≤ i ≤ s), VMkV = V1MkV1 ⊕ ... ⊕ VsMkVs ⊕ R, R ⊥ V1MkV1 ⊕ ... ⊕ VsMkVs satisfying: T(ViMkVi)⊂ ViMkVi (1 ≤ i ≤ s), TSis irreducible (1 ≤ i ≤ s), TSR ≡ 0. Let A =Σni=1 Ai ⊗Bi ∈ Mk ⊗Mm. Define GA : Mk →Mm, as GA(X)=Σni=1 tr(AiX)Bi and FA : Mm → Mk, as FA(X)=Σin=1 tr(BiX)Ai. Our main results are the following: If A ∈ Mk ⊗Mm is positive under partial transposition (PPT) or symmetric with positive coefficients (SPC) or invariant under realignment then FA ○GA : Mk → Mk is completely reducible...

•Sep 16, 2016•3 citations

Separability for mixed states with operator Schmidt rank two

Gemma De las Cuevas, Tom Drescher, Tim Netzer

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, and can be written as a sum of two positive semidefinite matrices per site. Our proof uses results from the theory of free spectrahedra and operator systems, and illustrates the use of a connection between decompositions of quantum states and decompositions of nonnegative matrices. In the multipartite case, we prove that any Hermitian Matrix Product Density Operator (MPDO) of bond dimension two is separable, and can be written as a sum of at most four positive semidefinite matrices per site. This implies that these states can only contain classical correlations, and very few of them, as measured by the entanglement of purification. In contrast, MPDOs of bond dimension three can contain an unbounded amount of classical correlations.

arXiv:1903.05373•Quantum•Dec 2, 2019•11 citations
This paper is devoted to the study of the separability problem in the field of Quantum information theory. We focus on the bipartite finite dimensional case and on two types of matrices: SPC and PPT matrices (see definitions 32 and 33). We prove that many results hold for both types. If these matrices have specific Hermitian Schmidt decompositions then they are separable in a very strong sense (see theorem 38 and corollary 39). We prove that both types have what we call \textbf{split decompositions} (see theorems 41 and 42). We also define the notion of weakly irreducible matrix (see definition 43), based on the concept of irreducible state defined recently in \cite{chen1}, \cite{chen} and \cite{chen2}.}{These split decomposition theorems imply that every SPC (((PPT))) matrix can be decomposed into a sum of s+1s+1s+1 SPC (((PPT))) matrices of which the first sss are weakly irreducible, by theorem 48, and the last one has a further split decomposition of lower tensor rank, by corollary 49. Thus the SPC (((PPT))) matrix is decomposed in a finite number of steps into a sum of weakly irreducible matrices. Different components of this sum have support on orthogonal local Hilbert spaces, therefore the matrix is separable if and only if each component is separable. This reduces the separability problem for SPC (((PPT))) matrices to the case of weakly irreducible SPC (((PPT))) matrices. We also provide a complete description of weakly irreducible matrices of both types (see theorem 46).}{Using the fact that every positive semidefinite Hermitian matrix with tensor rank 2 is separable (see theorem 58), we found sharp inequalites providing separability for both types (see theorems 61 and 62).
Recently it was proved that many results that are true for density matrices which are positive under partial transposition (or simply PPT), also hold for another class of matrices with a certain symmetry in their Hermitian Schmidt decompositions. These matrices were called symmetric with positive coefficients (or simply SPC). A natural question appeared: What is the connection between SPC matrices and PPT matrices? Is every SPC matrix PPT? Here we show that every SPC matrix is PPT in M2⊗M2M_2\otimes M_2M2​⊗M2​. This theorem is a consequence of the fact that every density matrix in M2⊗MmM_2\otimes M_mM2​⊗Mm​, with tensor rank smaller or equal to 3, is separable. Although, in M3⊗M3M_3\otimes M_3M3​⊗M3​, we present an example of SPC matrix with tensor rank 3 that is not PPT. We shall also provide a non trivial example of a family of matrices in Mk⊗MkM_k\otimes M_kMk​⊗Mk​, in which both, the SPC and PPT properties, are equivalent. Within this family, there exists a non trivial subfamily in which the SPC property is equivalent to separability.
Hermitian tensors are natural generalizations of Hermitian matrices, while possessing rather different properties. A Hermitian tensor is separable if it has a Hermitian decomposition with only positive coefficients, i.e. it is a sum of rank-1 psd Hermitian tensors. This paper studies how to detect the separability of Hermitian tensors. It is equivalent to the long-standing quantum separability problem in quantum physics, which asks to tell if a given quantum state is entangled or not. We formulate this as a truncated moment problem and then provide a semidefinite relaxation algorithm to solve it. Moreover, we study psd decompositions of separable Hermitian tensors. When the psd rank is low, we first flatten them into cubic order tensors and then apply tensor decomposition methods to compute psd decompositions. We prove that this method works well if the psd rank is low. In computation, this flattening approach can detect the separability for much larger-sized Hermitian tensors. This method is a good starting point to determine psd ranks of separable Hermitian tensors.
The separability problem, a long-standing open challenge in mathematics and quantum information theory. In this work, we propose and investigate a conjecture as a sub-question of the separability problem. Specifically, we investigate whether the form is separable for any eight-dimensional unit vector . This is actually the so-called absolute separability problem. For studying the conjecture, we classify the vectors in a finitely-dimensional bipartite Hilbert space, and construct their equivalence classes in terms of the so-called Schmidt rank, under both product general linear and product linear groups. Then we construct seven equivalence classes of , using which we partially prove the conjecture. Our results highlight the the complexity of the difference between bipartite and tripartite spaces.
We show how the separability problem is dual to that of decomposing any given matrix into a conic combination of rank-one partial isometries, thus offering a duality approach different to the positive maps characterization problem. Several inmediate consequences are analyzed: (i) a sufficient criterion for separability for bipartite quantum systems, (ii) a complete solution to the separability problem for pure states also of bipartite systems independent of the classical Schmidt decomposition method and (iii) a natural generalization of these results to multipartite systems.
This Ph.D. dissertation mainly focuses on three multilinear problems and itsaimistodescribe analytical and topological techniques that we found useful to tackle these problems. The first problem comes from Quantum Information theory, it is the so-called the Separability Problem, and the other two were proposed by Gurariy. Let Mk denote the set of complex matrices of order k and let Pk be the set of positive semidefinite Hermitian matrices of Mk. The aim of this problem is to find a deterministic criterion to distinguish the separable states from the entangled states. In this work we shall only deal with the bipartite finite dimensional case, therefore the states are elements in the tensor product space Mk ⊗Mm. We say that B ∈ Mk ⊗Mm is separable if B =Σin=1 Ci ⊗Di, where Ci ∈ Pk and Di ∈ Pm, for every i. If B is not separable then B is entangled. Denote by VMkV the set {V XV,X ∈ Mk}, where V ∈ Mk is an orthogonal projection. We say that a linear transformation T :VMkV →WMmW is a positive map, if T(Pk ∩VMkV )⊂ Pm ∩WMmW. We say that a non null positive map T : VMkV →VMkV is irreducible if V ′ MkV ′ ⊂ VMkV is such that T(V ′ MkV ′)⊂ V ′ MkV ′ then V ′ = V or V ′ = 0. Let us say that T : VMkV → VMkV is a completely reducible map, if it is a positive map and if there are orthogonal projections V1,...,Vs ∈ Mk such that ViVj = 0 (i ≠ j), ViV = Vi (1 ≤ i ≤ s), VMkV = V1MkV1 ⊕ ... ⊕ VsMkVs ⊕ R, R ⊥ V1MkV1 ⊕ ... ⊕ VsMkVs satisfying: T(ViMkVi)⊂ ViMkVi (1 ≤ i ≤ s), TSis irreducible (1 ≤ i ≤ s), TSR ≡ 0. Let A =Σni=1 Ai ⊗Bi ∈ Mk ⊗Mm. Define GA : Mk →Mm, as GA(X)=Σni=1 tr(AiX)Bi and FA : Mm → Mk, as FA(X)=Σin=1 tr(BiX)Ai. Our main results are the following: If A ∈ Mk ⊗Mm is positive under partial transposition (PPT) or symmetric with positive coefficients (SPC) or invariant under realignment then FA ○GA : Mk → Mk is completely reducible...
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, and can be written as a sum of two positive semidefinite matrices per site. Our proof uses results from the theory of free spectrahedra and operator systems, and illustrates the use of a connection between decompositions of quantum states and decompositions of nonnegative matrices. In the multipartite case, we prove that any Hermitian Matrix Product Density Operator (MPDO) of bond dimension two is separable, and can be written as a sum of at most four positive semidefinite matrices per site. This implies that these states can only contain classical correlations, and very few of them, as measured by the entanglement of purification. In contrast, MPDOs of bond dimension three can contain an unbounded amount of classical correlations.