Fast erasure decoder for hypergraph product codes-Reference-Cited by-同舟云学术

Fast erasure decoder for hypergraph product codes

Published:2024-08-27 Issue: Volume:8 Page:1450
ISSN:2521-327X
Container-title:Quantum
language:en
Short-container-title:Quantum

Author:

Connolly Nicholas¹²,Londe Vivien³,Leverrier Anthony¹,Delfosse Nicolas⁴

Affiliation:

1. Inria, Paris, France

2. Okinawa Institute of Science and Technology Graduate University, Okinawa, Japan

3. Microsoft, Paris, France

4. Microsoft Quantum, Redmond, Washington 98052, USA

Abstract

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(N2) bit operations where N is the length of the quantum code. A probabilistic version of this decoder can be implemented in O(N1.5) bit operations.

Funder

Plan France 2030

Publisher

Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften

Link

https://quantum-journal.org/papers/q-2024-08-27-1450/pdf/

Reference42 articles.

1. Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill. ``Topological quantum memory''. Journal of Mathematical Physics 43, 4452–4505 (2002).

2. Austin G Fowler, Matteo Mariantoni, John M Martinis, and Andrew N Cleland. ``Surface codes: Towards practical large-scale quantum computation''. Physical Review A 86, 032324 (2012).

3. Robert Gallager. ``Low-density parity-check codes''. IRE Transactions on Information Theory 8, 21–28 (1962).

4. David JC MacKay, Graeme Mitchison, and Paul L McFadden. ``Sparse-graph codes for quantum error correction''. IEEE Transactions on Information Theory 50, 2315–2330 (2004).

5. Jean-Pierre Tillich and Gilles Zémor. ``Quantum ldpc codes with positive rate and minimum distance proportional to the square root of the blocklength''. IEEE Transactions on Information Theory 60, 1193–1202 (2013).