# Separability of Completely Symmetric States in Multipartite System

## TL;DR

This paper proves a conjecture that completely symmetric quantum states are separable if and only if they are convex combinations of symmetric pure product states, with specific conditions based on their rank.

## Contribution

It confirms the conjecture for bipartite and multipartite cases and establishes rank-based criteria for separability of completely symmetric states.

## Key findings

- Complete proof of the conjecture for bipartite and multipartite states.
- Separable states of rank at most 5 or N+1.
- Rank 6 or N+2 states are separable iff their range contains a product vector.

## Abstract

Symmetry plays an important role in the field of quantum mechanics. In this paper, we consider a subclass of symmetric quantum states in the multipartite system $N^{\otimes d}$, namely, the completely symmetric states, which are invariant under any index permutation. It was conjectured by L. Qian and D. Chu [arXiv:1810.03125 [quant-ph]] that the completely symmetric states are separable if and only if it is a convex combination of symmetric pure product states. In this paper, we proved that this conjecture is true for both bipartite and multipartite cases. And we proved the completely symmetric state $\rho$ is separable if its rank is at most $5$ or $N+1$. For the states of rank $6$ or $N+2$, they are separable if and only if their range contains a product vector. We apply our results to a few widely useful states in quantum information, such as symmetric states, edge states, extreme states, and nonnegative states. We also study the relation of CS states to Hankel and Toeplitz matrices.