Pith. sign in

REVIEW 3 major objections 5 minor 37 references

Schmidt number criterion via general symmetric informationally complete measurements

T0 review · 3 major / 5 minor · reviewed 2026-08-11 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The central claim is that for any bipartite state of Schmidt number at most $r$, the trace norm of its GSIC-POVM correlation matrix is bounded by $\frac{M}{K}+\frac{(r-1)N}{K}$, so exceeding that bound certifies Schmidt number $>r$.

desk verdict A sound but modest GSIC generalization of SIC/MUB Schmidt number criteria; the printed Lemma 1 proof has a repairable coefficient error, and the superiority claims outrun the evidence. read the letter →

arxiv 2412.10074 v1 pith:DWCZGFC3 submitted 2024-12-13 quant-ph

Zhen Wang , Bao-Zhi Sun , Shao-Ming Fei , Zhi-Xi Wang This is my paper · ORCID
classification quant-ph PACS 03.65.Bz89.70.+c
keywords SchmidtnumberGSIC-POVMtracenormentanglementdetectioncorrelationmatrixquantumisotropicstatesWerner
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper proves a Schmidt-number criterion for bipartite states of arbitrary dimension: if a state has Schmidt number at most $r$, the trace norm of the correlation matrix produced by a general symmetric informationally complete measurement (GSIC-POVM) cannot exceed a closed-form constant built from the local dimensions and the measurement parameter $a$. Violating this bound certifies that the state needs at least $r+1$ entangled dimensions. Because the GSIC family contains SIC-POVMs as the rank-one case, the criterion generalizes the existing SIC and MUB Schmidt-number tests, and the paper's examples show it detecting bound-entangled states and matching the optimal visibility threshold for isotropic states where fidelity, CCNR, MUB, and equiangular-measurement witnesses fall short. The paper also proves that every entangled state in the Werner family has Schmidt number exactly 2, by exhibiting an explicit convex decomposition into rank-2 antisymmetric pure states.

What carries the argument

GSIC-POVMs are sets of $d^2$ positive semidefinite operators $P_\alpha$ with $\sum_\alpha P_\alpha=I$, $\operatorname{tr}P_\alpha=1/d$, $\operatorname{tr}(P_\alpha^2)=a$, and fixed pairwise overlap $\operatorname{tr}(P_\alpha P_\beta)=(1-ad)/(d(d^2-1))$; they interpolate between SIC-POVMs ($a=1/d^2$) and higher-rank complete measurements. The load-bearing identity is Lemma 1, which expresses the index of coincidence $I(\sigma)=\sum_\alpha|\operatorname{tr}(P_\alpha\sigma)|^2$ as a linear combination of $\operatorname{tr}(\sigma\sigma^\dagger)$ and $|\operatorname{tr}\sigma|^2$ with coefficients fixed by $a$ and $d$. That identity converts the measured probabilities into norm bounds for the correlation matrix: diagonal Schmidt-basis terms contribute $M$-type factors, off-diagonal coherence terms contribute $N$-type factors, and the trace norm's unitary/orthogonal invariance makes the bound independent of which GSIC-POVM realization is chosen.

What would settle it

Compute the minimum eigenvalue of each of the nine operators $P_\alpha$ used in Example 1 at $t=0.01$; if any eigenvalue is negative, the claimed detection improvement for $\rho(x,q)$ is unsupported, and the comparison with the SIC criterion must be recomputed at a valid parameter.

Watch

Extended reading notes

Core claim

