Some families of density matrices for which separability is easily tested

Abstract

We reconsider density matrices of graphs as defined in [quant-ph/0406165]. The density matrix of a graph is the combinatorial laplacian of the graph normalized to have unit trace. We describe a simple combinatorial condition (the "degree condition") to test separability of density matrices of graphs. The condition is directly related to the PPT-criterion. We prove that the degree condition is necessary for separability and we conjecture that it is also sufficient. We prove special cases of the conjecture involving nearest point graphs and perfect matchings. We observe that the degree condition appears to have value beyond density matrices of graphs. In fact, we point out that circulant density matrices and other matrices constructed from groups always satisfy the condition and indeed are separable with respect to any split. The paper isolates a number of problems and delineates further generalizations.

arXiv comment14 pages, 4 figures

References in corpus (8)

• Separability Criterion for Density Matrices
• Separability of Mixed States: Necessary and Sufficient Conditions
• Peres-Horodecki separability criterion for continuous variable systems
• Persistent entanglement in arrays of interacting particles
• Separability of very noisy mixed states and implications for NMR quantum computing
• Distinguishing separable and entangled states
• Reflections upon separability and distillability
• Complete hierarchies of efficient approximations to problems in entanglement theory

Cited by in corpus (22)

• The Shannon and the Von Neumann entropy of random networks with heterogeneous expected degree
• Tensor Entropy for Uniform Hypergraphs
• Conditions for separability in generalized Laplacian matrices and nonnegative matrices as density matrices
• Bipartite separability and non-local quantum operations on graphs
• Information sharing in Quantum Complex Networks
• Combinatorial approach to multipartite quantum systems:basic formulation
• Entropy rate of non-equilibrium growing networks
• Entanglement properties of quantum grid states
• The Quantum Separability Problem for Gaussian States
• On graphs whose Laplacian matrix's multipartite separability is invariant under graph isomorphism
• On the degree conjecture for separability of multipartite quantum states
• Concurrence of Lorentz-positive maps
• Remarks on the preservation of no-signaling principle in parity-time-symmetric quantum mechanics
• Quantum Grid States and Hybrid Graphs
• Multipartite separability of density matrices of graphs
• Graphs whose normalized Laplacian matrices are separable as density matrices in quantum mechanics
• From Sharma-Mittal to von-Neumann Entropy of a Graph
• Partial transpose of permutation matrices
• Combinatorial laplacians and positivity under partial transpose
• Detection of $d_1\otimes d_2$ Dimensional Bipartite Entangled State: A Graph Theoretical Approach
• Multipartite separability of Laplacian matrices of graphs
• Quantum Entanglement & Purity Testing: A Graph Zeta Function Perspective