Pith. sign in

REVIEW 1 major objections 4 minor 41 references

Equi-Entropic Maps for Four-Partite Quantum States

T0 review · 1 major / 4 minor · reviewed 2026-08-01 · deepseek-v4-flash

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

Pith's one-line read This paper introduces a linear map built from reshuffling and partial transposition that forces the three balanced bipartitions of any four-party state to have exactly equal linear entropies, and shows that for random inputs this common ent

desk verdict A clean new map that provably equalizes bipartition entropies, with a d^{-2} average deficit that is a well-labeled leading-moment estimate rather than a proven theorem. read the letter →

arxiv 2607.25954 v1 pith:4FEGH6GB submitted 2026-07-28 quant-ph

Wojciech Bruzda , Zahra Raissi This is my paper · ORCID
classification quant-ph
keywords equi-entropicmaplinearentropyreshufflingpartialtranspositionabsolutelymaximallyentangledstatestwo-unitarymatricesorthogonalLatinsquaresHaar-randomunitary
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 asks whether entanglement can be made uniformly distributed across the three balanced bipartitions of a four-party system without requiring it to be maximal. It answers with a linear map Ξ that, applied to any nonzero d²×d² matrix, guarantees exact equality of the normalized linear entropies of the three bipartitions. The map arises as the limit of an iterative averaging procedure alternating reshuffling and partial transposition. For Haar-random unitary inputs, the paper's leading-moment analysis predicts that the common entropy approaches its maximal value as d grows, with an average deficit of order d⁻². The paper also shows that special fixed points of Ξ are two-unitary matrices corresponding to exact AME(4,d) states, and connects permutation fixed points to orthogonal Latin squares.

What carries the argument

The central object is the linear map Ξ, defined by averaging over a subgroup of the group G generated by the two index rearrangements reshuffling (R) and partial transposition (Γ). The group has six elements, decomposing into the cyclic subgroup G_e = {I, RΓ, ΓR} and its complementary coset G_o = {R, Γ, RΓR}. The key mechanism is that Y = Ξ_e(X) is invariant under cyclic index permutations (Y^{RΓ} = Y, Y^{ΓR} = Y), which forces the Gram matrices YY†, Y^R(Y^R)†, and Y^Γ(Y^Γ)† to coincide. Since the normalized linear entropy depends only on the squared singular values of the matrix, this spectral identity yields exact entropy equality across all three balanced bipartitions.

What would settle it

Compute the exact Haar fourth moment for Y = Ξ_e(X) for a small fixed dimension such as d = 3 or 4 using the full Weingarten expansion; if the predicted deficit 1 − E[S(Y)] deviates from 1/d² at order larger than O(d⁻⁴), or if a numerical sampling over many Haar-random unitaries shows that the variance of S(Y) decays slower than d⁻⁴, then the claim that typical outputs are near-maximal for large d would be undermined. A separate falsifier for Conjecture 1 is to search for a centrosymmetric two-unitary permutation fixed point of Ξ_e at d = 5 or d = 8; if none exists, the conjecture is false.

Watch

Extended reading notes

Core claim

Theorem 1: For any matrix X ∈ C^{d²×d²} with d ≥ 2, if Y = Ξ_e(X) or Y = Ξ_o(X) is nonzero, then the three balanced bipartition entropies are equal: S(Y) = S(Y^R) = S(Y^Γ). The proof establishes a stronger identity: YY† = Y^R(Y^R)† = Y^Γ(Y^Γ)†, so the three reduced states have identical spectra. The even and odd limiting maps are defined as Ξ_e(X) = (X + X^{RΓ} + X^{ΓR})/3 and Ξ_o(X) = (X^R + X^Γ + X^{RΓR})/3, obtained as the convergent subsequences of the iteration X_{k+1} = (X_k^R + X_k^Γ)/2. Proposition 2 states that for Haar-random unitary X, the leading-moment approximation gives 1 − E[S(Ξ_e(X))] ∼ 1/d² as d → ∞, supported by numerical simulations.

