arXiv:2609.30860
Classification of Generalised Triorthogonal Codes through Length 54
Adam Wills, Shubham P. Jain, Shraddha Singh
Abstract
Magic state distillation is a widely considered primitive in fault-tolerant quantum computation for the preparation of high-fidelity non-Clifford resources. The most commonly considered class of such protocols are generalised triorthogonal codes; these distil $n$ noisy input $\mathrm{T}$ states into purified third-level diagonal magic states. Extensive prior work has searched this space of protocols, often using heuristic methods that do not guarantee optimality. Existing classification work is limited to protocols distilling $k$ output $\mathrm{T}$ states with $n+k\leq 38$ (Nezami and Haah, Phys. Rev. A 106, 012437 (2022)). In this work, we significantly expand this classification to all protocols with lengths $n\leq 54$. We restrict to distance $d\geq 3$ to keep the classification to a sensible size, and because efficient searches are well understood at distance $2$ (Singh et al., arXiv:2606.28518). Moreover, our results are complementary to synthillation (Campbell and Howard, Phys. Rev. A 95, 022316 (2017)), which can distil third-level states from $\mathrm{T}$ states, but only at distance $2$. Under optimality in terms of input count, space footprint, and distance for a given output, we find $74$ optimal generalised triorthogonal protocols in our range, $65$ of which are new to the literature. To achieve our classification, we extend the classification of unital triorthogonal spaces of Nezami and Haah from length $38$ to $54$ using a directional derivative method. Using these as the stabiliser spaces, we add logical rows that satisfy the triorthogonality constraints to create full protocols.
AI Summary
The paper addresses exhaustive classification of magic-state distillation protocols based on generalised triorthogonal codes, taking noisy $\mathrm{T}$ states to diagonal third-level magic states. It classifies the Pareto frontier for input count $n\leq54$ and distance $d_Z\geq3$, extending the previous classification of protocols producing $k$ $\mathrm{T}$ states with $n+k\leq38$. Outputs are identified under $\mathrm{CNOT}+\mathrm{S}$ equivalence; input count and matrix-row footprint $N$ are compared at fixed output class and exact distance. The classification reduces candidate stabiliser spaces to unital triorthogonal spaces of length at most $54$. These are enumerated through their correspondence with Reed–Muller codewords, using a recursive directional-derivative method: choose a direction with few doubly occupied support pairs, then reconstruct admissible functions by solving binary linear systems. Compatible logical rows are enumerated as subspaces totally isotropic for stabiliser-defined bilinear forms. The resulting frontier contains $74$ resource points across $62$ output classes, with at most seven output qubits; $65$ points are reported as new. Of these, $67$ have distance three, five distance four, and two distance five. Catalogues, matrices, verification evidence, and regeneration code are supplied. The enumeration required roughly $10^5$ core-hours; extending to length $56$ is estimated to require $10^8$. Limitations include excluding distance-two protocols, using restricted rather than full stabiliser equivalence, and measuring footprint without qubit recycling. The algorithmic utility of many output states remains uncharacterised, and the rapid catalogue growth limits further exhaustive enumeration.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.