← Back to papers
Golden codes: quantum LDPC codes from regular tessellations of hyperbolic 4-manifolds
V. Londe, Anthony Leverrier·December 22, 2017·DOI: 10.26421/QIC19.5-6
Computer ScienceMathematicsPhysics
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
We adapt a construction of Guth and Lubotzky \cite{GL14} 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 Ref.~\cite{GL14}, 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.