Combinatorial laplacians and positivity under partial transpose

Details Combinatorial laplacians and positivity under partial transpose Combinatorial laplacians and positivity under partial transpose

2006-07-10

arxiv.org/abs/cs/0607036v3

Math. Struct. in Comp. Sci. Vol.18, pp.205-219 (2008)

Computer Science

Computational Complexity

19 pages, 7 eps figures, final version accepted for publication in Math. Struct. in Comp. Sci

Scientific paper

Density matrices of graphs are combinatorial laplacians normalized to have trace one (Braunstein \emph{et al.} \emph{Phys. Rev. A,} \textbf{73}:1, 012320 (2006)). If the vertices of a graph are arranged as an array, then its density matrix carries a block structure with respect to which properties such as separability can be considered. We prove that the so-called degree-criterion, which was conjectured to be necessary and sufficient for separability of density matrices of graphs, is equivalent to the PPT-criterion. As such it is not sufficient for testing the separability of density matrices of graphs (we provide an explicit example). Nonetheless, we prove the sufficiency when one of the array dimensions has length two (for an alternative proof see Wu, \emph{Phys. Lett. A}\textbf{351} (2006), no. 1-2, 18--22). Finally we derive a rational upper bound on the concurrence of density matrices of graphs and show that this bound is exact for graphs on four vertices.

Affiliated with

Also associated with

No associations

Rating

Combinatorial laplacians and positivity under partial transpose does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Combinatorial laplacians and positivity under partial transpose, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combinatorial laplacians and positivity under partial transpose will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-151743