Higher-dimensional quantum hypergraph-product codes

TL;DR

This paper introduces a new family of quantum error-correcting codes called higher-dimensional quantum hypergraph-product codes, which generalize existing codes and are constructed recursively using tensor products of complexes.

Contribution

It extends quantum hypergraph-product codes to higher dimensions and provides explicit parameters based on binary code matrices.

Findings

Codes form m-complexes with m ≥ 2

Parameters are explicitly derived from binary matrices

Generalizes toric and hypergraph-product codes

Abstract

We describe a family of quantum error-correcting codes which generalize both the quantum hypergraph-product (QHP) codes by Tillich and Z\'emor, and all families of toric codes on $m$-dimensional hypercubic lattices. Similar to the latter, our codes form $m$-complexes ${\cal K}_m$, with $m\ge2$. These are defined recursively, with ${\cal K}_m$ obtained as a tensor product of a complex ${\cal K}_{m-1}$ with a $1$-complex parameterized by a binary matrix. Parameters of the constructed codes are given explicitly in terms of those of binary codes associated with the matrices used in the construction.