The paper's central result, Theorem 1, states a necessary condition for Schmidt number. For $\rho_{AB}\in H_{d_1}\otimes H_{d_2}$ with $\mathrm{SN}(\rho_{AB})\le r$, let $P_{\alpha\beta}=\operatorname{tr}(\rho_{AB}P^A_\alpha\otimes P^B_\beta)$ be the outcome matrix from GSIC-POVMs with parameters $a_1,a_2$, and let $K=\sqrt{d_1d_2(d_1^2-1)(d_2^2-1)}$, $M=\sqrt{(a_1d_1^2+1)(a_2d_2^2+1)(d_1-1)(d_2-1)}$, $N=\sqrt{(a_1d_1^3-1)(a_2d_2^3-1)}$. Then $\|P\|_{tr}\le M/K+(r-1)N/K$. A measured trace norm above this bound proves the Schmidt number exceeds $r$. The proof first reduces to pure states by convexity of the trace norm, decomposes the pure-state correlation matrix into diagonal and off-diagonal pieces, and uses the index-of-coincidence identity of Lemma 1 to control each piece; the factor $r$ enters through the Schmidt-coefficient inequality $(\sum_s\lambda_s)^2\le r$. The paper notes that the criterion is not both necessary and sufficient, since a rank-3 pure state can sit below the $r=2$ bound.

Load-bearing premise

The numerical advantage over the SIC criterion in Example 1 assumes that $t=0.01$ keeps all nine operators $P_\alpha$ positive semidefinite in dimension 3; the paper gives the general allowed range for $t$ but does not explicitly verify this particular choice.

Editorial extensions

If this is right

  • For any bipartite state in arbitrary local dimensions, the criterion certifies entanglement dimensionality $r+1$ or higher whenever $\|P\|_{tr}$ exceeds the bound, giving a dimension-sensitive witness rather than a yes/no separability test.
  • For isotropic states, the GSIC threshold recovers the known optimal visibility $v_{opt}=(rd-1)/(d^2-1)$ for Schmidt number at least $r+1$, and is strictly better than the MUB and equiangular-measurement thresholds reported for that family.
  • In the $3\otimes3$ bound-entangled example with $q=0.995$, the GSIC criterion detects states in a slightly larger parameter range than the SIC-based criterion, while the CCNR realignment criterion fails to detect any of those states.
  • Every entangled Werner-family state has Schmidt number $2$; the explicit convex decomposition into antisymmetric rank-2 pure states proves this for all local dimensions.
  • The criterion is only sufficient, not necessary: it does not certify all states with high Schmidt rank, as the paper's rank-3 pure-state example demonstrates.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Because the bound depends on the measurement parameter $a$ through $M$ and $N$, the witness can be tuned; searching over valid $a$ for each target state could yield strictly stronger detection than the single $t=0.01$ case reported.
  • The same Lemma 1 machinery could be applied to other linear maps of the correlation matrix, such as realignment or partial transposes of GSIC probability data, potentially producing Schmidt-number bounds that are tighter than trace norm alone.
  • The $1.5\times10^{-6}$ margin in Example 1 is close to machine precision; a direct positivity check of the nine operators at $t=0.01$ would settle whether the reported GSIC advantage is genuine or an artifact of the chosen parameter.
  • The decomposition argument used for Werner states suggests a general method: to prove Schmidt number at most $k$, find a convex decomposition whose pure components all have Schmidt rank at most $k$; this may extend to other noisy states with symmetry.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper derives a Schmidt number criterion for bipartite quantum states based on the trace norm of the correlation matrix produced by general symmetric informationally complete (GSIC) measurements. The main result, Theorem 1, states that if a state has Schmidt number at most r, then the trace norm of the GSIC correlation matrix is bounded by a dimension- and parameter-dependent expression; violation of the bound certifies Schmidt number above r. The paper also presents examples for bound entangled states, isotropic states, and Werner states, and compares the criterion with fidelity, CCNR, MUB, and EAM criteria.

Significance. If the proof is repaired as described below, the result is a useful unification and generalization of previously known SIC- and MUB-based Schmidt number criteria, with the measurement parameter a providing a tunable family of witnesses rather than a fixed construction. The derivation of the index-of-coincidence formula in Lemma 1 is central but self-contained, and the explicit algebraic treatments of isotropic and Werner states are valuable checks; the convex decomposition showing that entangled Werner states have Schmidt number 2 is a particularly nice addition. The claim of superiority over the fidelity criterion is, however, overstated for the isotropic family, and the numerical advantage over the SIC criterion in Example 1 is very small and not accompanied by positivity or error verification. These issues are local and fixable, not fatal to the main theorem.

