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

Journal of Physics Conference Series

Quantum mean-field decoding algorithm for error-correcting codes

Jun‐ichi Inoue, Yôhei Saika, Masato Okada

Published Jan 7, 2009• 4 citations
Publisher

Abstract

We numerically examine a quantum version of TAP (Thouless-Anderson-Palmer)-like mean-field algorithm for the problem of error-correcting codes. For a class of the so-called Sourlas error-correcting codes, we check the usefulness to retrieve the original bit-sequence (message) with a finite length. The decoding dynamics is derived explicitly and we evaluate the average-case performance through the bit-error rate (BER).

DOI
10.1088/1742-6596/143/1/012019

Related papers

Typical Performance of Gallager-Type Error-Correcting Codes

Yoshiyuki Kabashima, Tatsuto Murayama, David Saad

The performance of Gallager's error-correcting code is investigated via methods of statistical physics. In this approach, the transmitted codeword comprises products of the original message bits selected by two randomly constructed sparse matrices; the number of nonzero row/column elements in these matrices constitutes a family of codes. We show that Shannon's channel capacity is saturated for many of the codes while slightly lower performance is obtained for others which may be of higher practical relevance. Decoding aspects are considered by employing the Thouless-Anderson-Palmer approach which is identical to the commonly used belief-propagation-based decoding.

arXiv:cond-mat/9908104•Physical Review Letters•Feb 7, 2000•109 citations

Effect of quantum fluctuation in error-correcting codes

Yosuke Otsubo, Jun‐ichi Inoue, Kenji Nagata +1 more

We discuss the decoding performance of error-correcting codes based on a model in which quantum fluctuations are introduced by means of a transverse field. The essential issue in this paper is whether quantum fluctuations improve the decoding quality compared with the conventional estimation based on thermal fluctuations, which is called finite-temperature decoding. We found that an estimation incorporating quantum fluctuations approaches the optimal performance of finite-temperature decoding. The results are illustrated by numerically solving saddle-point equations and performing a Monte Carlo simulation. We also evaluated the upper bound of the overlap between the original sequence and the decoded sequence derived from the equations of state for the order parameters, which is a measure of the decoding performance.

Physical Review E•Nov 30, 2012•13 citations

TAP for Parity Check Error Correcting Codes

David Saad, Yoshiyuki Kabashima, Renato Vicente

We employ the methods presented in the previous chapter for decoding corrupted codewords, encoded using sparse parity check error correcting codes. We show the similarity between the equations derived from the TAP approach and those obtained from belief propagation, and examine their performance as practical decoding methods.

The MIT Press eBooks•Jun 8, 2001•1 citation

Iterative decoding algorithms of LDPC codes using TAP approach

Manel Abdelhedi, Omessaad Hamdi, Ammar Bouallègue

Low-density parity-check (LDPC) codes are based on random construction. Because of this randomness, it is not easy to analyze them with the traditional methods of communication theory. N.Sourlas [6] was the first to point out that LDPC codes have a similarity to Ising spin systems in statistical physics. Besides, it has been shown that the Belief-Propagation algorithm, the decoding algorithm of LDPC codes, is equivalent to the Thouless-Anderson-Palmer(TAP) [9] approach. In this paper, we develop the log-likelihood ratios-Belief Propagation (LLR-BP) and the BP-Based decoding algorithms with the TAP approach.

Global Information Infrastructure and Networking Symposium•Jun 1, 2009•1 citation

Decoding algorithms for quantum error correcting codes

Antonio de Mari i Olius

Quantum computers would prove a ground-breaking effect in several re- search fields to the advantage of our society due to their proved capacity for solving some problems deemed as too complex for classical comput- ers. Consequently, there is a generalized academic effort for constructing a quantum computer. Nonetheless, a real quantum computer does not suffice for implementing quantum algorithms reliably, it must be fault-tolerant. Quantum computers undergo noise due to a phenomenon generally named quantum decoherence, a fault-tolerant quantum computer has the capabil- ity to suppress the effects of decoherence to an extent. For that to happen, a quantum computer should consider quantum error correction, a process in which decoherence is studied and attempted to be corrected. Within the context of quantum error correction, the information from quantum proces- sors is to be stored in a larger, more redundant system named a quantum error correcting code. Afterwards, one can obtain a vector named syndrome which provides partial information on the effect decoherence has had on a code. The process of recovering the decoherence or error that the code has undergone is named decoding. This thesis studies decoders for quan- tum error correcting codes, their performance, complexity and adaption to different types of quantum decoherence.

