https://doi.org/10.1140/epjs/s11734-025-01712-x
Regular Article
A low-complexity BP-OSD algorithm for quantum LDPC codes
1
School of Computer Science and Engineering, Sun Yat-sen University, 510006, Guangzhou, China
2
Department of Computer Science, City University of Hong Kong, 999077, Hong Kong SAR, China
Received:
31
December
2024
Accepted:
26
May
2025
Published online:
9
June
2025
This paper introduces a low-complexity belief propagation (BP) algorithm combined with ordered statistics decoding (OSD), referred to as the BP-OSD algorithm, for quantum low-density parity-check (LDPC) codes. In the pre-processing stage, we optimize the parameters of BP to reduce the average number of iterations. In the post-processing stage, we introduce a locally constrained OSD (LCOSD) scheme instead of the conventional OSD scheme. Additionally, we propose two early termination strategies to reduce the average number of searches in the post-processing stage. Numerical results demonstrate that: a) the proposed BP-OSD algorithm achieves performance comparable to (or slightly better than) that of the conventional BP-OSD algorithm; b) the parameter optimization in the pre-processing stage effectively reduces the average number of iterations; c) the proposed early termination strategies significantly reduce the average number of searches in the post-processing stage, often reducing the count to below ten and sometimes even to a single search.
Copyright comment Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
© The Author(s), under exclusive licence to EDP Sciences, Springer-Verlag GmbH Germany, part of Springer Nature 2025
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
