Toward a Union-Find decoder for quantum LDPC codes

by   Nicolas Delfosse, et al.

Quantum LDPC codes are a promising direction for low overhead quantum computing. In this paper, we propose a generalization of the Union-Find decoder as adecoder for quantum LDPC codes. We prove that this decoder corrects all errors with weight up to An^α for some A, α > 0 for different classes of quantum LDPC codes such as toric codes and hyperbolic codes in any dimension D ≥3 and quantum expander codes. To prove this result, we introduce a notion of covering radius which measures the spread of an error from its syndrome. We believe this notion could find application beyond the decoding problem. We also perform numerical simulations, which show that our Union-Find decoder outperforms the belief propagation decoder in the low error rate regime in the case of a quantum LDPC code with length 3600.


Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes

We introduce and analyse an efficient decoder for the quantum Tanner cod...

Fast erasure decoder for a class of quantum LDPC codes

We propose a decoder for the correction of erasures with hypergraph prod...

Pseudocodeword-based Decoding of Quantum Color Codes

In previous work, we have shown that pseudocodewords can be used to char...

An efficient decoder for a linear distance quantum LDPC code

Recent developments have shown the existence of quantum low-density pari...

Hierarchical decoding to reduce hardware requirements for quantum computing

Extensive quantum error correction is necessary in order to scale quantu...

Quantum Bicyclic Hyperbolic Codes

Bicyclic codes are a generalization of the one dimensional (1D) cyclic c...

Quantifying nonlocality: how outperforming local quantum codes is expensive

Quantum low-density parity-check (LDPC) codes are a promising avenue to ...