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
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.