Decoding toric codes on three dimensional simplical complexes

TL;DR

This paper introduces an efficient decoding algorithm for 3D toric codes on arbitrary lattices, extending decoding capabilities beyond cubic lattices and aiding the study of related topological codes.

Contribution

It presents a novel decoding algorithm for 3D toric codes on arbitrary lattices, including those derived from color and gauge color codes.

Findings

Achieved a 12.2% threshold for cubic lattice toric codes under bit flip errors.

Demonstrated decoding on arbitrary lattices with and without boundaries.

Extended decoding techniques to non-cubic 3D toric codes.

Abstract

Three dimensional (3D) toric codes are a class of stabilizer codes with local checks and come under the umbrella of topological codes. While decoding algorithms have been proposed for the 3D toric code on a cubic lattice, there have been very few studies on the decoding of 3D toric codes over arbitrary lattices. Color codes in 3D can be mapped to toric codes. However, the resulting toric codes are not defined on cubic lattice. They are arbitrary lattices with triangular faces. Decoding toric codes over an arbitrary lattice will help in studying the performance of color codes. Furthermore, gauge color codes can also be decoded via 3D toric codes. Motivated by this, we propose an efficient algorithm to decode 3D toric codes on arbitrary lattices (with and without boundaries). We simulated the performance of 3D toric code for cubic lattice under bit flip channel. We obtained a threshold of 12.2\% for the toric code on the cubic lattice with periodic boundary conditions.