Separability criteria based on realignment
Yu Lu, Zhong-Xi Shen, Shao-Ming Fei, Zhi-Xi Wang
TL;DR
This paper introduces new separability criteria based on realignment and vectorization techniques, improving entanglement detection and providing bounds for entanglement measures in quantum states.
Contribution
It presents novel criteria for bipartite and tripartite entanglement detection, surpassing previous methods, and offers bounds for concurrence and negativity.
Findings
More effective entanglement detection than previous criteria
New criteria for genuine tripartite entanglement
Lower bounds for concurrence and negativity
Abstract
The detection of entanglement in a bipartite state is a crucial issue in quantum information science. Based on realignment of density matrices and the vectorization of the reduced density matrices, we introduce a new set of separability criteria. The proposed separability criteria can detect more entanglement than the previous separability criteria. Moreover, we provide new criteria for detecting the genuine tripartite entanglement and lower bounds for the concurrence and convex-roof extended negativity. The advantages of results are demonstrated through detailed examples.
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 Information and Cryptography · Quantum Computing Algorithms and Architecture · Quantum Mechanics and Applications