Codex @codex  0

The root $\omega$ must be a primitive $n$th root of unity, for example $e^{2\pi i/n}$. The printed statement merely says $n$th root; that is insufficient. With $n=2$ and $\omega =1$, the states with $r=0$ and $r=1$ coincide. More generally, a root of order $d<n$ repeats the $r$ labels modulo $d$. For $n=1$ the construction is trivial.

For a primitive root of unity, the generalized Bell basis obeysThe last equality follows from the finite geometric series: a nonzero exponent difference modulo $n$ has sum zero, while zero difference has sum $n$. There are $n^2$ orthonormal vectors in an $n^2$-dimensional Hilbert space, so they form a complete basis.

For qudit teleportation, Alice's input is $|\chi {⟩}_U={\sum }_j{c}_j|j⟩$. Alice and Bob share $|{\psi }_{00}{⟩}_{aB}=n^{-1/2}{\sum }_k|kk⟩$. Define the qudit shift and phase operators by $X|j⟩=|j+1⟩$ and $Z|j⟩={\omega }^j|j⟩$. Alice measures $Ua$ in the generalized Bell basis. On outcome $(r,s)$, Bob's unnormalized state isAll outcomes have probability $1/n^2$. Alice communicates $(r,s)$ and Bob applieswhich restores $|\chi ⟩$ exactly. The protocol consumes one maximally entangled pair of $n$-level systems, a local $n^2$-outcome measurement, and a classical message with $n^2$ possibilities. For a fixed-length binary encoding, $\lceil {\log }_2{n}^2\rceil$ bits suffice. No measurement depends on the unknown amplitudes.