pith. sign in

arxiv: 2605.22165 · v1 · pith:FZZNSBRDnew · submitted 2026-05-21 · 🪐 quant-ph

Computable lower bound of the parameterized entanglement monotone

Ning Yang , Yu Guo , Shuanping Du This is my paper

Pith reviewed 2026-05-22 06:55 UTC · model grok-4.3

classification 🪐 quant-ph
keywords entanglement measureslower bounds(N,M)-POVMq-concurrencealpha-concurrencetwo-qudit statestwo-qubit statesisotropic states
0
0 comments X

The pith

Lower bounds on parameterized entanglement monotones are obtained via informationally complete (N,M)-POVMs for two-qudit and two-qubit states.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper seeks computable lower bounds for q-concurrence and alpha-concurrence, two parameterized entanglement monotones, because exact evaluation usually demands intractable optimization over quantum states. It uses informationally complete (N, M)-positive operator-valued measures to produce explicit lower bounds that apply to the ranges 1/2 < alpha < 1 and 1 < q < 2 for two-qudit systems and 2 <= q < 3 for two-qubit systems. Examples demonstrate that these bounds surpass those derived from GSIC-POVM, SIC-POVM, positive partial transpose, and realignment criteria. An exact closed-form expression for the monotones is also supplied for isotropic states.

Core claim

Using informationally complete (N, M)-positive operator-valued measures, lower bounds are derived for the parameterized entanglement monotones q-concurrence (q > 1) and alpha-concurrence (0 < alpha < 1), specifically for 1/2 < alpha < 1 and 1 < q < 2 on two-qudit states and for 2 <= q < 3 on two-qubit states; several examples show these bounds exceed those from GSIC-POVM, SIC-POVM, positive partial transpose, and realignment criteria, and an analytical formula is obtained for the isotropic state.

What carries the argument

The informationally complete (N, M)-POVM, a measurement whose outcomes directly supply the data needed to evaluate the lower bounds on the parameterized monotones for the listed parameter ranges and dimensions.

If this is right

  • The (N,M)-POVM bounds can be evaluated directly from finite measurement statistics for the covered parameter intervals.
  • These bounds are tighter than GSIC-POVM and SIC-POVM bounds on the same states in the listed examples.
  • Positive partial transpose and realignment criteria produce weaker numerical lower bounds than the POVM constructions.
  • The parameterized monotones admit closed-form expressions for isotropic states inside the given ranges of alpha and q.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The construction might extend to additional ranges of q and alpha or to three-qudit states once suitable (N,M) parameters are identified.
  • The same measurement framework could supply lower bounds for other concave entanglement monotones beyond the parameterized concurrence family.
  • Numerical tests on randomly generated or experimentally prepared states would indicate how often the new bounds are close to the true values.
  • The approach underscores that choosing the right informationally complete measurement can improve entanglement estimation for resource quantification in quantum tasks.

Load-bearing premise

The (N,M)-POVM is assumed to be informationally complete in a manner that directly yields valid lower bounds on the parameterized monotones without additional optimization or post-selection for the stated parameter ranges and system dimensions.

What would settle it

Pick a concrete two-qubit state and a value such as q = 2.5 inside the allowed range, compute its exact q-concurrence by definition, and compare the result to the numerical value of the (N,M)-POVM lower bound; any case where the bound exceeds the exact value would falsify the claim.

Figures

Figures reproduced from arXiv: 2605.22165 by Ning Yang, Shuanping Du, Yu Guo.

