Computable lower bound of the parameterized entanglement monotone
Ning Yang, Yu Guo, Shuanping Du

TL;DR
This paper develops computable lower bounds for parameterized entanglement monotones, specifically $q$-concurrence and $eta$-concurrence, using informationally complete measurements, improving upon existing bounds and providing analytical formulas for certain states.
Contribution
It introduces new measurement-based lower bounds for two types of parameterized entanglement monotones, outperforming previous criteria and including analytical results for isotropic states.
Findings
Lower bounds outperform GSIC-POVM and SIC-POVM-based bounds.
Measurement-based bounds are better than PPT and realignment criteria.
Analytical formula derived for isotropic states with specific parameters.
Abstract
Although numerous measures of entanglement have been proposed so far, the calculation of a given faithful entanglement measure is a hard work since it is always involved in some optimization process. It is, therefore, important to estimate the lower bound of a given entanglement measure for an arbitrary quantum state. This results in a subject of intensive mathematical research. In particular, along this line, the lower bounds of concurrence or other measures that are induced from concurrence have been explored a lot. Here, we investigate the lower bounds of two kinds of entanglement monotones, i.e., -concurrence () and -concurrence (), or termed the parameterized entanglement monotone together. We obtain, in the light of the informationally complete (, )-positive operator-valued measure [(, )-POVM], the lower bounds for the case of…
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.
