\(SU(4)\) Tverberg spin code[1; Sec. 6.3]
Description
Single-spin code family in the totally symmetric \(N\)-particle irrep \(\mathcal{H}=\mathrm{Sym}^N(\mathbb{C}^4)\) of \(\mathfrak{su}(4)\), whose weight diagram is the discrete simplex \(\Delta_{4,N}\), equivalently its centered tetrahedral realization. The construction uses the two-step Tverberg-theorem method [2]: first choose an intermediate subspace from a distance-two subset of \(\Delta_{4,N}\), then combine basis states whose convex hulls contain the origin.
For \(N\) divisible by eight, an optimal distance-two intermediate lattice is obtained as the kernel of \begin{align} a_1L_1+a_2L_2+a_3L_3+a_4L_4 \mapsto a_1+2a_2+3a_3 \pmod 4~. \tag*{(1)}\end{align} The second step pairs opposite points in the central octahedral region and can form additional triples and quadruples near the tetrahedron’s corners; for \(N=8\), this partition is optimal within the two-step framework [1; Sec. 6.3 and Ex. 6.10].
More explicitly, write the normalized monomial basis of \(\mathrm{Sym}^N(\mathbb{C}^4)\) as \(|a_1a_2a_3a_4\rangle\), where \((a_1,a_2,a_3,a_4)\in\Delta_{4,N}\), and let \(\Lambda_B^N\) be the kernel above. For each block \(Y\subset\Lambda_B^N\) whose convex hull contains the origin, choose barycentric weights \(\{\beta_{\mathbf{a}}\}_{\mathbf{a}\in Y}\) satisfying \(\beta_{\mathbf{a}}\geq0\), \(\sum_{\mathbf{a}\in Y}\beta_{\mathbf{a}}=1\), and \(\sum_{\mathbf{a}\in Y}\beta_{\mathbf{a}}\mathbf{a}=0\) in centered \(\Delta_{4,N}\) coordinates. The corresponding codeword is \begin{align} |\psi_Y\rangle=\sum_{\mathbf{a}\in Y}\sqrt{\beta_{\mathbf{a}}}\,|\mathbf{a}\rangle~. \tag*{(2)}\end{align} Thus opposite pairs give \((|p\rangle+|-p\rangle)/\sqrt{2}\); triples of the form \(\{p,p',-(p+p')\}\) give \((|p\rangle+|p'\rangle+|-(p+p')\rangle)/\sqrt{3}\); and zero-sum quadruples give equal four-term superpositions.
Protection
Detects single Lie-algebra errors from the \(\mathfrak{su}(4)\) error set, equivalently errors in \(V_1=\mathfrak{su}(4)\oplus \mathbb{C}I\) in the Lie-type graph metric. The first step suppresses off-diagonal root-space errors by choosing weight vectors separated by graph distance at least two in the centered \(\Delta_{4,N}\) discrete simplex, leaving only a commuting diagonal error algebra for the convex-geometric second step [1; Secs. 5.1,5.2,6.3].Rate
The distance-two intermediate subset has asymptotic density \(1/4\) in \(\Delta_{4,N}\). The generic Tverberg step gives an asymptotic code dimension at least \(\dim\mathcal{H}/16\), while the extra triangle constructions improve finite-size instances but do not change the leading asymptotic rate in the construction described in Ref. [1; Sec. 6.3].Member of code lists
Primary Hierarchy
References
- [1]
- Ruochuan Xu, “Classical Construction of Quantum Codes”, undergraduate thesis, January 2023
- [2]
- E. Knill, R. Laflamme, and L. Viola, “Theory of Quantum Error Correction for General Noise”, (1999) arXiv:quant-ph/9908066
Page edit log
- Victor V. Albert (2026-05-26) — most recent
Cite as:
“\(SU(4)\) Tverberg spin code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/su4_tverberg_spin