Entangled Graphs

dc.creatorRahiminia, Hadi
dc.creatorAmini, Massoud
dc.date2006-09-28
dc.date.accessioned2026-07-07T08:16:44Z
dc.date.available2026-07-07T08:16:44Z
dc.descriptionIn 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.
dc.descriptionPart of M.Sc. Thesis of the first author
dc.identifierhttps://arxiv.org/abs/cs/0609156
dc.identifierhttp://arxiv.org/abs/cs/0609156
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133883
dc.subjectInformation Theory
dc.subjectDiscrete Mathematics
dc.titleEntangled Graphs
dc.typetext

Files

Collections