Load-bearing premise

The claim that Haar-random inputs produce near-maximal common entropy rests on approximating the average of a ratio by the ratio of averages and keeping only the leading Gaussian term in the Haar fourth-moment expansion, with no bound on how much individual outputs fluctuate around the mean.

Editorial extensions

If this is right

  • Any nonzero output of Ξ provides a four-party state with exactly equal bipartition entropies, offering a way to construct states with symmetric entanglement without solving the two-unitary existence problem.
  • Two-unitary fixed points of Ξ_e correspond to AME(4,d) states, so the fixed-point equation gives a systematic search strategy for absolutely maximally entangled states.
  • For permutation matrices, the fixed-point condition imposes a cyclic symmetry on associated orthogonal Latin squares; Conjecture 1 predicts such centrosymmetric two-unitary permutations exist for all d not ≡ 2 (mod 3) and d ≠ 6.
  • For Haar-random inputs, the average entropy deficit of order d⁻² implies the reduced states are O(d⁻¹) close to maximally mixed in Hilbert-Schmidt distance, giving a quantitative sense of near-AME behavior in high dimensions.
  • The iterative procedure converges exponentially fast, so the limiting equi-entropic map can be approximated in practice by a few dozen averaging steps.

Reading between the lines

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

  • Since the proof establishes equality of the full Gram spectra, not just a scalar entropy, the map actually enforces equal entanglement spectra across the three bipartitions; this stronger 'spectrum bundling' could be exploited in tasks sensitive to the entire reduction spectrum, such as certain quantum error-correction or teleportation protocols.
  • The asymptotic claim about near-maximal entropy is proven only at the level of averaged leading moments; whether typical individual outputs are near-maximal hinges on concentration of the entropy around its mean, which the paper does not address. A natural extension is to compute the variance of S(Ξ_e(X)) over Haar-random unitaries to verify that fluctuations decay faster than d⁻⁴.
  • The group-theoretic construction generalizes naturally: choosing other subgroups of index permutations for systems with more than four parties could produce maps that equalize entropies across arbitrary selected bipartitions, offering a systematic tool for designing multipartite entanglement with prescribed symmetry.
  • The authors' suggestion of a continuous-variable extension could be tested by defining the analog of index reshuffling on four-mode Gaussian states and checking whether balancing symplectic purities leads to a similar 'equi-purity' property under energy constraints.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

1 major / 4 minor

Summary. The paper introduces two linear maps Ξ_e and Ξ_o on d²×d² matrices, obtained as the even and odd subsequence limits of iterating X_{k+1} = (X_k^R + X_k^Γ)/2, where R and Γ are reshuffling and partial transposition. Theorem 1 proves that every nonzero output has equal normalized linear entropy across the three balanced bipartitions, and Proposition 1 establishes convergence with explicit formulas. The authors characterize fixed points, relate two-unitary fixed points to orthogonal Latin squares, propose Conjecture 1 about centrosymmetric two-unitary permutation fixed points when d ≢ 2 (mod 3), and state Proposition 2 that for Haar-random unitary inputs the average entropy deficit is O(d^{-2}), supported by a leading-moment calculation and numerical simulations.

Significance. The core construction is clean, explicit, and parameter-free: Ξ_e and Ξ_o are group-theoretic projections onto cyclic and coset subspaces, and the stronger identity YY† = Y^R(Y^R)† = Y^Γ(Y^Γ)† established in the proof of Theorem 1 is a useful structural result. The equi-entropy property is exact and fully proven, and the combinatorial examples with MOLS and two-unitary permutation fixed points are valuable. The main weakness is that the advertised probabilistic claim — that typical high-dimensional Haar-random inputs yield near-maximal common entropy — rests on an uncontrolled moment approximation and lacks a concentration statement.

