The laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states

Abstract

We study entanglement properties of mixed density matrices obtained from combinatorial laplacian matrices of graphs. We observe that some classes of graphs give arise to entangled (separable) states independently of their labelings. MSC2000: 05C50; PACS numbers: 03.67.-a, 03.67.-Mn

4 Figures and Tables

01020'05'06'07'08'09'10'11'12'13'14'15'16'17
Citations per Year

52 Citations

Semantic Scholar estimates that this publication has 52 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Braunstein2004TheLO, title={The laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states}, author={Samuel L. Braunstein and Sibasish Ghosh and Simone Severini}, year={2004} }