Classification of Small Triorthogonal Codes

TL;DR

This paper classifies all small triorthogonal quantum error correcting codes with up to 38 qubits and logical qubits, revealing their structure and relation to Reed-Muller polynomials, with implications for magic state distillation.

Contribution

It provides a complete classification of small triorthogonal codes and links them to Reed-Muller polynomials, advancing understanding of quantum error correction and distillation protocols.

Findings

Identified 38 distinguished triorthogonal subspaces.

Showed all codes with n+k ≤ 38 derive from these subspaces.

Improved magic state distillation protocol by reducing time variance.

Abstract

Triorthogonal codes are a class of quantum error correcting codes used in magic state distillation protocols. We classify all triorthogonal codes with $n+k \le 38$, where $n$ is the number of physical qubits and $k$ is the number of logical qubits of the code. We find $38$ distinguished triorthogonal subspaces and show that every triorthogonal code with $n+k\le 38$ descends from one of these subspaces through elementary operations such as puncturing and deleting qubits. Specifically, we associate each triorthogonal code with a Reed-Muller polynomial of weight $n+k$, and classify the Reed-Muller polynomials of low weight using the results of Kasami, Tokura, and Azumi and an extensive computerized search. In an appendix independent of the main text, we improve a magic state distillation protocol by reducing the time variance due to stochastic Clifford corrections.