Separability of density matrices of graphs for multipartite systems

MaRDI QIDQ396942zbMATHFDO

Authors Chen Xie, Zhi-Xi Wang, Hui Zhao

Publication date 14 August 2014

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

Full work available at URL http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i4p21

zbMATH Keywords

separabilityquantum statesdensity matrices of graphsLaplacian matrices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90) Quantum measurement theory, state operations, state preparations (81P15)

Recommendations

• The tripartite separability of density matrices of graphs
• A combinatorial approach to multipartite quantum systems: basic formulation
• Multipartite separability of density matrices of graphs
• Combinatorial laplacians and positivity under partial transpose
• Separability of PE-matching graphs

Cites work

• A matrix realignment method for recognizing entanglement
• A separability criterion for density operators
• Combinatorial laplacians and positivity under partial transpose
• Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
• Conditions for separability in generalized Laplacian matrices and diagonally dominant matrices as density matrices
• Graphs and matrices
• Multipartite separability of Laplacian matrices of graphs
• On graphs whose Laplacian matrix's multipartite separability is invariant under graph isomorphism
• Quantum cryptography based on Bell’s theorem
• Separability Criterion for Density Matrices
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
• The generalized partial transposition criterion for separability of multipartite quantum states
• The tripartite separability of density matrices of graphs

Cited in

(22)

• Entangled Graphs
• Quantum entanglement \& purity testing: a graph zeta function perspective
• Conditions for separability in generalized Laplacian matrices and diagonally dominant matrices as density matrices
• Separability criteria based on Bloch representation of density matrices
• 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
• Separability of PE-matching graphs
• Combinatorial entanglement: detecting entanglement in quantum states using grid-labelled graphs
• The tripartite separability of density matrices of graphs
• Graphs whose normalized Laplacian matrices are separable as density matrices in quantum mechanics
• Tensor 2-sums and entanglement
• Separability and the stella octangula
• A graph-separation theorem for quantum causal models
• Combinatorial entanglement
• A note on the degree conjecture for separability of multipartite quantum states
• Entanglement and separability of graph Laplacian quantum states
• Multipartite separability of Laplacian matrices of graphs
• Relaxations of separability in multipartite systems: Semidefinite programs, witnesses and volumes
• Laplacian matrices of weighted digraphs represented as quantum states
• On the degree conjecture for separability of multipartite quantum states
• Multipartite separability of density matrices of graphs
• Quantum state representation based on combinatorial Laplacian matrix of star-relevant graph

This page was built for publication: Separability of density matrices of graphs for multipartite systems

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