You're viewing papers too quickly. Please wait a moment.<br>This helps keep the archive available for everyone.
Quick Navigation
Topics
Entanglement Theory Quantum Correlations
The tripartite separability of density matrices of graphs
arXiv
Authors: Zhen Wang, Zhixi Wang
Year
2007
Paper ID
50257
Status
Preprint
Abstract Read
~2 min
Abstract Words
84
Citations
N/A
Abstract
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 {\it et al.} Annals of Combinatorics, {\bf 10}(2006)291 to tripartite states. Then we proved that the degree condition defined in Braunstein {\it et al.} Phys. Rev. A {\bf 73}, (2006)012320 is sufficient and necessary for the tripartite separability of the density matrix of a nearest point graph.
Why This Paper Matters
- This paper contributes to the Entanglement Theory & Quantum Correlations research area in the Quantum Articles archive.
- It adds a 2007 reference point for readers tracking recent quantum research.
- The density matrix of a graph is the combinatorial laplacian matrix of a graph normalized to have unit trace.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.