Magic State Factory Catalog

[\![405,\,101,\,3]\!]

One factory with n=405 inputs, k=101 outputs and distance d=3.

Inequivalent gates at [[405, 101, 3]]. Click a column header to sort.
output gate \gamma_\rho N distance cited
\mathrm{T}_{0}\cdot \mathrm{T}_{1}\cdot \mathrm{T}_{2}\cdot \mathrm{T}_{3}\cdot \mathrm{T}_{4}\cdot \mathrm{T}_{5}\cdot \mathrm{T}_{6}\cdot \mathrm{T}_{7}\cdot \mathrm{T}_{8}\cdot \mathrm{T}_{9}\cdot \mathrm{T}_{10}\cdot \mathrm{T}_{11}\cdot \mathrm{T}_{12}\cdot \mathrm{T}_{13}\cdot \mathrm{T}_{14}\cdot \mathrm{T}_{15}\cdot \mathrm{T}_{16}\cdot \mathrm{T}_{17}\cdot \mathrm{T}_{18}\cdot \mathrm{T}_{19}\cdot \mathrm{T}_{20}\cdot \mathrm{T}_{21}\cdot \mathrm{T}_{22}\cdot \mathrm{T}_{23}\cdot \mathrm{T}_{24}\cdot \mathrm{T}_{25}\cdot \mathrm{T}_{26}\cdot \mathrm{T}_{27}\cdot \mathrm{T}_{28}\cdot \mathrm{T}_{29}\cdot \mathrm{T}_{30}\cdot \mathrm{T}_{31}\cdots 101 terms pure T1.264112d = 3Jain et al. (2026)

Nearest lengths with the same k and d: [\![407,\,101,\,3]\!] · [\![409,\,101,\,3]\!]