Localized statistics decoding for quantum low-density parity-check codes
Journal article, 2025

Quantum low-density parity-check codes are a promising candidate for fault-tolerant quantum computing with considerably reduced overhead compared to the surface code. However, the lack of a practical decoding algorithm remains a barrier to their implementation. In this work, we introduce localized statistics decoding, a reliability-guided inversion decoder that is highly parallelizable and applicable to arbitrary quantum low-density parity-check codes. Our approach employs a parallel matrix factorization strategy, which we call on-the-fly elimination, to identify, validate, and solve local decoding regions on the decoding graph. Through numerical simulations, we show that localized statistics decoding matches the performance of state-of-the-art decoders while reducing the runtime complexity for operation in the sub-threshold regime. Importantly, our decoder is more amenable to implementation on specialized hardware, positioning it as a promising candidate for decoding real-time syndromes from experiments.

Author

Timo Hillmann

Chalmers, Microtechnology and Nanoscience (MC2), Applied Quantum Physics

Lucas Berent

Technical University of Munich

Armanda O. Quintavalle

Freie Universität Berlin

Jens Eisert

Helmholtz Association of German Research Centres

Freie Universität Berlin

Robert Wille

Technical University of Munich

Software Competence Center Hagenberg

Joschka Roffe

University of Edinburgh

Freie Universität Berlin

Nature Communications

2041-1723 (ISSN) 20411723 (eISSN)

Vol. 16 1 8214

Subject Categories (SSIF 2025)

Computer Engineering

Condensed Matter Physics

Telecommunications

DOI

10.1038/s41467-025-63214-7

PubMed

40897712

Related datasets

Simulation results for "Localized statistics decoding: A parallel decoding algorithm for quantum low-density parity-check codes" [dataset]

DOI: https://zenodo.org/records/12548001

More information

Latest update

9/16/2025