A lower-bound conjecture for the tripartite nullity

From papers

Let V1,V2,V3V_1,V_2,V_3 be the local qudit vector spaces with dimensions d1,d2,d3d_1,d_2,d_3, and let nan_a be the corresponding one-party nullities. For a tripartite state vV1V2V3v\in V_1\otimes V_2\otimes V_3, let n1,2,3n_{1,2,3} denote the nullity of the common kernel space K1,2,3(v)K_{1,2,3}(v). The tripartite-nullity lower-bound conjecture. The nullity n1,2,3n_{1,2,3} satisfies

n1,2,3max{(d1d2d3+n3)n3,(d1d3d2+n2)n2,(d2d3d1+n1)n1}.n_{1,2,3}\ge\max\bigl\{(d_{1}d_{2}-d_{3}+n_{3})n_{3},(d_{1}d_{3}-d_{2}+n_{2})n_{2},(d_{2}d_{3}-d_{1}+n_{1})n_{1}\bigr\}.

The authors report extensive empirical evidence for this lower bound, which is intended to improve the available estimates for the invariant controlling tripartite entanglement classes; its general validity remains open.

Progress summary

Open

The conjectured lower bound has supporting experiments but no publicly reported proof or counterexample, so the problem remains open.

The problem asks whether a proposed lower bound always holds for the common-kernel nullity of a tripartite quantum state. It appears as Conjecture 3.2 in a December 2024 preprint, which presents it as an open question.

December 2024 preprint

The authors report extensive empirical evidence for the conjecture and describe the one-party nullity problem as completely characterized. For the tripartite common-kernel nullity, however, they give only bounds and no general proof; the retrieved sources report no counterexample, verification, or claimed solution.

Current status (as of August 2026): The lower bound remains an empirically supported open conjecture, with no publicly reported proof or counterexample in the retrieved sources.

Sources
Sources & referencesView supporting material

Primary source

Roman V. Buniy and Thomas W. Kephart, “Tripartite entanglement of qudits”, arXiv:2412.10728 (2024).

Solutions 1

Proof

Let vV1V2V3v\in V_1\otimes V_2\otimes V_3, put di=dimVid_i=\dim V_i, ni=dimKi(v)n_i=\dim K_i(v), and set ri=dinir_i=d_i-n_i. Thus rir_i is the rank of the ii-th flattening of vv.

For each permutation (i,j,k)(i,j,k) of (1,2,3)(1,2,3), the two-party contraction

fj,k(v):VjVkVif_{j,k}(v):V_j\otimes V_k\longrightarrow V_i^*

has rank rir_i, and hence

dimkerfj,k(v)=djdkri.\dim\ker f_{j,k}(v)=d_jd_k-r_i.

For uKi(v)u\in K_i(v) and zkerfj,k(v)z\in\ker f_{j,k}(v), the tensor uzu\otimes z belongs to the common kernel K1,2,3(v)K_{1,2,3}(v). Indeed, the (j,k)(j,k)-contraction vanishes because zkerfj,k(v)z\in\ker f_{j,k}(v), and each of the other two pair contractions vanishes because uKi(v)u\in K_i(v). Consequently,

Ki(v)kerfj,k(v)K1,2,3(v),K_i(v)\otimes\ker f_{j,k}(v)\subseteq K_{1,2,3}(v),

so

n1,2,3(v)ni(djdkri)=ni(djdkdi+ni).n_{1,2,3}(v)\geq n_i(d_jd_k-r_i) =n_i(d_jd_k-d_i+n_i).

Taking the maximum over i=1,2,3i=1,2,3 gives precisely the asserted lower bound for every tripartite tensor, including the zero tensor.

0 endorsements
Shivam Patel ·