Multipartite separability of density matrices of graphs
Hui Zhao, Jing Yun Zhao, Naihuan Jing
TL;DR
This paper introduces a new layered method for analyzing the multipartite separability of density matrices derived from graphs, focusing on tripartite states and extending to general multipartite systems.
Contribution
It presents a novel layered approach for determining multipartite separability of graph-based density matrices, including conditions for tripartite states and a class of fully separable states from partially symmetric graphs.
Findings
Full separability of tripartite states studied under degree symmetry.
Models generalized to multipartite systems with partially symmetric graphs.
New layered method effectively analyzes graph-based density matrices.
Abstract
A new layers method is presented for multipartite separability of density matrices from simple graphs. Full separability of tripartite states is studied for graphs on degree symmetric premise. The models are generalized to multipartite systems by presenting a class of fully separable states arising from partially symmetric graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.