major comments (1)
  1. [III.B.3, Proposition 2 (Eqs. 46–50)] The asymptotic claim 1−E[S(Ξ_e(X))] ∼ d^{-2} is not proven as stated. Eq. (46) asserts the leading fourth-moment term with the full Haar expansion omitted ('The complete fourth-moment expansion is straightforward but lengthy'), and Eq. (47) replaces E[ratio] by E[numerator]/E[denominator] without justification. No variance or concentration bound is given, so neither 'typical' nor even high-probability near-maximality follows from the average. Since the abstract and Sec. IV explicitly say that 'typical high-dimensional inputs make the common value close to maximal', this gap is load-bearing. Either provide a complete Weingarten-based moment computation including a variance/concentration estimate, or explicitly demote Proposition 2 to a heuristic and soften the 'typical' statements. Fig. 2 (256 samples, standard errors only) does not resolve the fluctuation issue.
minor comments (4)
  1. [III.B.2, Conjecture 1] The sentence 'The condition d ≢ 2 (mod 3) is necessary. Otherwise, no such permutation can exist. This follows from ... analysis of invariants' gives no proof. Since the statement is used to delimit the conjecture, either supply the argument or label the necessity as part of the conjecture rather than as an established fact.
  2. [III.A, Proposition 1 proof] The displayed equation for ξ^{2k} contains a corrupted arrow/glyph ('/leftr⫯g⊸tl⫯ne→'); the mathematical meaning is clear, but the typesetting needs correction.
  3. [III.B.3, Fig. 2] The figure caption reports sample means over 256 independent Haar-random unitaries with standard error bars, but no individual variances or ranges are shown. Since the claim concerns 'typical' behavior, reporting a measure of the spread of S(Ξ_e(X)) across samples would be informative.
  4. [III.B.3, Eq. (47)] The replacement of the expectation of a ratio by the ratio of expectations is introduced with the symbol ≃ but without any discussion of its accuracy. Even if the fourth-moment term were exact, this step would remain uncontrolled.

Circularity Check

0 steps flagged · score 1.0 of 10

No circular derivation: Theorem 1 is proved from first principles and the asymptotic is a moment estimate, not a fit; only a minor non-load-bearing self-citation appears.

full rationale

Theorem 1 is proven directly from the definitions: for Y=Ξ_e(X), the invariance Y^{RΓ}=Y and Y^{ΓR}=Y gives YY†=Y^R(Y^R)†=Y^Γ(Y^Γ)†, so the equality of the three entropies follows from the definition of S(X). No fitted parameter and no prior result of the authors enters the proof. Proposition 2 is a leading-moment estimate from Haar-unitary moments: E[Tr(YY†)] is computed explicitly in Eqs. (38)-(45), and Eq. (46) invokes the standard Collins–Śniady fourth-moment formalism. The approximations in Eqs. (46)-(47), namely the omitted full fourth-moment expansion and the replacement of the expectation of a ratio by the ratio of expectations, are uncontrolled but not circular: no parameter is fitted to the predicted d^{-2} deficit, and Fig. 2 provides independent numerical support. The fixed-point discussion cites [19], which shares an author with the present paper, for the nonexistence of a unitary X with X=X^R=X^Γ, but that claim is not load-bearing for the central theorem or the asymptotic prediction and can be checked directly from index-permutation invariance; it is a minor background self-citation rather than a circular step. Conjecture 1 is explicitly labeled a conjecture, not a derived result. Overall, no equation reduces to its input by construction, and no fitted value is renamed as a prediction.

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

The central claim rests on standard linear algebra, Haar-moment formulas from random matrix theory, and the known equivalence between AME states and two-unitary matrices. No free parameters or invented physical entities appear.

