Higher-dimensional quantum 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 Km, with m2. These are defined recursively, with Km obtained as a tensor product of a complex Km-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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.