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

DOI10.1016/J.DISC.2015.12.001zbMath1329.05202arXiv1407.5663OpenAlexW193033860MaRDI QIDQ906486

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

quantum mechanicsLaplacian matrixentanglement

Mathematics Subject Classification ID

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

Related Items (2)

Multipartite separability of density matrices of graphs ⋮ A note on the degree conjecture for separability of multipartite quantum states

Cites Work

• Unnamed Item
• 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
• Multipartite separability of Laplacian matrices of graphs
• The tripartite separability of density matrices of graphs
• Classical deterministic complexity of Edmonds' Problem and quantum entanglement
• Separability Criterion for Density Matrices
• Separability of \(n\)-particle mixed states: necessary and sufficient conditions in terms of linear maps

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