Separability problem for multipartite states of rank at most 4

Abstract: One of the most important problems in quantum information is the separability problem, which asks whether a given quantum state is separable. We investigate multipartite states of rank at most four which are PPT (i.e., all their partial transposes are positive semidefinite). We show that any PPT state of rank two or three is separable and has length at most four. For separable states of rank four, we show that they have length at most six. It is six only for some qubit-qutrit or multiqubit states. It turns out that any PPT entangled state of rank four is necessarily supported on a 3x3 or a 2x2x2 subsystem. We obtain a very simple criterion for the separability problem of the PPT states of rank at most four: such a state is entangled if and only if its range contains no product vectors. This criterion can be easily applied since a four-dimensional subspace in the 3x3 or 2x2x2 system contains a product vector if and only if its Pluecker coordinates satisfy a homogeneous polynomial equation (the Chow form of the corresponding Segre variety). We have computed an explicit determinantal expression for the Chow form in the former case, while such expression was already known in the latter case.

Recommendations

Cited in
(28)

Nonexistence of n-qubit unextendible product bases of size 2ⁿ-5
The unextendible product bases of four qubits: Hasse diagrams
\(4\times 4\) unextendible product basis and genuinely entangled space
Bounding the separable rank via polynomial optimization
Unextendible product bases, bound entangled states, and the range criterion
Sinkhorn-Knopp theorem for PPT states
Product vectors in the ranges of multi-partite states with positive partial transposes and permanents of matrices
A gap for PPT entanglement
Schmidt number of bipartite and multipartite states under local projections
On the distillability problem of two-copy \(4\times 4\) Werner states: matrices \(A\), \(B\) of at most four nonzero entries
The role of phases in detecting three-qubit entanglement
Multiqubit UPB: the method of formally orthogonal matrices
The quantum separability problem is a simultaneous hollowisation matrix analysis problem
SEPARABILITY OF RANK TWO QUANTUM STATES ON MULTIPLE QUANTUM SPACES WITH DIFFERENT DIMENSIONS
The distillability of entanglement of bipartite reduced density matrices of a tripartite state
Distillability and PPT entanglement of low-rank quantum states
On PPT States in C ^K ⊗ C ^M ⊗ C ^N Composite Quantum Systems
Invariance of separability probability over reduced states in 4 × 4 bipartite systems
Dimensions, lengths, and separability in finite-dimensional quantum systems
Inertias of entanglement witnesses
Enhance capability of separable ball criterion for the bipartite quantum states
Unextendible product bases from tile structures in bipartite systems
Unextendible product operator basis
Separable ball around any full-rank multipartite product state
A universal framework for entanglement detection under group symmetry
Two-dimensional and absolutely entanglement-breaking subspaces
Unextendible and strongly uncompletable product bases
On non-genuinely entangled quantum states by a regularized alternative minimization method

This page was built for publication: Separability problem for multipartite states of rank at most 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326004)