Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

Accelerating Q-ary Sliding-Window Belief Propagation Algorithm with GPU

Bowei Shan, Sihua Chen, Yong Fang

Published Jan 1, 2020• 1 citation
Publisher
DOI
10.1007/978-3-030-44751-9_1

Related papers

GPU Accelerated Parallel Algorithm of Sliding-Window Belief Propagation for LDPC Codes

Bowei Shan, Yong Fang

International Journal of Parallel Programming•Apr 4, 2019•9 citations

Unequally Weighted Sliding-Window Belief Propagation for Binary LDPC Codes

Zhaotun Feng, Bowei Shan, Yong Fang

Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering•Jan 1, 2020•0 citations

GPU Accelerated Belief Propagation Decoding of Non-Binary LDPC Codes with Parallel and Sequential Scheduling

Moritz Beermann, Enrique Monzó, Laurent Schmalen +1 more

Journal of Signal Processing Systems•Aug 21, 2014•10 citations

Parallel versus sequential updating for belief propagation decoding

Haggai Kfir, Ido Kanter

arXiv:cond-mat/0207185•Physica A Statistical Mechanics and its Applications•Sep 22, 2003•96 citations

Non-Markov quantum belief propagation

Jack Ceroni, Ian MacCormack, Guillaume Verdon

We provide a rigorous proof of the approximate convergence of sliding-window quantum belief-propagation as outlined heuristically in the work of Bilgin and Poulin [Phys. Rev. B 81, 054106 (2010)], in the absence of the quantum Markov property. In particular, we confirm the hypothesis outlined in this work that the approximation error of each step in the belief-propagation algorithm decreases exponentially with the sliding-window size, under the assumption that the underlying state on which belief-propagation is being performed possesses a so-called thermal boundedness property: a relaxation of the Markov property required for exact convergence.

arXiv:2406.06360•Physical Review A•Jul 12, 2024•0 citations

Enhance Belief Propagation Decoding using Ensemble Learning Approaches

Md Aleem, Sharjeel Ahmad, Syed Ahmad

International Journal of Networking and Virtual Organisations•Jan 1, 2025•0 citations
We provide a rigorous proof of the approximate convergence of sliding-window quantum belief-propagation as outlined heuristically in the work of Bilgin and Poulin [Phys. Rev. B 81, 054106 (2010)], in the absence of the quantum Markov property. In particular, we confirm the hypothesis outlined in this work that the approximation error of each step in the belief-propagation algorithm decreases exponentially with the sliding-window size, under the assumption that the underlying state on which belief-propagation is being performed possesses a so-called thermal boundedness property: a relaxation of the Markov property required for exact convergence.