\([[132,30,12]]\) self-dual GALA code[1]
Description
A hyperbolic self-dual GALA code whose Hadamard-type and phase-type fold-transversal Clifford operations are implemented physically by depth-one layers of single-qubit gates.
The code is \(\mathrm{GALA}_{12,5}(e\times C_{11})\): the row weight is \(L=12\), the number of active block rows is \(J=5\), the non-Abelian top is trivial, and the Abelian bottom is the cyclic group \(C_{11}\), giving \(n=12\times1\times11=132\) qubits at rate \(0.227\) [1]. Every entry of the \(G\)-lift is a single group element, so the code is monomial. Its \(ZX\) duality comes from a reflection-type sector involution, which is why the Tanner graph has girth four rather than the girth of at least six targeted elsewhere in the family. The duality permutation is the identity, which is what reduces both fold-transversal operations to depth-one layers of single-qubit gates [1].
Since the duality permutation is the identity, the two fold-transversal operators are \begin{align} H_{\tau}=H^{\otimes 132}~,\qquad S_{\tau}=(S^{\dagger})^{\otimes 132}~, \tag*{(1)}\end{align} each a depth-one layer of single-qubit gates [1]. In an orthonormal logical basis, \(H_{\tau}\) acts as fifteen copies of \((\bar H\otimes\bar H)\overline{\mathrm{SWAP}}\), while \(S_{\tau}\) acts as fifteen disjoint logical controlled-\(Z\) gates together with single-logical-qubit phases on thirteen of the thirty logical qubits [1].
Protection
The rate is \(0.227\) and the Tanner graph has girth four [1]. Since \(J>L/4\), the parent matrices are fully orthogonal, and an independent latent row supplies a weight-\(L\) logical operator. An exhaustive search certifies \(d=L=12\), so the code attains that cap exactly [1].
Minimum-weight bases of \(X\)-type and of \(Z\)-type logical operators attain the code distance on every logical qubit, with all representatives of weight 12, but the two bases are not symplectic partners [1]. Completing the minimum-weight \(X\)-type basis to a symplectic basis requires \(Z\)-type partners of weights 18 to 24.
Transversal and Permutation-Based Gates
The physical depth-one layers \(H^{\otimes 132}\) and \((S^{\dagger})^{\otimes 132}\) implement Hadamard-type and phase-type logical Clifford operations. In an orthonormal logical basis these are, respectively, fifteen \((\bar H\otimes\bar H)\overline{\mathrm{SWAP}}\) operations and fifteen disjoint logical controlled-\(Z\) gates together with phases on thirteen logical qubits [1].Gates
A cyclic shift automorphism is implemented by a single rigid qubit permutation, shifting the bottom chains by one while fixing the top chain [1]. The shift is termed dirty because each chain of eleven sites carries only ten logical qubits, so the eleven-cycle permutes an overcomplete labeling rather than a basis.Decoding
At physical error rate \(10^{-3}\), a two-stage Relay-BP cascade with a mixed-integer linear-programming fallback ran five million circuit-level shots without a recorded logical failure [1].Primary Hierarchy
References
- [1]
- W. Yang, C. Duckering, and A. Dua, “Designer Codes from GALA: Compact, Self-Dual, and Rate-1/2 QEC on Reconfigurable Atom Arrays”, (2026) arXiv:2608.07431
- [2]
- J. Haah, M. B. Hastings, D. Poulin, and D. Wecker, “Magic state distillation with low space overhead and optimal asymptotic input count”, Quantum 1, 31 (2017) arXiv:1703.07847 DOI
Page edit log
- Victor V. Albert (2026-08-26) — most recent
- Victor V. Albert (2026-08-25)
- Victor V. Albert (2026-08-17)
- Victor V. Albert (2026-08-15)
Cite as:
“\([[132,30,12]]\) self-dual GALA code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/gala_132, arXiv:2606.11484