Decomposition of completely symmetric states states
arXiv:1810.03125
Abstract
In this paper, we consider a subclass of quantum states in the multipartite system, namely, the supersymmetric states. We investigate the problem whether they admit the symmetrically separable decomposition, i.e., each term in this decomposition is a supersymmetric pure product state , which are called S-separable. We conjecture that any supersymmetric states are S-separable and we prove that this conjecture holds when the rank is less than or equal to 3 or . Moreover, we propose another weaker conjecture that any separable supersymmetric states are S-separable. It was proved to be true when the rank is less than or equal to or . We also propose a numerical algorithm which is able to detect S-separability. Besides, we analysis the convergence behavior of this algorithm. Some numerical examples are tested to show the effectiveness of the algorithm.
References in corpus (9)
- Separability Criterion for Density Matrices
- A complete family of separability criteria
- Quantum Correlations in Systems of Indistinguishable Particles
- Separability in 2xN composite quantum systems
- Operational criterion and constructive checks for the separability of low rank density matrices
- Quantum Separability Criteria for Arbitrary Dimensional Multipartite States
- Improved algorithm for quantum separability and entanglement detection
- Quantum states with strong positive partial transpose
- Separability of Multipartite Quantum States with Strong Positive Partial Transpose