Graphs whose normalized Laplacian matrices are separable as density matrices in quantum mechanics

DOI10.1016/J.DISC.2015.12.001MaRDI QIDQ906486zbMATH OpenOpenAlexFDO

Authors Chai Wah Wu

Publication date 21 January 2016

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Laplacian matrixentanglementquantum mechanics

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) General mathematical topics and methods in quantum theory (81Q99)

Abstract: Recently normalized Laplacian matrices of graphs are studied as density matrices in quantum mechanics. Separability and entanglement of density matrices are important properties as they determine the nonclassical behavior in quantum systems. In this note we look at the graphs whose normalized Laplacian matrices are separable or entangled. In particular, we show that the number of such graphs is related to the number of 0-1 matrices that are line sum symmetric and to the number of graphs with at least one vertex of degree 1.

Recommendations

• Multipartite separability of Laplacian matrices of graphs
• On graphs whose Laplacian matrix's multipartite separability is invariant under graph isomorphism
• 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
• Separability of density matrices of graphs for multipartite systems

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• Classical deterministic complexity of Edmonds' Problem and quantum entanglement
• Conditions for separability in generalized Laplacian matrices and diagonally dominant matrices as density matrices
• Multipartite separability of Laplacian matrices of graphs
• On graphs whose Laplacian matrix's multipartite separability is invariant under graph isomorphism
• Separability Criterion for Density Matrices
• Separability of \(n\)-particle mixed states: necessary and sufficient conditions in terms of linear maps
• The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
• The tripartite separability of density matrices of graphs

Cited in

(5)

• Conditions for separability in generalized Laplacian matrices and diagonally dominant matrices as density matrices
• On graphs whose Laplacian matrix's multipartite separability is invariant under graph isomorphism
• Non-compact quantum graphs with summable matrix potentials
• A note on the degree conjecture for separability of multipartite quantum states
• Multipartite separability of density matrices of graphs

This page was built for publication: Graphs whose normalized Laplacian matrices are separable as density matrices in quantum mechanics

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