The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
From MaRDI portal
Publication:858019
DOI10.1007/S00026-006-0289-3zbMATH Open1106.05057arXivquant-ph/0406165OpenAlexW3100495106MaRDI QIDQ858019
Author name not available (Why is that?)
Publication date: 5 January 2007
Published in: (Search for Journal in Brave)
Abstract: 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.
Full work available at URL: https://arxiv.org/abs/quant-ph/0406165
No records found.
No records found.
This page was built for publication: The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858019)