Figure 1
Figure 1. Figure 1: FIG. 1. The comparison of (a) [PITH_FULL_IMAGE:figures/full_fig_p008_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2. The comparison of the different lower bounds for [PITH_FULL_IMAGE:figures/full_fig_p008_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3. The comparison of [PITH_FULL_IMAGE:figures/full_fig_p009_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4. The comparison between [PITH_FULL_IMAGE:figures/full_fig_p009_4.png] view at source ↗
read the original 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., $q$-concurrence ($q>1$) and $\alpha$-concurrence ($0<\alpha<1$), or termed the parameterized entanglement monotone together. We obtain, in the light of the informationally complete ($N$, $M$)-positive operator-valued measure [($N$, $M$)-POVM], the lower bounds for the case of $\frac12<\alpha<1$, $1<q<2$ for two-qudit states, and the case of $2\leqslant q<3$ for two-qubit states. We list several examples which show that the lower bounds based on ($N$, $M$)-POVM outperform that of GSIC-POVM and SIC-POVM, and all these measurement based bounds are better then the ones induced by positive partial transpose (PPT) and realignment criteria in literature. In addition, we obtain an analytical formula of the parameterized entanglement monotone with $\frac12<\alpha<1$ and $1<q<2$ for the isotropic state.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript claims to derive computable lower bounds on the parameterized entanglement monotones (q-concurrence for 1<q<2 and α-concurrence for ½<α<1 in two-qudit states; q-concurrence for 2≤q<3 in two-qubit states) via informationally complete (N,M)-POVMs. It presents examples in which these bounds outperform those obtained from GSIC-POVM, SIC-POVM, PPT, and realignment criteria, and supplies an analytical formula for the isotropic state.

Significance. If the derivations are valid, the results supply practical, optimization-free lower bounds on parameterized entanglement measures for arbitrary states in the indicated ranges. The explicit comparisons with prior measurement-based and criterion-based bounds, together with the closed-form result for isotropic states, would constitute a modest but useful advance in the literature on entanglement estimation.

major comments (2)
  1. [Main derivation (Section 3)] The central claim rests on the assertion that informational completeness of the (N,M)-POVM directly yields valid, tight lower bounds for the open intervals ½<α<1 and 1<q<2 (and 2≤q<3 for qubits) without state-dependent optimization or extra positivity constraints. The manuscript must exhibit the explicit trace/norm inequalities and verify that they remain valid and non-vacuous throughout these intervals; otherwise the generality asserted in the abstract is not established.
  2. [Examples (Section 4)] The examples section asserts outperformance over GSIC-POVM and SIC-POVM bounds. Quantitative tables or figures must report the numerical values of all compared bounds for each chosen state so that the claimed improvement can be reproduced and assessed for statistical significance rather than isolated cases.
minor comments (2)
  1. [Abstract] Abstract contains the typo 'better then' (should be 'better than').
  2. [Preliminaries] The precise definition and construction of the (N,M)-POVM should be stated at the beginning of the technical development rather than assumed from prior literature.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful review and the constructive suggestions. We address the major comments point by point below, and we will make the necessary revisions to the manuscript to improve its clarity and completeness.

read point-by-point responses

  1. Referee: [Main derivation (Section 3)] The central claim rests on the assertion that informational completeness of the (N,M)-POVM directly yields valid, tight lower bounds for the open intervals ½<α<1 and 1<q<2 (and 2≤q<3 for qubits) without state-dependent optimization or extra positivity constraints. The manuscript must exhibit the explicit trace/norm inequalities and verify that they remain valid and non-vacuous throughout these intervals; otherwise the generality asserted in the abstract is not established.

    Authors: We appreciate the referee's emphasis on the need for explicit derivations. The manuscript derives the lower bounds using the informational completeness property of the (N,M)-POVM, which allows us to express the parameterized entanglement monotones in terms of measurable quantities without optimization. To address this comment, we will revise Section 3 to include the explicit trace inequalities and norm expressions that underpin the bounds. We will also add a verification that these inequalities hold validly and non-vacuously for the parameter ranges 1/2 < α < 1, 1 < q < 2 for two-qudits, and 2 ≤ q < 3 for two-qubits, confirming no extra positivity constraints are required. revision: yes

  2. Referee: [Examples (Section 4)] The examples section asserts outperformance over GSIC-POVM and SIC-POVM bounds. Quantitative tables or figures must report the numerical values of all compared bounds for each chosen state so that the claimed improvement can be reproduced and assessed for statistical significance rather than isolated cases.

    Authors: We concur that providing the specific numerical values will enhance the reproducibility of our results. In the revised manuscript, we will expand Section 4 to include comprehensive tables displaying the computed lower bound values from the (N,M)-POVM approach alongside those from GSIC-POVM, SIC-POVM, PPT, and realignment criteria for each tested state. This will facilitate direct comparison and evaluation of the improvements. revision: yes

Circularity Check

0 steps flagged

No circularity: lower bounds derived from POVM completeness and trace inequalities without reduction to inputs

full rationale

The paper derives explicit lower bounds on parameterized entanglement monotones (q-concurrence for 1<q<2 and α-concurrence for 1/2<α<1 on two-qudits, plus 2≤q<3 on qubits) by applying the informational completeness relation of the (N,M)-POVM to obtain computable expressions via trace or norm inequalities. These steps rely on standard POVM properties and monotonicity of the measures rather than any self-referential definition, fitted parameter renamed as prediction, or load-bearing self-citation chain. Examples compare the resulting bounds to GSIC-POVM, SIC-POVM, PPT, and realignment criteria, confirming the derivation remains independent and externally checkable. No equation reduces the claimed bound to its own input by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

Based on abstract only; the derivation rests on standard properties of entanglement monotones and informational completeness of POVMs, with no explicit free parameters or invented entities mentioned.

axioms (2)
  • domain assumption Entanglement monotones satisfy convexity and monotonicity under local operations and classical communication
    Implicit background for any lower bound on concurrence-like quantities.
  • domain assumption Informationally complete POVMs can be used to reconstruct expectation values needed for entanglement bounds
    Central to the (N,M)-POVM approach described.

pith-pipeline@v0.9.0 · 5813 in / 1622 out tokens · 43919 ms · 2026-05-22T06:55:49.449233+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

48 extracted references · 48 canonical work pages

  1. [1]

    In what follows, we write P(ρ) := N∑ α,β =1 M∑ k,l =1 Tr [ρ(Eα,k ⊗ Eβ,l )] |eα,k ⟩⟨eβ,l |

    with dim H = d, and let {|eα,k ⟩} (α = 1, · · ·,N ;k = 1, · · ·,M ) be an or- thonormal basis of CNM . In what follows, we write P(ρ) := N∑ α,β =1 M∑ k,l =1 Tr [ρ(Eα,k ⊗ Eβ,l )] |eα,k ⟩⟨eβ,l |. (12) A. Lower bounds of the q-concurrence We now consider the lower bounds of the q-concurrence in terms of Eq. ( 12) based on the informationally com- plete (N , ...

    work page

  2. [2]

    2, 3 > 0, (ii) L0

    2, 3 > ˇL0. 2, 3 > 0, (ii) L0. 51, 0. 499, 3>L ′

    work page

  3. [3]

    499, 3> ˇL0

    51, 0. 499, 3> ˇL0. 51, 0. 499, 3 > 0, L1. 8, 1. ˙3 ˙6, 3 > L′

    work page

  4. [4]

    ˙3 ˙6, 3 > L′′

    8, 1. ˙3 ˙6, 3 > L′′

    work page

  5. [5]

    ˙3 ˙6, 3 > ˇL1

    8, 1. ˙3 ˙6, 3 > ˇL1. 8, 1. ˙3 ˙6, 3 > 0, L2. 5, 3 > L′

    work page

  6. [6]

    5, 3 > 0, and L3, 3 > L′ 3, 3 > L′′ 3, 3 > ˇL3, 3 > 0 where ˇL∗ denote the lower bounds in Eqs

    5, 3 > ˇL2. 5, 3 > 0, and L3, 3 > L′ 3, 3 > L′′ 3, 3 > ˇL3, 3 > 0 where ˇL∗ denote the lower bounds in Eqs. ( 6)-(9) with respect to the corresponding parame- ter. Example 2. Consider a 3 ⊗ 3 pure state |Φ ⟩ = √ θ|φ 1⟩ + √ 1 − θ|φ 2⟩, (27) where |φ 1⟩ = 1√ 2 (|0⟩ + |1⟩)|2⟩ and |φ 2⟩ = 1√ 3 (|00⟩ + |11⟩ + |22⟩). We take a (8,2)-POVM (see Appendix B) with x...

    work page

  7. [7]

    499, 3 = 0

    51, 0. 499, 3 = 0. 0122 L′

    work page

  8. [8]

    ˙3 ˙6, 3 = 0

    8, 1. ˙3 ˙6, 3 = 0. 000815 L′

    work page

  9. [9]

    0018 L′ 3, 3 = 0

    5, 3 = 0. 0018 L′ 3, 3 = 0. 0020 SIC-POVM L′′

    work page

  10. [10]

    499, 3 = 0

    51, 0. 499, 3 = 0. 0114 L′′

    work page

  11. [11]

    ˙3 ˙6, 3 = 0

    8, 1. ˙3 ˙6, 3 = 0. 000778 L′′

    work page

  12. [12]

    0018 L′′ 3, 3 = 0

    5, 3 = 0. 0018 L′′ 3, 3 = 0. 0019 Eqs.( 6)-(9) ˇL0. 2, 3 = 0. 0615 ˇL0. 51, 0. 499, 3 = 0. 0091 ˇL1. 8, 1. ˙3 ˙6, 3 = 0. 000680 ˇL2. 5, 3 = 0. 0015 ˇL3, 3 = 0. 0017 Taking a (3,2)-POVM (see Appendix B) with x = 1/ 2 +t2( √ 2 + 1)2,t ∈ [− 0. 2929, 0. 2929],θ = 0. 2, we plot Fig 2 (a): Cα (|Ψ ⟩) (0. 5 < α <1) and its lower bounds from Eq. ( 23) and Eq. ( 20...

    work page

  13. [13]

    829F − 0. 277, 0. 481<F ⩽ 1, C0. 88 (ρF ) =      0, F ⩽ 1/ 3, ξ0. 88(ρF ), 1/ 3<F ⩽ 0. 907,

    work page

  14. [14]

    247F − 0. 106, 0. 907<F ⩽ 1, where ξα (ρF ) = (2 − F +ϑ 1 3 )α + 2 (1 +F − ϑ 1 6 )α − 1 with ϑ 1 = 2 √ 2F (1 − F ), and that for the case of 1 < q <2, C1. 5 (ρF ) = { 0, F ⩽ 1/ 2, ξ1. 5(ρF ), F > 1/ 2 8 0.5 0.55 0.6 0.65 0.7 0.75 0.8 0.85 0.9 0.95 1 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 (a) 1 1.1 1.2 1.3 1.4 1.5 1.6 1.7 1.8 1.9 2 0 0.1 0.2 0.3 0.4 0.5 0.6 (b) FIG...

    work page

  15. [15]

    922F − 0. 499, 0. 949<F ⩽ 1 with ξq(ρF ) = 1 − (2 − F +ϑ 1 3 )q − 2 (1 +F − ϑ 1 6 )q wheneverd = 3, C1. 5 (ρF ) =      0, F ⩽ 0. 25, ξ1. 5(ρF ), 0. 25<F ⩽ 0. 881,

    work page

  16. [16]

    882F − 0. 382, 0. 881<F ⩽ 1 0.5 0.55 0.6 0.65 0.7 0.75 0.8 0.85 0.9 0.95 1 0 0.05 0.1 0.15 0.2 0.25 0.3 0.35 (a) 1 1.1 1.2 1.3 1.4 1.5 1.6 1.7 1.8 1.9 2 0 0.05 0.1 0.15 0.2 0.25 0.3 0.35 (b) 2 2.1 2.2 2.3 2.4 2.5 2.6 2.7 2.8 2.9 3 0.25 0.3 0.35 0.4 0.45 0.5 (c) FIG. 2. The comparison of the different lower bounds for |Ψ ⟩ given in Eq. (

    work page

  17. [17]

    2: (a) Cα , Lα, 0

    with θ = 0 . 2: (a) Cα , Lα, 0. 49, 2, and ¯Lα, 0. 49, 2; (b) Cq, Lq, 3 4− q , 2, and ¯Lq, 3 4− q , 2; (c) Cq, Lq, 2. 4721, 2, and ¯Lq, 2. 4721, 2. with ξq(ρF ) = 1 − (3 − 2F +ϑ 3 4 )q − 3 (1 + 2F − ϑ 3 12 )q wheneverd = 4, where ϑ 3 = 2 √ 3F (1 − F ). In order to compare the lower bounds of ρF , we adopt 9 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 0 0.1 0.2 0.3 0.4 ...

    work page

  18. [18]

    Y. Guo, Z. X. Jin, Measure of entanglement and the monogamy relation: a topical review, arXiv:2512.21992

    work page arXiv

  19. [19]

    W. K. Wootters, Entanglement of formation of an ar- bitrary state of two qubits, Phys. Rev. Lett. 80, 2245 (1998)

    work page 1998

  20. [20]

    S. A. Hill, W. K. Wootters, Entanglement of a pair of quantum bits, Phys. Rev. Lett. 78, 5022 (1997)

    work page 1997

  21. [21]

    Rungta, C

    P. Rungta, C. M. Caves, Concurrence-based entangle- ment measures for isotropic states, Phys. Rev. A 67, 012307 (2003)

    work page 2003

  22. [22]

    X. Yang, M. X. Luo, Y. H. Yang, S. M. Fei, Parametrized entanglement monotone, Phys. Rev. A 103, 052423 (2021)

    work page 2021

  23. [23]

    G. Bao, X. N. Zhu, Parameterized entanglement mea- sures with computable lower bounds, Quantum Inf. Pro- cess. 24, 77 (2025)

    work page 2025

  24. [24]

    Z. W. Wei, S. M. Fei, Parameterized bipartite entan- glement measure, J. Phys. A: Math. Theor. 55, 275303 (2022)

    work page 2022

  25. [25]

    D. P. Xuan, Z. X. Shen, W. Zhou, Z. X. Wang, S. M. Fei, A new entanglement measure based on the total concur- rence, Adv. Quantum Technol. 8, 2500149 (2025)

    work page 2025

  26. [26]

    Z. W. Wei, M. X. Luo, S. M. Fei, Estimating parameter- ized entanglement measure, Quantum Inf. Process. 21, 210 (2022)

    work page 2022

  27. [27]

    K. Chen, S. Albeverio, S. M. Fei, Concurrence of arbi- trary dimensional bipartite quantum states, Phys. Rev. Lett. 95, 040504 (2005)

    work page 2005

  28. [28]

    Siudzi´ nska, All classes of informationally comple te symmetric measurements in finite dimensions, Phys

    K. Siudzi´ nska, All classes of informationally comple te symmetric measurements in finite dimensions, Phys. Rev. A 105, 042209 (2022)

    work page 2022

  29. [29]

    H. F. Wang, S. M. Fei, Symmetric measurement-induced lower bounds of concurrence, Phys. Rev. A 111, 032432 (2025)

    work page 2025

  30. [30]

    X. Shi, Y. Sun, A family of separability criteria and low er bounds of concurrence, Quantum Inf. Process. 22, 131 (2023)

    work page 2023

  31. [31]

    J. Li, H. Yao, S. M. Fei, Z. Fan, H. Ma, Quantum entan- glement estimation via symmetric-measurement-based positive maps, Phys. Rev. A 109, 052426 (2024)

    work page 2024

  32. [32]

    J. M. Renes, R. Blume-Kohout, A. J. Scott, C. M. Caves, Symmetric informationally complete quantum measure- ments, J. Math. Phys. 45, 2171 (2004)

    work page 2004

  33. [33]

    D. M. Appleby, Symmetric informationally complete measurements of arbitrary rank, Opt. Spectrosc. 103, 416 (2007)

    work page 2007

  34. [34]

    G. Gour, A. Kalev, Construction of all general symmet- ric informationally complete measurements, J. Phys. A: Math. Theor. 47, 335302 (2014)

    work page 2014

  35. [35]

    B. Chen, T. Li, S. M. Fei, General SIC measurement- based entanglement detection, Quantum Inf. Process. 14, 2281 (2015)

    work page 2015

  36. [36]

    X. F. Qi, Y. Y. Pang, J. C. Hou, Detecting k- nonseparability and k-partite entanglement with gener- alized skew information and mutually unbiased measure- ments, J. Phys. A: Math. Theor. 58 455303 (2025)

    work page 2025

  37. [37]

    J. W. Shang, A. Asadian, H. J. Zhu, O. Guhne, Enhanced entanglement criterion via symmetric informationally complete measurements, Phys. Rev. A 98, 022309 (2018)

    work page 2018

  38. [38]

    Y. Lu, W. Zhou, M. Su, H. X. Wu, S. M. Fei, Z. X. Wang, Quantum separability criteria based on symmetric measurements, Phys. Rev. A 112, 062424 (2025)

    work page 2025

  39. [39]

    Huang, F

    F. Huang, F. Wu, L. Tang, Z. W. Mo, M. Q. Bai, Char- acterizing the uncertainty relation via a class of measure- ments, Phys. Scr. 98, 105103 (2023)

    work page 2023

  40. [40]

    A. E. Rastegin, Uncertainty relations for MUBs and SIC- POVMs in terms of generalized entropies, Eur. Phys. J. D 67, 269 (2013). 14

    work page 2013

  41. [41]

    Horodecki, P

    M. Horodecki, P. Horodecki, R. Horodecki, Separabil- ity of mixed states: necessary and sufficient conditions, Phys. Lett. A 223, 1 (1996)

    work page 1996

  42. [42]

    Peres, Separability criterion for density matrices , Phys

    A. Peres, Separability criterion for density matrices , Phys. Rev. Lett. 77, 1413 (1996)

    work page 1996

  43. [43]

    K. Chen, L. A. Wu, A matrix realignment method for recognizing entanglement, Quantum Inf. Comput. 3, 193 (2003)

    work page 2003

  44. [44]

    Rudolph, Computable cross-norm criterion for sepa- rability, Lett

    O. Rudolph, Computable cross-norm criterion for sepa- rability, Lett. Math. Phys. 70 57 (2004)

    work page 2004

  45. [45]

    C. H. Bennett, D. P. DiVincenzo, T. Mor, P. W. Shor, J. A. Smolin, B. M. Terhal, Unextendible product bases and bound entanglement, Phys. Rev. Lett. 82, 5385 (1999)

    work page 1999

  46. [46]

    B. M. Terhal, K. G. H. Vollbrecht, Entanglement of For- mation for Isotropic States, Phys. Rev. Lett. 85, 2625 (2000)

    work page 2000

  47. [47]

    S. Lee, D. P. Chi, S. D. Oh, J. Kim, Convex-roof ex- tended negativity as an entanglement measure for bipar- tite quantum systems, Phys. Rev. A 68, 062304 (2003)

    work page 2003

  48. [48]

    Y. X. Wang, L. Z. Mu, V. Vedral, H. Fan, Entanglement R´ enyiα entropy, Phys. Rev. A 93, 022324 (2016)

    work page 2016