Robust Multipartite Entanglement Without Entanglement Breaking
Ming-Xing Luo, Shao-Ming Fei

TL;DR
This paper develops criteria and witnesses for detecting whether entanglement persists or is broken in distributed quantum systems, including networks, which is crucial for quantum information processing.
Contribution
It introduces a local model to characterize entanglement breaking in both single systems and networks, providing practical witnesses and inequalities for verification.
Findings
A simple criterion for witnessing entanglement breaking in single states.
Efficient witnesses for entanglement in various quantum network connectivities.
Verification of strong nonlocality using nonlinear inequalities.
Abstract
Entangled systems in experiments may be lost or offline in distributed quantum information processing. This inspires a general problem to characterize quantum operations which result in breaking of entanglement or not. Our goal in this work is to solve this problem both in single entanglement and network scenarios. We firstly propose a local model for characterizing all entangled states that are breaking for losing particles. This implies a simple criterion for witnessing single entanglement such as generalized GHZ states and Dicke states. It further provides an efficient witness for entangled quantum networks depending on its connectivity such as -independent quantum networks, completely connected quantum networks, and -connected quantum networks. These networks are universal resources for measurement-based quantum computations. The strong nonlocality can be finally verified by…
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 Mechanics and Applications · Quantum Computing Algorithms and Architecture
