Entangled Graphs
arXiv:cs/0609156
Abstract
In this paper we prove a separability criterion for mixed states in . We also show that the density matrix of a graph with only one entangled edge is entangled.
Part of M.Sc. Thesis of the first author
arXiv:cs/0609156
In this paper we prove a separability criterion for mixed states in . We also show that the density matrix of a graph with only one entangled edge is entangled.
Part of M.Sc. Thesis of the first author