Linear upper bound for the partition rank of two maximally entangled pairs

Establish whether the partition rank of two copies of a maximally entangled state, with allowed partitions $\{AC|BD,AD|BC\}$, admits an upper bound that scales linearly with the local dimension $d$.

Background

The paper considers the tensor product of two maximally entangled states, Φ+ABΦ+CD|\Phi^+\rangle_{AB}|\Phi^+\rangle_{CD}, and asks for the minimum number of terms in a decomposition whose terms are separable only across the partitions ACBDAC|BD or ADBCAD|BC.

A construction gives the upper bound $1+d(d-1)/2$, which is quadratic in the local dimension. The authors identify as unresolved whether a stronger upper bound with linear dependence on dd, as suggested in the cited mathematical literature, can be obtained.

References

Still, this leaves the question of a bound with linear scaling in the dimension $d$ as suggested in Ref. open.

Quantifying the dimensionality of multiparticle entanglement via partition rank  (2608.23399 - Denker et al., 24 Aug 2026) in Section “Connections to mathematics”