A combinatorial criterion for k-separability of multipartite Dicke states

TL;DR

This paper introduces a combinatorial criterion for efficiently detecting k-separability in N-partite Dicke states, outperforming existing methods and avoiding full state tomography.

Contribution

The authors develop a new combinatorial criterion that is computationally efficient and more effective than previous criteria for identifying k-separability in Dicke states.

Findings

Criterion successfully detects k-separability in examples where previous methods fail.

The criterion is efficiently computable and implementable without full state tomography.

Applicable to N-partite Dicke states, enhancing quantum state analysis.

Abstract

We derive a combinatorial criterion for detecting k-separability of N-partite Dicke states. The criterion is efficiently computable and implementable without full state tomography. We give examples in which the criterion succeeds, where known criteria fail.