Separability of density matrices of graphs for multipartite systems
From MaRDI portal
Publication:396942
zbMath1295.05246MaRDI QIDQ396942
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
Applications of graph theory (05C90) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Quantum measurement theory, state operations, state preparations (81P15)
Related Items
Separability criteria based on Bloch representation of density matrices, Multipartite separability of density matrices of graphs, Combinatorial entanglement, A note on the degree conjecture for separability of multipartite quantum states
Cites Work
- Unnamed Item
- 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
- Multipartite separability of Laplacian matrices of graphs
- The generalized partial transposition criterion for separability of multipartite quantum states
- The tripartite separability of density matrices of graphs
- A separability criterion for density operators
- 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
- Separability Criterion for Density Matrices
- Combinatorial laplacians and positivity under partial transpose
- Graphs and matrices
