Matched witness for multipartite entanglement
Xiao-yu Chen, Zhu-an Xu

TL;DR
This paper introduces a new two-step method for detecting multipartite entanglement that avoids semi-definite programming, providing necessary and sufficient criteria for specific quantum states.
Contribution
It develops a novel algebra function optimization approach to determine entanglement criteria, simplifying the detection process for multipartite states.
Findings
Necessary and sufficient criteria for three-qubit X states
Criteria for four-qubit noisy GHZ states
Criteria for four-qubit noisy cluster states
Abstract
We transform the way of finding entanglement criterion into two steps: to obtain necessary criterion of separability by maximizing an algebra function for a set of characteristic variables of the witness operator and the given number of partitions, then to obtain the sufficient criterion by minimizing an algebra function with respect to the characteristic variables for a given quantum state. Our method avoids the semi-definite program calculation in the witness operator entanglement detection. The necessary and sufficient criterion of separability for the three qubit X shaped state is given to illustrate the procedure of finding the criterion. We give the necessary and sufficient criteria of the three partite and full separabilities for the four qubit noisy GHZ state and the four qubit noisy cluster state.
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
