The Tripartite Separability of Density Matrices of Graphs

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 Braunstein et al. [Annals of Combinatorics, 10 (2006) 291] to tripartite states. Then we prove that the degree condition defined in Braunstein et al. [Phys. Rev. A, 73 (2006) 012320] is sufficient and necessary for the tripartite separability of the density matrix of a nearest point graph.

• Type: Journal
• Year: 2007
• Where: COMBINATORICS
• Authors: Zhen Wang, Zhixi Wang
• Keywords: Braunstein Et, Combinatorial Laplacian Matrix, COMBINATORICS 2007, Density Matrix