Fast erasure decoder for a class of quantum LDPC codes

08/01/2022
by   Nicholas Connolly, et al.
0

We propose a decoder for the correction of erasures with hypergraph product codes, which form one of the most popular families of quantum LDPC codes. Our numerical simulations show that this decoder provides a close approximation of the maximum likelihood decoder that can be implemented in O(N^2) bit operations where N is the length of the quantum code. A probabilistic version of this decoder can be implemented in O(N^1.5) bit operations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/14/2021

Toward a Union-Find decoder for quantum LDPC codes

Quantum LDPC codes are a promising direction for low overhead quantum co...
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
08/10/2022

A parallel decoder for good quantum LDPC codes

We introduce a parallel decoding algorithm for recently discovered famil...
research
04/04/2019

Degenerate Quantum LDPC Codes With Good Finite Length Performance

We study the performance of small and medium length quantum LDPC (QLDPC)...
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
11/25/2020

Sparse Multi-Decoder Recursive Projection Aggregation for Reed-Muller Codes

Reed-Muller (RM) codes are one of the oldest families of codes. Recently...
research
05/17/2022

Learning to Learn Quantum Turbo Detection

This paper investigates a turbo receiver employing a variational quantum...

Please sign up or login with your details

Forgot password? Click here to reset