major comments (3)
  1. [Section II, Lemma 1, Eq. (5)] The proof of Lemma 1 is not valid as printed because the operators F_alpha defined in Eq. (5) are not orthonormal. With q = sqrt((d^2-1)/(a d^3-1)), the printed second coefficient is (1/d) sqrt(d)(1-q), while orthonormality requires (1-q)/(d sqrt(d)), a factor 1/d smaller. For example, for a SIC-POVM in d=2 (a=1/4), the printed F_1 gives tr(F_1^2) = 3/2 + sqrt(3)(1-sqrt(3)) + (1-sqrt(3))^2, approximately 0.768, and tr(F_1 F_2) is approximately -0.232, so the expansion sigma = sum_alpha tr(F_alpha sigma) F_alpha in Eq. (6) is unjustified. This is load-bearing because Theorem 1 uses Lemma 1 to bound ||D_s|| and ||O_{s,t}||. The lemma statement itself is correct and the proof can be repaired by replacing the coefficient in Eq. (5) with (1-q)/(d sqrt(d)); the same formula (4) then follows, so the main theorem can be retained after this correction.
  2. [Example 2, Eq. (16)] The sentence 'our criterion is strictly stronger than the fidelity witness' is contradicted by the authors' own Eq. (16), which gives v_GSIC = (rd-1)/(d^2-1) = v_opt, the optimal visibility threshold of the fidelity witness in Ref. [14]. For isotropic states the GSIC criterion and the fidelity witness therefore have exactly the same critical visibility; the criterion is equivalent, not strictly stronger, for this family. The comparison with the MUB and EAM thresholds from Ref. [25] may still show an advantage, but the blanket claim of strict superiority over the fidelity criterion should be reworded or supported by a different example.
  3. [Example 1, t=0.01] The claimed numerical advantage over the SIC criterion rests on the choice t=0.01 in the nine operators P_alpha, but the paper does not verify that these operators are positive semidefinite; it only quotes the general range -1/(d^2 lambda_max) <= t <= 1/(d^2 |lambda_min|) without computing lambda_min and lambda_max for the explicit G_alpha matrices. Moreover, the reported difference in ||P||_tr - (9a+1)/12 between GSIC and SIC at x=0.55 is about 1.5e-6, which is at the scale of numerical noise and is not accompanied by error analysis or exact values. Please provide the allowed t-interval for the explicit operators and the exact or high-precision results, or state the comparison more cautiously.
minor comments (5)
  1. [General] There are several typographical errors, including 'criteiron' in Remark 1, 'lager' in Example 1, and 'informationally' in the title; these should be corrected.
  2. [Figure 1] The axis labels and the legend are garbled in the provided text; the figure should be redrawn so that the SIC and GSIC curves are clearly distinguished and the plotted quantity is unambiguous.
  3. [Paragraph after Remark 2] The invariance argument for ||P||_tr is stated in a confusing way; the sentence beginning 'Therefore, tr(P...)' does not directly explain the claimed invariance. The invariance follows from singular-value preservation under left and right multiplication by orthogonal matrices, and this should be stated explicitly.
  4. [Notation] The names 'SIC-POVM', 'GSIC-POVM', 'MUBs' and 'MuBs' are used with inconsistent capitalization and abbreviation; please unify the notation throughout.
  5. [Eq. (14)] The 9x9 matrix in Eq. (14) would be much easier to read if its block structure were indicated or if line breaks were aligned with the matrix entries.

Circularity Check

0 steps flagged · score 2.0 of 10

No significant circularity: the GSIC Schmidt-number criterion is derived from the GSIC conditions via a self-contained trace-norm argument; the only self-citation is non-load-bearing.

full rationale

