Multipartite separability of density matrices of graphs
arXiv:1708.00883 · doi:10.1007/s10773-018-3829-9
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.
arXiv comment16 pages
References in corpus (12)
- Multi-party entanglement in graph states
- Fast simulation of stabilizer circuits using a graph state representation
- The laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
- Brokered Graph State Quantum Computing
- Some families of density matrices for which separability is easily tested
- Conditions for separability in generalized Laplacian matrices and nonnegative matrices as density matrices
- Bipartite separability and non-local quantum operations on graphs
- A graph theoretical approach to states and unitary operations
- Comment on: Multipartite entanglement in four-qubit graph state
- On graphs whose Laplacian matrix's multipartite separability is invariant under graph isomorphism
- Construction of three qubit genuine entanglement with bi-partite positive partial transposes
- Graphical Classification of Entangled Qutrits