assumptions (5)
  • domain assumption The three balanced bipartitions of a four-party state |ψ⟩=vec(X)/||X|| have linear entropies given by S(X), S(X^R), S(X^Γ) for the reshuffling and partial transposition definitions of Eq. (2).
    Standard index mapping; used implicitly in Theorem 1 to identify the bipartition entropies.
  • standard math Haar-random unitary matrix elements satisfy E[X_I \bar{X}_J]=δ_IJ/d² and the standard fourth-moment asymptotics (Collins–Śniady).
    Used in Proposition 2 to compute E[Tr(YY†)] and E[Tr((YY†)^2)].
  • standard math The operators R and Γ generate the six-element group G with χ=RΓ of order 3.
    Proved by explicit index permutations; foundation for Propositions 1 and the limiting maps.
  • domain assumption There exists no unitary matrix X with X=X^R=X^Γ (cited from Ref. [19]).
    Used to argue full-group-invariant fixed points cannot be unitary.
  • domain assumption The equivalence AME(4,d) ⇔ two-unitary U(d²) (Observation 1, cited from Ref. [5]).
    Used to connect fixed points of Ξ to AME states and Latin squares.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Equi-Entropic Maps for Four-Partite Quantum States." pith.science (2026). https://pith.science/paper/4FEGH6GB

@misc{pith2026260725954,
  author       = {Pith},
  title        = {Pith review of: Equi-Entropic Maps for Four-Partite Quantum States},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/4FEGH6GB}},
  note         = {Machine review of arXiv:2607.25954}
}
abstract

Absolutely maximally entangled states represent a highly constrained form of multipartite entanglement and play an important role in quantum information theory. We investigate a weaker form of uniformity of entanglement for four-party systems of local dimension $d>2$ that requires the three balanced bipartitions to have equal but not necessarily maximal linear entropy. We introduce a linear map $\Xi$ that enforces exact equality of entropies under reshuffling and partial transposition. The transformation arises as the asymptotic limit of an iterative averaging procedure and admits a group-theoretic description in terms of permutations of tensor indices. For Haar-random unitary inputs, a leading-moment analysis supported by numerical simulations predicts highly entangled outputs whose common entropy approaches the maximal value as the local dimension grows. We characterize the algebraic structure, fixed points, and asymptotic behavior of this map and its relation to two-unitary matrices and orthogonal Latin squares.

Figures

Figures reproduced from arXiv: 2607.25954 by the authors.