The central derivation is self-contained. Lemma 1 computes the index of coincidence I(sigma) directly from the GSIC-POVM conditions (1)-(3), and Theorem 1 obtains the trace-norm bound by convexity, the Schmidt decomposition, the triangle inequality, and (sum lambda_s)^2 <= r. No parameter is fitted to the target states: a1 and a2 are legitimate measurement parameters, and inequality (8) is proven for all allowed values; the examples merely instantiate them. Ref. [33] (co-authored by two of the present authors) is cited in Remark 2 and Example 3 as a consistency check, but the r=1 case follows by setting r=1 in Theorem 1, so this self-citation is not load-bearing. Two non-circular weaknesses should be noted: the printed proof of Lemma 1 appears to mis-normalize the operator basis F_alpha, since for d=2 SIC the values tr(F_1^2) and tr(F_1 F_2) do not match orthonormality; this is a repairable technical gap rather than circularity. Also, the claimed advantage over SIC in Example 1 is about 1.5e-6 without an explicit check that t=0.01 yields positive semidefinite P_alpha for the listed matrices. Neither weakness makes the derivation equivalent to its inputs.

Assumptions & free parameters 1 free parameters · 5 assumptions · 0 invented entities

The ledger shows the paper's central claim rests on standard math (trace norm properties, Schmidt decomposition) plus the prior existence of GSIC-POVMs. The only hand-chosen number is the GSIC parameter a, selected as t=0.01 in Example 1; this choice affects the numerical demonstration but not the validity of the theorem. No invented entities are introduced.

free parameters (1)
  • GSIC-POVM parameter a (or t) = t=0.01 in Example 1 for d=3, giving a = 1/27 + 0.0001*2*64 ≈ 0.04984
    The bound in Theorem 1 depends on a1 and a2. In Example 1, t=0.01 is chosen by hand to demonstrate an advantage over SIC; the paper does not justify this choice or show robustness across t.
assumptions (5)
  • domain assumption GSIC-POVMs satisfying conditions (1)-(3) exist for all finite d and can be explicitly constructed.
    Section II invokes the construction P_alpha = I/d^2 + t[...] and the parameter range for t, citing Refs [29,30,32]. The existence and positivity of the POVMs are taken from prior work.
  • standard math Trace norm is convex and unitarily invariant; singular value decomposition properties hold.
    Used in Theorem 1 proof to reduce to pure states via convexity and to compute ||D_s||_tr and ||O_s,t||_tr.
  • standard math Schmidt number of a mixed state is the minimum over pure-state decompositions of the maximum Schmidt rank.
    This definition from Ref [14] underlies the pure-state reduction in the proof of Theorem 1.
  • standard math For nonnegative numbers lambda_s with sum lambda_s^2 = 1, (sum lambda_s)^2 <= r.
    Used in the final inequality of Theorem 1 (Section II, Eq. (12)).
  • domain assumption The visibility thresholds for MUB and EAM criteria quoted from Ref [25] are correct for the stated resource settings.
    Example 2 compares the GSIC threshold with formulas from Ref [25]; the comparison inherits the validity of those formulas for the chosen m and n.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Schmidt number criterion via general symmetric informationally complete measurements." pith.science (2026). https://pith.science/paper/DWCZGFC3

@misc{pith2026241210074,
  author       = {Pith},
  title        = {Pith review of: Schmidt number criterion via general symmetric informationally complete measurements},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/DWCZGFC3}},
  note         = {Machine review of arXiv:2412.10074}
}
read the original abstract

The Schmidt number characterizes the quantum entanglement of a bipartite mixed state and plays a significant role in certifying entanglement of quantum states. We derive a Schmidt number criterion based on the trace norm of the correlation matrix obtained from the general symmetric informationally complete measurements. The criterion gives an effective way to quantify the entanglement dimension of a bipartite state with arbitrary local dimensions. We show that this Schmidt number criterion is more effective and superior than other criteria such as fidelity, CCNR (computable cross-norm or realignment), MUB (mutually unbiased bases) and EAM (equiangular measurements) criteria in certifying the Schmidt numbers by detailed examples.

Figures

Figures reproduced from arXiv: 2412.10074 by the authors.

