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

Discrete Mathematics

Volumn 310, Issue 21, 2010, Pages 2811-2814

  Wu, Chai Wah ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Density matrix; Entanglement; Graph isomorphism; Laplacian matrix; Quantum mechanics

Indexed keywords

EID: 79952988937     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2010.06.014     Document Type: Article

References (7)

1. K.P. Bogart, Introductory Combinatorics, 3rd ed., Academic Press, 2000.
2. S.L. Braunstein, S. Ghosh, T. Mansour, S. Severini, R.C. Wilson, Some families of density matrices for which separability is easily tested, Physical Review A 73 (2006) 012320.
3. S.L. Braunstein, S. Ghosh, S. Severini, The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states, Annals of Combinatorics 10 (2006) 291-317.
4. M. Nielsen, I. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2000.
5. Z. Wang, Z. Wang, The tripartite separability of density matrices of graphs, The Electronic Journal of Combinatorics 14 (2007) R40.
6. C.W. Wu, Conditions for separability in generalized Laplacian matrices and diagonally dominant matrices as density matrices, Physics Letters A 351 (1-2) (2006) 18-22. (Pubitemid 43175730)
7. C.W. Wu, Multipartite separability of Laplacian matrices of graphs, The Electronic Journal of Combinatorics 16 (1) (2009) R61. URL: http://www. combinatorics.org/Volume-16/PDF/v16i1r61.pdf.