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

DOI10.1016/J.DISC.2010.06.014zbMATH Open1208.05088arXiv0906.1016OpenAlexW2034537703MaRDI QIDQ710574FDOQ710574

Chai Wah Wu

Publication date: 19 October 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: 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 characterize the set of graphs whose separability is invariant under graph isomorphism. In particular, we show that this set consists of $K_{2,2}$, $overline{K}_{2,2}$ and all complete graphs.

Full work available at URL: https://arxiv.org/abs/0906.1016

Recommendations

• Multipartite separability of Laplacian matrices of graphs
• Graphs whose normalized Laplacian matrices are separable as density matrices in quantum mechanics
• Separability of density matrices of graphs for multipartite systems
• Conditions for separability in generalized Laplacian matrices and diagonally dominant matrices as density matrices
• The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states

zbMATH Keywords

Laplacian matrixentanglementquantum mechanicsdensity matrixgraph isomorphism

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Title not available (Why is that?)
• The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
• Conditions for separability in generalized Laplacian matrices and diagonally dominant matrices as density matrices
• Multipartite separability of Laplacian matrices of graphs
• The tripartite separability of density matrices of graphs
• Title not available (Why is that?)

Cited In (6)

• Separability of density matrices of graphs for multipartite systems
• Quantum state representation based on combinatorial Laplacian matrix of star-relevant graph
• Multipartite separability of Laplacian matrices of graphs
• A computational approach to construct a multivariate complete graph invariant
• Graphs whose normalized Laplacian matrices are separable as density matrices in quantum mechanics
• Multipartite separability of density matrices of graphs

This page was built for publication: On graphs whose Laplacian matrix's multipartite separability is invariant under graph isomorphism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710574)