Figure 1
Figure 1. FIG. 1: The value of [PITH_FULL_IMAGE:figures/full_fig_p009_1.png] view at source ↗
Figure 2
Figure 2. FIG. 2: The value of [PITH_FULL_IMAGE:figures/full_fig_p009_2.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

37 extracted references · 37 canonical work pages

  1. [14]

    Terhal, B.M., Horodecki, P.: Schmidt number for densit y matrices. Phys. Rev. A 61, 040301 (2000)

    work page 2000

  2. [25]

    Morelli, S., Huber, M., Tavakoli, A.: Resource-efficien t high-dimensional entanglment detec- tion via symmetric projections. Phys. Rev. Lett. 131, 170201(2023)

    work page 2023

  3. [1]

    G¨ uhne, O., T´ oth, G.: Entanglement detection. Phys. Rep. 474, 1 (2009)

    work page 2009

  4. [2]

    Horodecki, R., Horodecki, P., Horodecki, M., Horodecki , K.: Quantum entanglement. Rev. Mod. Phys. 81, 865 (2009)

    work page 2009

  5. [3]

    Bennett, C.H., Wiesner, S.J.: Communication via one- an d two-particle operators on Einstein- Podolsky-Rosen states. Phys. Rev. Lett. 69, 2881 (1992)

    work page 1992

  6. [4]

    Bennett, C.H., Brassard, G., Cr´ epeau, C., Jozsa, R., Pe res, A., Wootters, W.K.: Teleporting an unknown quantum state via dual classical and Einstein-Po dolsky-Rosen channels. Phys. Rev. Lett. 70, 1895 (1993). 13

    work page 1993

  7. [5]

    Buhrman, H., Cleve, R., Massar, S., de Wolf, R.: Nonlocal ity and communication complexity. Rev. Mod. Phys. 82, 665 (2010)

    work page 2010

  8. [6]

    Scarani, V., Bechmann-Pasquinucci, H., Cerf, N.J., Du˘ sek, M., L¨ utkenhaus, N., Peev, M.: The security of practical quantum key distribution. Rev. Mo d. Phys. 81, 1301 (2009)

    work page 2009

Show all 37 references
  1. [7]

    Xu, F., Ma, X., Zhang, Q., Lo, H.-K., Pan, J.W.: Secure qua ntum key distribution with realistic devices. Rev. Mod. Phys. 92, 025002 (2020)

    2020

  2. [8]

    Pirandola, S., Andersen, U.L., Banchi, L., Berta, M., Bu nandar, D., Colbeck, R., Englund, D., Gehring, T., Lupo, C., Ottaviani, C., Pereira, J.L., Raz avi, M., Shaari, J.S., Tomamichel, M., Usenko, V.C., Vallone, G., Villoresi, P., Wallden, P.: A dvances in quantum cryptograp...

    2020

  3. [9]

    Bennett, C.H., Brassard, G., Crepeau, C., Jozsa, R., Per es, A., Wooters, W.K.: Teleporting an unknown quantum state via dual classical and Einstein-Po dolsky-Rosen channels. Phys. Rev. Lett. 70, 1895 (1993)

    1993

  4. [10]

    Albeverio, S., Fei, S.M., Yang, W.L.: Optimal teleport ation based on Bell measurement. Phys. Rev. A 66, 012301 (2002)

    2002

  5. [11]

    Quantum Inf

    Plenio, M.B., Virmani, S.: An introduction to entangle ment measures. Quantum Inf. Comput. 7, 1 (2007)

    2007

  6. [12]

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

    2024

  7. [13]

    Jin, Z.X., Li-Jost, X., Fei, S.M., Qiao, C.F.: Entangle ment measures based on the complete information of reduced states. Phys. Rev. A 107, 012409 (2023)

    2023

  8. [15]

    Friis, N., Vitagliano, G., Malik, M., Huber, M.: Entang lement certification from theory to experiment. Nat. Rev. Phys. 1, 72 (2019)

    2019

  9. [16]

    Quantum Inf

    Hulpke, F., Bruss, D., Lewenstein, M., Sanpera, A.: Sim plifying Schmidt number witnesses via higher-dimensional embeddings. Quantum Inf. Comput. 4, 207 (2004)

    2004

  10. [17]

    Linear Multilinear Algebra 62, 648 (2014)

    Johnston, N.: Norm dualtiy and the cross norm criteria f or quantum entanglement. Linear Multilinear Algebra 62, 648 (2014)

    2014

  11. [18]

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

    1996

  12. [19]

    Horodecki, M., Horodecki, P., Horodecki, R.: Separabi lity of mixed states: necessary and 14 sufficient conditions. Phys. Lett. A 223, 1 (1996)

    1996

  13. [20]

    Quantum Inf

    Rudolph, O.: Further results on the cross norm criterio n for separability. Quantum Inf. Com- put. 4, 219 (2005)

    2005

  14. [21]

    Quantum Inf

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

    2003

  15. [22]

    Kl¨ ockl, C., Huber, M.: Characterizing multipartite e ntanglement without shared refences frames. Phys. Rev. A 91, 042339 (2015)

    2015

  16. [23]

    PRX Quantum 4, 020324 (2023)

    Liu, S., He, Q., Huber, M., G¨ uhne, O., Vitagliano, G.: C haracterizing entanglement dimen- sionality from randomized measurements. PRX Quantum 4, 020324 (2023)

    2023

  17. [24]

    Quantum 8, 1236 (2024)

    Liu, S., Fadel, M., He, Q., Huber, M., Vitagliano, G.:, B ounding entanglement dimensionality from covariance matrix. Quantum 8, 1236 (2024)

    2024

  18. [26]

    Zhang, C., Denker, S., Asadian, A., G¨ uhne, O.: Analyzi ng quantum entanglement with the Schmidt decomposition in operator space. Phys. Rev. Lett. 133, 040203(2024)

    2024

  19. [27]

    Preprint at https://arxiv.org/abs/quant-ph/2402.09972 (2024)

    Tavakoli, A., Morelli, S.: Enhanced Schmidt number cri teria based on corrlation trace norms. Preprint at https://arxiv.org/abs/quant-ph/2402.09972 (2024)

    2024 arXiv

  20. [28]

    Shang J., Asadian A., Zhu H., G¨ uhne, O.: Enhanced entan glement criterion via symmetric informationally complete measurements. Phys. Rev. A 98, 022309 (2018)

    2018

  21. [29]

    Appleby D.M.: Symmetric informationally complete mea surements of arbitrary rank. Opt. Spectrosx. 103, 416 (2007)

    2007

  22. [30]

    Kalev, A., Gour, G.: Contruction of all general symmetr ic informationally complete measure- ments. J. Phys. A: Math. Theor. 47, 335302 (2014)

    2014

  23. [31]

    Renes J.M., Blume-Kohout R., Scott A.J., Caves C.M.: Sy mmetric informationally complete quantum measurements. J. Math. Phys. 45, 2741 (2004)

    2004

  24. [32]

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

    2022

  25. [33]

    Quantum Inf

    Lai, L.M., Li, T., Fei, S.M., Wang, Z.X.: Entanglement c riterion via general symmetric infor- mationally complete measuements. Quantum Inf. Process. 17, 314 (2018)

    2018

  26. [34]

    Horodecki, P.: Separability criterion and inseparabi lity mixed states with positive partial transposition. Phys. Lett. A 232, 333 (1997). 15

    1997

  27. [35]

    Horodecki, M., Horodecki P.: Reduction criterion of se parability and limits for a class of distillation protocols. Phys. Rev. A 59, 4206 (1999)

    1999

  28. [36]

    Horn, R.A., Johnson, C.R.: Matrix Analysis (second edi tion), Cambridge University Press, 2013

    2013

  29. [37]

    Werner,R.F.: Quantum states with Einstein-Podolsky- Rosen correlations admitting a hidden- variable model. Phys. Rev. A 40, 4277 (1989). 16

    1989

Pith tools

Reviewed August 11, 2026 · model on record in the stance chip above.