•Jul 1, 2024•0 citations

Reduced-Comlexity Decoding of LDPC Codes Using TAP Approach

Manel Abdelhedi, Omessaad Hamdi, Ammar Bouallègue

Low-density parity-check (LDPC) codes are based on random construction. Because of this randomness, it is not easy to analyze them with the traditional methods of information theory. N. Sourlas was the first to point out that LDPC codes have a similarity with Ising spin systems of statistical physics. Besides, it has been shown that the Belief-Propagation algorithm, the LDPC codes decoding algorithm, is equivalent to the Thouless-Anderson-Palmer(TAP) approach. In this paper, we develop the log likelihood ratios-Belief Propagation (LLR-BP) algorithm and its simplifications the BP-Based algorithm and the λ-min algorithm with the TAP approach.

International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)•Nov 1, 2009•0 citations
We numerically examine a quantum version of TAP (Thouless-Anderson-Palmer)-like mean-field algorithm for the problem of error-correcting codes. For a class of the so-called Sourlas error-correcting codes, we check the usefulness to retrieve the original bit-sequence (message) with a finite length. The decoding dynamics is derived explicitly and we evaluate the average-case performance through the bit-error rate (BER).
The performance of Gallager's error-correcting code is investigated via methods of statistical physics. In this approach, the transmitted codeword comprises products of the original message bits selected by two randomly constructed sparse matrices; the number of nonzero row/column elements in these matrices constitutes a family of codes. We show that Shannon's channel capacity is saturated for many of the codes while slightly lower performance is obtained for others which may be of higher practical relevance. Decoding aspects are considered by employing the Thouless-Anderson-Palmer approach which is identical to the commonly used belief-propagation-based decoding.
We discuss the decoding performance of error-correcting codes based on a model in which quantum fluctuations are introduced by means of a transverse field. The essential issue in this paper is whether quantum fluctuations improve the decoding quality compared with the conventional estimation based on thermal fluctuations, which is called finite-temperature decoding. We found that an estimation incorporating quantum fluctuations approaches the optimal performance of finite-temperature decoding. The results are illustrated by numerically solving saddle-point equations and performing a Monte Carlo simulation. We also evaluated the upper bound of the overlap between the original sequence and the decoded sequence derived from the equations of state for the order parameters, which is a measure of the decoding performance.
Low-density parity-check (LDPC) codes are based on random construction. Because of this randomness, it is not easy to analyze them with the traditional methods of communication theory. N.Sourlas [6] was the first to point out that LDPC codes have a similarity to Ising spin systems in statistical physics. Besides, it has been shown that the Belief-Propagation algorithm, the decoding algorithm of LDPC codes, is equivalent to the Thouless-Anderson-Palmer(TAP) [9] approach. In this paper, we develop the log-likelihood ratios-Belief Propagation (LLR-BP) and the BP-Based decoding algorithms with the TAP approach.
Quantum computers would prove a ground-breaking effect in several re- search fields to the advantage of our society due to their proved capacity for solving some problems deemed as too complex for classical comput- ers. Consequently, there is a generalized academic effort for constructing a quantum computer. Nonetheless, a real quantum computer does not suffice for implementing quantum algorithms reliably, it must be fault-tolerant. Quantum computers undergo noise due to a phenomenon generally named quantum decoherence, a fault-tolerant quantum computer has the capabil- ity to suppress the effects of decoherence to an extent. For that to happen, a quantum computer should consider quantum error correction, a process in which decoherence is studied and attempted to be corrected. Within the context of quantum error correction, the information from quantum proces- sors is to be stored in a larger, more redundant system named a quantum error correcting code. Afterwards, one can obtain a vector named syndrome which provides partial information on the effect decoherence has had on a code. The process of recovering the decoherence or error that the code has undergone is named decoding. This thesis studies decoders for quan- tum error correcting codes, their performance, complexity and adaption to different types of quantum decoherence.
Low-density parity-check (LDPC) codes are based on random construction. Because of this randomness, it is not easy to analyze them with the traditional methods of information theory. N. Sourlas was the first to point out that LDPC codes have a similarity with Ising spin systems of statistical physics. Besides, it has been shown that the Belief-Propagation algorithm, the LDPC codes decoding algorithm, is equivalent to the Thouless-Anderson-Palmer(TAP) approach. In this paper, we develop the log likelihood ratios-Belief Propagation (LLR-BP) algorithm and its simplifications the BP-Based algorithm and the λ-min algorithm with the TAP approach.