On Constructing and Decoding Quantum Triorthogonal Codes

Abstract:Triorthogonal codes are a basic ingredient in magic-state distillation, as they enable transversal implementation of logical $\mat{T}$ gates. As a non-Clifford operation, the $\mat{T}$ gate enables universal fault-tolerant quantum computation when combined with Clifford operations. In this work, we study the construction and decoding of triorthogonal codes with given dual distance properties. We derive an existence criterion for even-weight triorthogonal generator matrices with a target dual minimum distance. The criterion combines triorthogonality constraints with MacWilliams identities via Krawtchouk polynomial conditions on the dual weight distribution, yielding an integer linear programming formulation for the construction problem. We find novel nontrivial triorthogonal codes (degenerate and non-degenerate), that are not necessarily constructed from triply-even binary linear codes. We also evaluate the performance of the obtained high-distance triorthogonal codes over the dephasing channel using different decoding methods, showing that automorphism ensemble decoding and guessing random additive-noise decoding (GRAND) are promising options.

Quantum Physics (quant-ph); Information Theory (cs.IT)

arXiv:2605.24519 [quant-ph]

(or arXiv:2605.24519v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2605.24519 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.