Geodesic
The tripartite separability of density matrices of graphs
The electronic journal of combinatorics, Tome 14 (2007)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

The density matrix of a graph is the combinatorial laplacian matrix of a graph normalized to have unit trace. In this paper we generalize the entanglement properties of mixed density matrices from combinatorial laplacian matrices of graphs discussed in Braunstein et al. [Annals of Combinatorics, 10 (2006) 291] to tripartite states. Then we prove that the degree condition defined in Braunstein et al. [Phys. Rev. A, 73 (2006) 012320] is sufficient and necessary for the tripartite separability of the density matrix of a nearest point graph.
DOI : 10.37236/958
Classification : 81P68, 05C50 
@article{10_37236_958,
     author = {Zhen Wang and Zhixi Wang},
     title = {The tripartite separability of density matrices of graphs},
     journal = {The electronic journal of combinatorics},
     year = {2007},
     volume = {14},
     doi = {10.37236/958},
     zbl = {1116.81018},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/958/}
}
TY  - JOUR
AU  - Zhen Wang
AU  - Zhixi Wang
TI  - The tripartite separability of density matrices of graphs
JO  - The electronic journal of combinatorics
PY  - 2007
VL  - 14
UR  - http://geodesic.mathdoc.fr/articles/10.37236/958/
DO  - 10.37236/958
ID  - 10_37236_958
ER  - 
%0 Journal Article
%A Zhen Wang
%A Zhixi Wang
%T The tripartite separability of density matrices of graphs
%J The electronic journal of combinatorics
%D 2007
%V 14
%U http://geodesic.mathdoc.fr/articles/10.37236/958/
%R 10.37236/958
%F 10_37236_958
Zhen Wang; Zhixi Wang. The tripartite separability of density matrices of graphs. The electronic journal of combinatorics, Tome 14 (2007). doi: 10.37236/958

Cité par Sources :