LAUSR

We demonstrate that a quantum hypergraph state is k-separable if and only if the hypergraph has k-connected components. The permutation symmetric states remains invariant under any permutation. We introduce permutation symmetric states generated by hypergraphs and describe their combinatorial structures. This combinatorial perspective insists us to investigate multi-partite entanglement of permutation symmetric hypergraph states. Using generalised concurrence we measure entanglement up to ten qubits. A number of examples of these states are discussed.