Figure 1
Figure 1. Three examples of two-unitary centrosymmetric permuta [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗
Figure 2
Figure 2. As the local dimension d tends to infinity, E[S(Ξe(X))], for a Haar-random unitary X ∈ U(d 2 ), saturates at 1. The vertical axis indicates the equal-entropy values s = S(Ξe(X)) defined in Sec. II. Squares on the solid line represent theoretical predictions, while dots with error bars (corresponding to the standard error) show the sample means over 256 independent Haar-random unitaries. C. Distance from Maximal Mixe… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

41 extracted references · 1 canonical work pages

  1. [1]

    Fixed Points The fixed points of the two limiting maps have a simple de- scription based on the group theory. Adopting the notation used in the proof of Proposition 1, we see thatΞ e is the aver- aging projection onto the subspace invariant under the cyclic subgroup generated byχ=RΓ, see (12). HenceΞ e(X)=X if and only ifX RΓ =X ΓR =X. Any fixed point ofΞ...

  2. [2]

    36officers

    Relation to Latin Squares Two-unitary permutation matrices are naturally related to pairs of orthogonal Latin squares of orderd[20], denoted by OLS(d). In this view, the additional conditionP=Ξ e(P) imposes a cyclic symmetry on the underlying combinatorial structure. Thus, the problem of finding a two-unitary permu- tation matrix being a fixed point ofΞ e...

  3. [3]

    Range of Image and Asymptotics Given an initial pointXit is unusual thatS(Ξ(X))satu- rates at1, unlessXhas a very special structure. Nevertheless, a generic choice of the starting point provides matricesΞ(X) for which its entropy is quite close to unity and, moreover, as the local dimensiondgrows,S(Ξ(X))approaches1rela- tively fast. Proposition 2.For a Ha...

  4. [4]

    Quantum Secure Communication with Adaptive Lay- ers and Ranks (Q-SCALAR)

    In particular, an entropy deficit of orderO(d −2)guaran- tees the HS defect of orderO(d −1)but the bound (57) alone does not establish trace-norm convergence. Moreover, a small marginal AME defect does not by imply the existence of a nearby two-unitary matrix which is exact. IV . SUMMARY We introduced and analyzed a linear mapΞthat enforces equality of th...

    2019

  5. [5]

    Hayden, D

    P. Hayden, D. W. Leung, and A. Winter, Communications in Mathematical Physics265, 95 (2006)

    2006

  6. [6]

    A. J. Scott, Phys. Rev. A69, 052330 (2004)

    2004

  7. [7]

    Facchi, G

    P. Facchi, G. Florio, U. Marzolino, G. Parisi, and S. Pascazio, New Journal of Physics12, 025015 (2010)

    2010

  8. [8]

    Helwig, W

    W. Helwig, W. Cui, J. I. Latorre, A. Riera, and H.-K. Lo, Phys. Rev. A86, 052335 (2012)

    2012

Show all 41 references
  1. [9]

    Goyeneche, D

    D. Goyeneche, D. Alsina, J. I. Latorre, A. Riera, and K. ˙Zy- czkowski, Phys. Rev. A92, 032316 (2015)

    2015

  2. [10]

    Helwig, Absolutely maximally entangled qudit graph states (2013), arXiv:1306.2879 [quant-ph]

    W. Helwig, Absolutely maximally entangled qudit graph states (2013), arXiv:1306.2879 [quant-ph]

    2013 arXiv

  3. [11]

    Goyeneche and K

    D. Goyeneche and K. ˙Zyczkowski, Phys. Rev. A90, 022316 (2014)

    2014

  4. [12]

    Goyeneche, Z

    D. Goyeneche, Z. Raissi, S. Di Martino, and K. ˙Zyczkowski, Physical Review A97, 062326 (2018)

    2018

  5. [13]

    Raissi, C

    Z. Raissi, C. Gogolin, A. Riera, and A. Acín, Journal of Physics A: Mathematical and Theoretical51, 075301 (2018)

    2018

  6. [14]

    Raissi and V

    Z. Raissi and V . Karimipour, Quantum Information Processing 16, 10.1007/s11128-017-1535-9 (2017)

    2017 doi

  7. [15]

    Burchardt and Z

    A. Burchardt and Z. Raissi, Physical Review A102, 10.1103/physreva.102.022413 (2020)

    2020 doi

  8. [16]

    Rajchel-Mieldzio ´c, R

    G. Rajchel-Mieldzio ´c, R. Bistro´n, A. Rico, A. Lakshminarayan, and K. ˙Zyczkowski, Reports on Progress in Physics89, 057601 (2026)

    2026

  9. [17]

    Facchi, G

    P. Facchi, G. Florio, G. Parisi, and S. Pascazio, Phys. Rev. A 77, 060304(R) (2008)

    2008

  10. [18]

    Ball and R

    S. Ball and R. Zhang, Phys. Rev. A113, 012432 (2026)

    2026

  11. [19]

    D. A. Meyer and N. R. Wallach, Journal of Mathematical Physics43, 4273 (2002)

    2002

  12. [20]

    Jonnadula, P

    B. Jonnadula, P. Mandayam, K. ˙Zyczkowski, and A. Lakshmi- narayan, Phys. Rev. Res.2, 043126 (2020)

    2020

  13. [21]

    Drieb-Schön, F

    M. Drieb-Schön, F. Dreier, and W. Lechner, Phys. Rev. A114, 012401 (2026)

    2026

  14. [22]

    Mestyán, B

    M. Mestyán, B. Pozsgay, and I. M. Wanless, SciPost Phys.16, 010 (2024)

    2024

  15. [23]

    Bruzda, G

    W. Bruzda, G. Rajchel-Mieldzio ´c, and K. ˙Zyczkowski, Open Systems & Information Dynamics31, 2450008 (2024)

    2024

  16. [24]

    Two Latin squares of orderdare said to be orthogonal, written OLS(d), if, when superimposed, they form an array of ordered pairs with no repetitions

  17. [25]

    R. C. Bose, S. S. Shrikhande, and E. T. Parker, Can. J. Math. 12, 189 (1960)

    1960

  18. [26]

    C. J. Colbourn and J. H. Dinitz, inThe CRC Handbook of Com- binatorial Designs(Chapman & Hall/CRC, 2007) 2nd ed., pp. 63–80

    2007

  19. [27]

    Higuchi and A

    A. Higuchi and A. Sudbery, Physics Letters A273, 213 (2000)

    2000

  20. [28]

    D. R. Stinson, J. Combin. Theory Ser. A36, 373 (1984)

    1984

  21. [29]

    S. A. Rather, A. Burchardt, W. Bruzda, G. Rajchel-Mieldzio ´c, A. Lakshminarayan, and K. ˙Zyczkowski, Phys. Rev. Lett.128, 080507 (2022)

    2022

  22. [30]

    S. A. Rather, Quantum8, 1528 (2024)

    2024

  23. [31]

    Bruzda and K

    W. Bruzda and K. ˙Zyczkowski, Special Matrices12, 20240010 (2024). 8

    2024

  24. [32]

    Gross and P

    D. Gross and P. Goedicke, Thirty-six officers, artisanally entan- gled (2025)

    2025

  25. [33]

    A matrixPof sized 2 ×d 2 is called centrosymmetric ifP ij = Pd2+1−i,d2+1−j

  26. [34]

    Miller, R

    A. Miller, R. J. R. Abel, I. Valkov, and D. Fraser, Symmetry16, 1678 (2024)

    2024

  27. [35]

    Collins and P

    B. Collins and P. ´Sniady, Communications in Mathematical Physics264, 773 (2006)

    2006

  28. [36]

    Casas, G

    B. Casas, G. Rajchel-Mieldzio ´c, S. Ahmad Rather, M. Płodzie ´n, W. Bruzda, A. Cervera-Lierta, and K. ˙Zy- czkowski, Quantum Science and Technology11, 025011 (2026)

    2026

  29. [37]

    K. Guo, F. Shi, Y . Zhou, and Q. Zhao, Approximatek- uniform states: Definition, construction and applications (2025), arXiv:2507.19018 [quant-ph]

    2025 arXiv

  30. [38]

    Facchi, G

    P. Facchi, G. Florio, C. Lupo, S. Mancini, and S. Pascazio, Phys. Rev. A80, 062311 (2009)

    2009

  31. [39]

    J. I. Kwon, A. J. Brady, and V . V . Albert, Abso- lutely maximal entanglement in continuous variables (2025), arXiv:2503.15698 [quant-ph]. Appendix A: Explicit MOLS Associated with Symmetric Two-Unitary Permutations In this appendix, we provide complete sets of mutually or- t...

    2025

  32. [40]

    MOLS(7) 2430516 3502146 2146035 4105263 6324105 5421360 6324105 5421360 3502146 2430516 4105263 2146035 3041652 1360254 6035421 1652430 0516324 0254613 5263041 4613502 4613502 5263041 5263041 4613502 4105263 2146035 5421360 6324105 2430516 3502146 1652430 6035421 0254613 05163...

  33. [41]

    MOLS(9) 135076284 470821356 746051832 761480253 164783052 831257046 178264503 567218430 612453708 712534068 862105374 340275618 487150263 504361278 201873465 306182547 254607813 567218430 583426017 457163082 273015648 780613524 746051832 712534068 367821540 143607285 324510786...

Pith tools

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