Estimating Parameterized Entanglement Measure
Zhi-Wei Wei, Ming-Xing Luo, Shao-Ming Fei
TL;DR
This paper introduces tight lower bounds for the $q$-concurrence, a parameterized entanglement measure, improving previous bounds by analyzing properties related to positive partial transposition and realignment.
Contribution
It provides new tight lower bounds for the $q$-concurrence for all $q \\geq 2$, enhancing the understanding of entanglement quantification.
Findings
Bounds are tighter than previous results.
Examples demonstrate the effectiveness of the bounds.
Analysis relates to positive partial transposition and realignment properties.
Abstract
The parameterized entanglement monotone, the -concurrence, is also a reasonable parameterized entanglement measure. By exploring the properties of the -concurrence with respect to the positive partial transposition and realignment of density matrices, we present tight lower bounds of the -concurrence for arbitrary . Detailed examples are given to show that the bounds are better than the previous ones.
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.