The Laplacian of a Graph as a Density Matrix: A Basic Combinatorial Approach to Separability of Mixed States

We study entanglement properties of mixed density matrices obtained from combinatorial Laplacians. This is done by introducing the notion of the density matrix of a graph. We characterize the graphs with pure density matrices and show that the density matrix of a graph can be always written as a …