Toward a Union-Find decoder for quantum LDPC codes

03/14/2021
by   Nicolas Delfosse, et al.
0

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.

READ FULL TEXT
research
06/15/2022

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...
research
08/01/2022

Fast erasure decoder for a class of quantum LDPC codes

We propose a decoder for the correction of erasures with hypergraph prod...
research
09/21/2023

Analysis of the Error-Correcting Radius of a Renormalisation Decoder for Kitaev's Toric Code

Kitaev's toric code is arguably the most studied quantum code and is exp...
research
10/21/2020

Pseudocodeword-based Decoding of Quantum Color Codes

In previous work, we have shown that pseudocodewords can be used to char...
research
04/23/2020

Combining hard and soft decoders for hypergraph product codes

Hypergraph product codes are a class of constant-rate quantum low-densit...
research
06/14/2022

An efficient decoder for a linear distance quantum LDPC code

Recent developments have shown the existence of quantum low-density pari...
research
07/03/2020

New Classes of Quantum Codes Associated with Surface Maps

If the cyclic sequences of face types at all vertices in a map are the s...

Please sign up or login with your details

Forgot password? Click here to reset