2000 character limit reached
Higher-dimensional quantum hypergraph-product codes (1810.01519v2)
Published 2 Oct 2018 in quant-ph, math-ph, and math.MP
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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.