Problem
Research questions and friction points this paper is trying to address.
triorthogonal codes
quantum error correction
dual-distance
magic-state distillation
quantum decoding
On Constructing and Decoding Quantum Triorthogonal Codes
🤖 AI Summary
This work addresses fault-tolerant universal quantum computation by investigating the construction and efficient decoding of quantum triorthogonal codes that satisfy dual/triple orthogonality constraints and row-weight requirements. By integrating the MacWilliams identity with Krawtchouk polynomial conditions, the authors formulate an integer linear programming model and introduce a doubling construction method, yielding novel triorthogonal codes with high dual distance derived from non-classical triply-even codes for the first time. They further establish a criterion for the existence of triorthogonal generator matrices and adapt the GRAND decoder to the quantum setting, demonstrating significantly superior performance over conventional decoding approaches under depolarizing noise channels.
📝 Abstract
A triorthogonal code is a binary quantum Calderbank-Shor-Steane (CSS) code defined by a triorthogonal matrix. Triorthogonal codes are a key ingredient in magic-state distillation, since they allow for transversal $\mathsf{T}$ gates, a non-Clifford logical operation useful for achieving universal fault-tolerant quantum computation. Their construction is challenging because it must satisfy simultaneous pairwise and triple-wise overlap constraints, as well as row-weight requirements. In this work, we study the construction and decoding of triorthogonal codes with prescribed 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 new nontrivial triorthogonal codes that are not necessarily generated by classical triply-even codes. The decoding performance of high-distance triorthogonal codes obtained via the doubling construction is then evaluated over the dephasing channel. We compare bounded-distance decoding, belief propagation plus ordered-statistics post-processing, and a GRAND-based decoder adapted to the quantum setting, which turns out to be a promising option.
Innovation
Methods, ideas, or system contributions that make the work stand out.
triorthogonal codes
quantum error correction
integer linear programming
MacWilliams identities
GRAND decoding
🔎 Similar Papers
No similar papers found.
💼 Related Jobs
