The authors obtain lower bounds for q-concurrence (1<q<2 for two-qudits, 2≤q<3 for two-qubits) and α-concurrence (½<α<1) via (N,M)-POVMs that exceed GSIC-POVM, SIC-POVM, PPT, and realignment bounds in tested cases, plus an analytical expression for isotropic states.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Unified-(q,s) entropy entanglement is an entanglement monotone and monogamous for q>1, qs≥1, yielding one complete tightly completely monogamous GlMEM and three incomplete ones based on unified entropy.
citing papers explorer
-
Computable lower bound of the parameterized entanglement monotone
The authors obtain lower bounds for q-concurrence (1<q<2 for two-qudits, 2≤q<3 for two-qubits) and α-concurrence (½<α<1) via (N,M)-POVMs that exceed GSIC-POVM, SIC-POVM, PPT, and realignment bounds in tested cases, plus an analytical expression for isotropic states.
-
Unified entropy entanglement
Unified-(q,s) entropy entanglement is an entanglement monotone and monogamous for q>1, qs≥1, yielding one complete tightly completely monogamous GlMEM and three incomplete ones based on unified entropy.