Lower Bounds of Entanglement Quantifiers Based On Entanglement Witnesses
Xian Shi

TL;DR
This paper introduces a method to derive lower bounds for various entanglement measures in bipartite systems using entanglement witnesses, aiding quantification when system information is limited.
Contribution
It presents a novel approach leveraging entanglement criteria to estimate lower bounds of entanglement measures, enhancing quantification under partial information.
Findings
Derived lower bounds for concurrence, entanglement of formation, and geometrical entanglement.
Applicable to bipartite systems with limited information.
Provides a practical method for entanglement quantification.
Abstract
To quantify the entanglement of bipartite systems in terms of some entanglement measure is a challenging problem in general, and it is much worse when the information about the system is less. In this manuscript, based on two classes of entanglement criteria, we present a method to obtain the lower bounds of the entanglement measures, concurrence, entanglement of formation, and geometrical 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 · Computability, Logic, AI Algorithms · Quantum Information and Cryptography
