Composite-Dimensional Topological Codes with Boundaries and Defects

TL;DR

This paper introduces algorithms and models for topological quantum codes with boundaries and defects, enabling new error correction strategies in higher-dimensional quantum systems.

Contribution

It provides explicit stabilizer construction algorithms for composite-dimensional topological codes with boundaries and defects, including new quantum error-correcting codes.

Findings

Validated codes with error thresholds comparable to surface codes.

Developed a composite dimensional belief propagation decoder.

Automated code design using dimensional counting and pants decompositions.

Abstract

We introduce new algorithms and provide example constructions of stabilizer models for the gapped boundaries, domain walls, and $0D$ defects of Abelian composite-dimensional twisted quantum doubles. Using the physically intuitive concept of condensation, our algorithm explicitly describes how to construct the boundary and domain-wall stabilizers starting from the bulk model. This extends the utility of Pauli stabilizer models in describing non-translationally invariant topological orders with gapped boundaries. To highlight this utility, we provide a series of examples, including a new family of quantum error-correcting codes where the double of $\mathbb{Z}_4$ is coupled to instances of the double semion (DS) phase. We discuss the codes' utility in the burgeoning area of quantum error correction with an emphasis on the interplay between deconfined anyons, logical operators, error rates, and decoding. We also augment our construction, built using algorithmic tools to describe the properties of explicit stabilizer layouts at the microscopic lattice-level, with dimensional counting arguments and macroscopic-level constructions building on pants decompositions. The latter outlines how such codes' representation and design can be automated. Our results are validated by a series of error-correcting threshold calculations comparing our code's performance with standard surface codes. To do so, we introduce a composite dimensional belief propagation decoder with ordered statistics that utilizes combination sweeps. Going beyond our worked-out examples, we expect our explicit step-by-step algorithms to pave the path for new higher-dimensional codes to be discovered and implemented in near-term architectures that take advantage of various hardware's distinct strengths.