论文信息 - On graphs whose Laplacian matrix's multipartite separability is invariant under graph isomorphism

On graphs whose Laplacian matrix's multipartite separability is invariant under graph isomorphism

Normalized Laplacian matrices of graphs have recently been studied in the context of quantum mechanics as density matrices of quantum systems. Of particular interest is the relationship between quantum physical properties of the density matrix and the graph theoretical properties of the underlying graph. One important aspect of density matrices is their entanglement properties, which are responsible for many nonintuitive physical phenomena. The entanglement property of normalized Laplacian matrices is in general not invariant under graph isomorphism. In recent papers, graphs were identified whose entanglement and separability properties are invariant under isomorphism. The purpose of this note is to completely characterize the set of graphs whose separability is invariant under graph isomorphism. In particular, we show that this set consists of K"2","2 and its complement, all complete graphs and no other graphs.

Chai Wah Wu

[1] C. Wu. Conditions for separability in generalized Laplacian matrices and diagonally dominant matrices as density matrices , 2005, quant-ph/0508163.

[2] Kenneth P. Bogart,et al. Introductory Combinatorics , 1977 .

[3] Thierry Paul,et al. Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[4] Zhen Wang,et al. The Tripartite Separability of Density Matrices of Graphs , 2007, Electron. J. Comb..

[5] Simone Severini,et al. Some families of density matrices for which separability is easily tested (10 pages) , 2006 .

[6] Wah Wu. Multipartite separability of Laplacian matrices of graphs , 2009 .

[7] S. Severini,et al. The Laplacian of a Graph as a Density Matrix: A Basic Combinatorial Approach to Separability of Mixed States , 2004, quant-ph/0406165.