\([[1152,580,\leq 12]]\) co-designed Kasai code[1]
Description
Kasai code with \(J=3\), \(L=12\), and lift size \(P=96\) whose affine permutations are chosen so that every transition permutation of syndrome extraction commutes with a fixed reference affine permutation having three orbits of length \(32\) [1]. In the qubit ordering along those orbits, each transition is a cyclic shift within the orbits plus a permutation between them, which yields a three-by-thirty-two layout with a syndrome-extraction schedule of constant qubit-movement cost [1].
The code has \(n=LP=1152\) qubits and girth at least six, and non-commutativity is imposed on the index pairs \((0,3)\) and \((1,2)\) [1]. The twelve affine permutations \(f_i(x)=a_ix+b_i\) and \(g_i(x)=c_ix+d_i\) defining the \(G\)-lift are tabulated in Ref. [1].
The code is permutation equivalent to the GALA code \(\mathrm{GALA}_{12,3}(S_3\times\mathbb{Z}_{32})\), and its \([[2304,1156]]\) sibling to \(\mathrm{GALA}_{12,3}(S_3\times\mathbb{Z}_2\times\mathbb{Z}_{32})\) [2]. The non-Abelian factor \(S_3\) and Abelian factor \(\mathbb{Z}_{32}\) of that presentation reproduce the reference-permutation orbit structure and recover the same movement schedule from the group data [2].
Protection
The encoding rate is \(0.503\), and the distance is reported only as the upper bound \(d \leq 12\) [1].Decoding
Hierarchical decoder combining the throughput of belief propagation with an exact integer-programming fallback [1].Fault Tolerance
Syndrome extraction requires at most one horizontal shift together with one vertical shift or swap per step, on a three-by-thirty-two qubit layout [1].Under a circuit-level noise model at physical error rate \(10^{-3}\) without idling noise, the average per-logical-qubit-per-round error rate is directly observed to be \(2.9^{+3.1}_{-1.5}\times10^{-11}\) [1]. The \([[2304,1156,\leq 14]]\) instance reaches \(1.3^{+3.0}_{-0.9}\times10^{-13}\) [1].Cousin
- Cornucopia code— The \([[1152,580,\leq 12]]\) code is permutation equivalent to a \(\mathrm{GALA}_{12,3}(S_3\times\mathbb{Z}_{32})\) code [2], drawn from the same direct-product GALA sector as the Cornucopia family. It need not lie in the family itself since its lift takes mutually inverse row translations where the Cornucopia construction repeats a single one [1,3]. Its \([[2304,1156]]\) sibling has non-cyclic Abelian factor \(\mathbb{Z}_2\times\mathbb{Z}_{32}\) and also lies outside the family [2].
Primary Hierarchy
References
- [1]
- C. Zhao, C. Duckering, A. Gu, N. Maskara, and H. Zhou, “Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays”, (2026) arXiv:2604.16209
- [2]
- 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
- [3]
- Z. Lu, W. Li, and D.-L. Deng, “Quantum error correction at ultra-low overhead”, (2026) arXiv:2608.02773
Page edit log
- Victor V. Albert (2026-09-26) — most recent
- Victor V. Albert (2026-08-26)
- Victor V. Albert (2026-08-25)
- Victor V. Albert (2026-08-17)
- Victor V. Albert (2026-08-15)
Cite as:
“\([[1152,580,\leq 12]]\) co-designed Kasai code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/kasai_1152, arXiv:2606.11484