Physics – Quantum Physics
Scientific paper
2004-06-22
Annals of Combinatorics, Volume 10, No 3, 2006
Physics
Quantum Physics
20 pages, 11 figures
Scientific paper
10.1007/s00026-006-0289-3
We study entanglement properties of mixed density matrices obtained from combinatorial Laplacians. This is done by introducing the notion of the density matrix of a graph. We characterize the graphs with pure density matrices and show that the density matrix of a graph can be always written as a uniform mixture of pure density matrices of graphs. We consider the von Neumann entropy of these matrices and we characterize the graphs for which the minimum and maximum values are attained. We then discuss the problem of separability by pointing out that separability of density matrices of graphs does not always depend on the labelling of the vertices. We consider graphs with a tensor product structure and simple cases for which combinatorial properties are linked to the entanglement of the state. We calculate the concurrence of all graph on four vertices representing entangled states. It turns out that for some of these graphs the value of the concurrence is exactly fractional.
Braunstein Samuel L.
Ghosh Sibasish
Severini Simone
No associations
LandOfFree
The laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states 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 The laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-248161