Multipartite separability of density matrices of graphs
From MaRDI portal
Publication:1740740
DOI10.1007/s10773-018-3829-9zbMath1414.81063arXiv1708.00883OpenAlexW3098356819WikidataQ129559210 ScholiaQ129559210MaRDI QIDQ1740740
Hui Zhao, Naihuan Jing, Jing-Yun Zhao
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
Quantum coherence, entanglement, quantum correlations (81P40) Quantum state spaces, operational and probabilistic concepts (81P16) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)
Related Items (1)
Cites Work
- Unnamed Item
- A graph theoretical approach to states and unitary operations
- 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
- 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
- Multipartite separability of Laplacian matrices of graphs
- Multiparty entanglement in graph states
- A combinatorial approach for studying local operations and classical communication transformations of multipartite states
- Quantum cryptography based on Bell’s theorem
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- Combinatorial laplacians and positivity under partial transpose
- Graphs and matrices
This page was built for publication: Multipartite separability of density matrices of graphs
