Higher-dimensional quantum hypergraph-product codes
classification
🪐 quant-ph
math-phmath.MP
keywords
codesquantumbinarycomplexhypergraph-productassociatedcomplexesconstructed
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.