pith. sign in

arxiv: cs/0609156 · v1 · submitted 2006-09-28 · 💻 cs.IT · cs.DM· math.IT

Entangled Graphs

classification 💻 cs.IT cs.DMmath.IT
keywords entangledmathbbcriteriondensityedgegraphgraphsmatrix
0
0 comments X
read the original abstract

In this paper we prove a separability criterion for mixed states in $\mathbb C^p\otimes\mathbb C^q$. We also show that the density matrix of a graph with only one entangled edge is entangled.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.