Multipartite separability of density matrices of graphs

DOI10.1007/S10773-018-3829-9MaRDI QIDQ1740740zbMATH OpenOpenAlexWikidataFDO

Authors Hui Zhao, Jing-Yun Zhao, Naihuan Jing

Publication date 3 May 2019

Published in International Journal of Theoretical Physics (Search for Journal in Brave)

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

zbMATH Keywords

separabilityLaplacian matricespartially symmetricdegree symmetric

Mathematics Subject Classification ID

Quantum coherence, entanglement, quantum correlations (81P40) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35) Quantum state spaces, operational and probabilistic concepts (81P16)

Abstract: A new layers method is presented for multipartite separability of density matrices from simple graphs. Full separability of tripartite states is studied for graphs on degree symmetric premise. The models are generalized to multipartite systems by presenting a class of fully separable states arising from partially symmetric graphs.

Recommendations

• Separability of density matrices of graphs for multipartite systems
• The tripartite separability of density matrices of graphs
• Entanglement and separability of graph Laplacian quantum states
• 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
• Multiparty entanglement in graph states
• Graphs whose normalized Laplacian matrices are separable as density matrices in quantum mechanics
• Separability of multipartite quantum systems
• Multipartite entanglement in qudit hypergraph states
• Feynman graphs and the large dimensional limit of multipartite entanglement

Cites work

• A combinatorial approach for studying local operations and classical communication transformations of multipartite states
• A graph theoretical approach to states and unitary operations
• 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
• Graphical classification of entangled qutrits
• Graphs and matrices
• Graphs whose normalized Laplacian matrices are separable as density matrices in quantum mechanics
• Multipartite separability of Laplacian matrices of graphs
• Multiparty entanglement in graph states
• On graphs whose Laplacian matrix's multipartite separability is invariant under graph isomorphism
• Quantum cryptography based on Bell’s theorem
• Separability of density matrices of graphs for multipartite systems
• 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

Cited in

(9)

• Separability of density matrices of graphs for multipartite systems
• A note on the degree conjecture for separability of multipartite quantum states
• Multipartite separability of Laplacian matrices of graphs
• Relaxations of separability in multipartite systems: Semidefinite programs, witnesses and volumes
• Multipartite entanglement configurations: Combinatorial offshoots into (hyper)graph theory and their ramifications
• Separability of PE-matching graphs
• The tripartite separability of density matrices of graphs
• On the degree conjecture for separability of multipartite quantum states
• Multipartite generalization of the Schmidt decomposition

This page was built for publication: Multipartite 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 Q1740740)