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

DOI10.1016/J.DISC.2015.12.001zbMATH Open1329.05202arXiv1407.5663OpenAlexW193033860MaRDI QIDQ906486FDOQ906486

Authors: Chai Wah Wu 

Publication date: 21 January 2016

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

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.

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

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

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)

Cites Work

• Title not available (Why is that?)
• Separability Criterion for Density Matrices
• Separability of \(n\)-particle mixed states: necessary and sufficient conditions in terms of linear maps
• On graphs whose Laplacian matrix's multipartite separability is invariant under graph isomorphism
• 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
• Classical deterministic complexity of Edmonds' Problem and quantum entanglement
• Multipartite separability of Laplacian matrices of graphs
• The tripartite separability of density matrices of graphs

Cited In (5)

• A note on the degree conjecture for separability of multipartite quantum states
• Non-compact quantum graphs with summable matrix potentials
• 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
• 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)