The tripartite separability of density matrices of graphs (Q2372884): Difference between revisions

Summary: The density matrix of a graph is the combinatorial Laplacian matrix of a graph normalized to have unit trace. In this paper we generalize the entanglement properties of mixed density matrices from combinatorial Laplacian matrices of graphs discussed in \textit{S. L. Braunstein, S. Ghosh} and \textit{S. Severini} [Ann. Comb. 10, No.~3, 291--317 (2006; Zbl 1106.05057)] to tripartite states. Then we prove that the degree condition defined in \textit{S. L. Braunstein} et al. [Phys. Rev., A 73, 012320 (2006)] is sufficient and necessary for the tripartite separability of the density matrix of a nearest point graph.