Decoding in Hyperbolic Spaces: LDPC Codes With Linear Rate and Efficient Error Correction

Abstract

We analyze the four dimensional toric code in a hyperbolic space and show that it has a classical error correction procedure which runs in almost linear time and can be parallelized to almost constant time, giving an example of a quantum LDPC code with linear rate and efficient error correction.

9 pages, no figures

Cited by in corpus (2)

• Fault-Tolerant Quantum Computation with Constant Overhead
• Efficient decoding of random errors for quantum expander codes