Lower bounds on the squashed entanglement for multi-party systems
Wei Song
TL;DR
This paper introduces computable lower bounds for multipartite squashed entanglement and explores its relationships with other entanglement measures, advancing the understanding of entanglement quantification.
Contribution
It provides the first explicit computable lower bounds for multipartite squashed entanglement and establishes inequalities linking it to other entanglement measures.
Findings
Derived explicit lower bounds for multipartite squashed entanglement.
Established inequalities relating squashed entanglement to other measures.
Enhanced the practical computability of multipartite entanglement quantification.
Abstract
Squashed entanglement is a promising entanglement measure that can be generalized to multipartite case, and it has all of the desirable properties for a good entanglement measure. In this paper we present computable lower bounds to evaluate the multipartite squashed entanglement. We also derive some inequalities relating the squashed entanglement to the other entanglement measure.
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 Information and Cryptography · Quantum Mechanics and Applications