Some families of density matrices for which separability is easily tested

Details Some families of density matrices for which separability is easily tested Some families of density matrices for which separability is easily tested

2005-08-02

arxiv.org/abs/quant-ph/0508020v3

Phys. Rev. A 73, 012320 (2006)

Physics

Quantum Physics

14 pages, 4 figures

Scientific paper

10.1103/PhysRevA.73.012320

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.

Affiliated with

Also associated with

No associations

Rating

Some families of density matrices for which separability is easily tested 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 Some families of density matrices for which separability is easily tested, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some families of density matrices for which separability is easily tested will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-616138