TL;DR
This paper introduces a new criterion for determining the separability of mixed quantum states and demonstrates that graphs with a single entangled edge correspond to entangled states.
Contribution
It provides a novel separability criterion for mixed states in bipartite systems and links graph structures to quantum entanglement.
Findings
Proves a separability criterion for mixed states in bipartite systems.
Shows that graphs with one entangled edge represent entangled states.
Abstract
In this paper we prove a separability criterion for mixed states in . We also show that the density matrix of a graph with only one entangled edge is entangled.
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.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Mechanics and Applications · Graph theory and applications