Abstract
Quantum low-density parity-check (LDPC) codes are an important class of quantum error correcting codes. In this talk I am going to present a new algorithm for decoding the hypergraph product codes, a family of quantum LDPC codes. Our decoding algorithm is based on Viderman's algorithm for classical LDPC codes, which converts errors to erasures. That is, our algorithm returns a set of suspected qubits that are promised to contain the original error. This is different from previous decoding algorithms, that are based on flipping qubits. In the talk I will describe the classical Viderman's algorithm, explain the challenges in applying it in the quantum setting, and then describe our decoding algorithm for quantum LDCP codes.