The tripartite separability of density matrices of graphs

MaRDI QIDQ2372884zbMATH OpenFDO

Authors Zhen Wang, Zhi-Xi Wang

Publication date 16 July 2007

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

Full work available at URL https://arxiv.org/abs/0705.2561, https://eudml.org/doc/127725, http://www.emis.de/journals/EJC/Volume_14/Abstracts/v14i1r40.html

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

Mathematics Subject Classification ID

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

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.

Review text

Summary: 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 \textit{S. L. Braunstein, S. Ghosh} and \textit{S. Severini} [Ann. Comb. 10, No.~3, 291--317 (2006; Zbl 1106.05057)] to tripartite states. Then we prove that the degree condition defined in \textit{S. L. Braunstein} et al. [Phys. Rev., A 73, 012320 (2006)] is sufficient and necessary for the tripartite separability of the density matrix of a nearest point graph.

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

Cited in

(10)

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

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)