120 citations · 232 across the 12 of their papers we have counts for
Showing 2005 · quant-phShow all
2 papers · 2 filters
quant-ph2005★ 48 cited
Some families of density matrices for which separability is easily tested
Samuel L. Braunstein, Sibasish Ghosh, Toufik Mansour +2
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.…
quant-ph2005★ 1 cited
A matrix representation of graphs and its spectrum as a graph invariant
David Emms, Edwin R. Hancock, Simone Severini +1
We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these t…