2000 character limit reached
Golden codes: quantum LDPC codes built from regular tessellations of hyperbolic 4-manifolds (1712.08578v2)
Published 22 Dec 2017 in quant-ph, cs.IT, and math.IT
Abstract: We adapt a construction of Guth and Lubotzky [arXiv:1310.5555] to obtain a family of quantum LDPC codes with non-vanishing rate and minimum distance scaling like $n{0.1}$ where $n$ is the number of physical qubits. Similarly as in [arXiv:1310.5555], our homological code family stems from hyperbolic 4-manifolds equipped with tessellations. The main novelty of this work is that we consider a regular tessellation consisting of hypercubes. We exploit this strong local structure to design and analyze an efficient decoding algorithm.