The tripartite separability of density matrices of graphs

zbMATH Open1116.81018arXiv0705.2561MaRDI QIDQ2372884FDOQ2372884

Authors: Zhen Wang, Zhi-Xi Wang 

Publication date: 16 July 2007

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: The density matrix of a graph is the combinatorial laplacian matrix of a graph normalized to have unit trace. In this paper we generalize the entanglement properties of mixed density matrices from combinatorial laplacian matrices of graphs discussed in Braunstein {it et al.} Annals of Combinatorics, {�f 10}(2006)291 to tripartite states. Then we proved that the degree condition defined in Braunstein {it et al.} Phys. Rev. A {�f 73}, (2006)012320 is sufficient and necessary for the tripartite separability of the density matrix of a nearest point graph.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Separability of density matrices of graphs for multipartite systems
• Multipartite separability of density matrices of graphs
• Combinatorial laplacians and positivity under partial transpose
• The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
• Multipartite separability of Laplacian matrices of graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Quantum computation (81P68)

Cited In (10)

• A note on the degree conjecture for separability of multipartite quantum states
• Separability of density matrices of graphs for multipartite systems
• 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
• Quantum entanglement \& purity testing: a graph zeta function perspective
• Separability of PE-matching graphs
• Graphs whose normalized Laplacian matrices are separable as density matrices in quantum mechanics
• Multipartite separability of density matrices of graphs
• Walk entropies in graphs

This page was built for publication: The tripartite separability of density matrices of graphs

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