We construct and analyze a family of low-density parity check (LDPC) quantum codes with a linear encoding rate, distance scaling as$n^\epsilon
for\epsilon > 0
andefficientdecodingschemes.Thecodefamilyisbasedontessellationsofclosed,four−dimensional,hyperbolicmanifolds,asfirstsuggestedbyGuthandLubotzky.ThemaincontributionofthisworkistheconstructionofsuitablemanifoldsviafinitepresentationsofCoxetergroups,theirlinearrepresentationsoverGaloisfieldsandtopologicalcoverings.Weestablishalowerboundontheencodingratek/n$of$13/72 = 0.180\ldots $and we show that the bound is tight for the examples that we construct. Numerical simulations give evidence that parallelizable decoding schemes of low computational complexity suffice to obtain high performance. These decoding schemes can deal with syndrome noise, so that parity check measurements do not have to be repeated to decode. Our data is consistent with a threshold of around 4% in the phenomenological noise model with syndrome noise in the single-shot regime.
Recent advances in quantum hardware relax the strict geometric-locality constraints traditionally imposed on quantum error-correcting codes, motivating interest in high-rate quantum low-density parity-check (qLDPC) codes. At the same time, color codes provide a particularly rich setting for fault-tolerant quantum computation, underlying protocols such as single-shot error correction and self-correcting quantum computation. Hyperbolic color codes provide a class of high-rate qLDPC codes that also retain the structural features of color codes relevant to fault-tolerant quantum computation. However, previous constructions of hyperbolic color codes have achieved at most logarithmic code distance. In this work, we construct hyperbolic color codes with both constant rate and polynomial distance by building on arithmetic hyperbolic manifolds that support polynomial-distance hyperbolic toric codes. Our construction applies in arbitrary dimension
D≥4. In even dimensions, the resulting type-
D/2 color codes have constant encoding rate and polynomial distance, while in other cases the number of logical qubits and the code distance both exhibit polynomial scaling. We further derive explicit exponents for polynomial lower bounds as functions of the dimension and code type. These results establish a family of hyperbolic color codes simultaneously achieving constant rate and polynomial distance and providing a testbed to explore fault-tolerant quantum computation protocols that combine high-rate quantum codes with the structural advantages of color codes.
Classical low-density parity-check (LDPC) codes were first introduced by Robert Gallager in the 1960's and have reemerged as one of the most influential coding schemes.We present new families of quantum low-density parity-check error-correcting codes derived from regular tessellations of Platonic 2-manifolds and from embeddings of the Lubotzky-Phillips-Sarnak Ramanujan graphs.These families of quantum error-correcting codes answer a conjecture proposed by MacKay about the existence of good families of quantum low-density parity-check codes with nonzero rate, increasing minimum distance and a practical decoder.For both families of codes, we present a logarithmic lower bound on the shortest noncontractible cycle of the tessellations and therefore on their distance.Note that a logarithmic lower bound is the best known in the theory of regular tessellations of 2-manifolds.We show their asymptotic sparsity and non-zero rate.In addition, we show their decoding performance with simulations using belief propagation.Furthermore, we present a general geometrical model to design non-additive quantum error-correcting codes for the amplitude-damping channel.Non-additive quantum error-correcting codes are more general than stabilizer or additive quantum errorcorrecting codes, and in some cases non-additive quantum codes are more optimal.As an example, we provide an 8-qubit amplitude-damping code, which can encode 1 qubit and correct for 2 errors.This violates the quantum Hamming bound which requires that its length start at 9.
We construct toric codes on various high-dimensional manifolds. Assuming a conjecture in geometry we find families of quantum CSS stabilizer codes on
N qubits with logarithmic weight stabilizers and distance
N1−ε for any
ε>0. The conjecture is that there is a constant
C>0 such that for any
n-dimensional torus
Tn=Rn/Λ, where
Λ is a lattice, the least volume unoriented
n/2-dimensional surface (using the Euclidean metric) representing nontrivial homology has volume at least
Cn times the volume of the least volume
n/2-dimensional hyperplane representing nontrivial homology; in fact, it would suffice to have this result for
Λ an integral lattice with the surface restricted to faces of a cubulation by unit hypercubes. The main technical result is an estimate of Rankin invariants\cite{rankin} for certain random lattices, showing that in a certain sense they are optimal. Additionally, we construct codes with square-root distance, logarithmic weight stabilizers, and inverse polylogarithmic soundness factor (considered as quantum locally testable codes\cite{qltc}). We also provide an short, alternative proof that the shortest vector in the exterior power of a lattice may be non-split\cite{coulangeon}.
In this paper, we introduce a new family of stabilizer quantum LDPC codes derived from the classical linear codes
Lk and
Lk+, defined via sub-exceding functions. In previous work, these codes demonstrated strong performance in minimum distance, decoding efficiency, and structural simplicity. By combining the hypergraph product framework with a generalized Shor construction, we obtain a scalable class of quantum codes with parameters
[[6k2,k2,d]]. The resulting quantum codes exhibit a rich combinatorial structure and promising properties, particularly in terms of locality, low-density parity-check (LDPC) structure, and asymptotic behavior. The minimum distance satisfies
d=3 for
k=3 and
d=4 for
k≥4, establishing a new framework for structured quantum LDPC code design and optimization.