Quantum Approximate Optimization for Decoding of Low-Density Parity-Check Codes

• URL: http://arxiv.org/abs/2602.21124v1
• Date: Tue, 24 Feb 2026 17:22:09 GMT
• Title: Quantum Approximate Optimization for Decoding of Low-Density Parity-Check Codes
• Authors: Krishnakanta Barik, Goutam Paul,
• Abstract summary: Decoding Low-Density Parity-Check (LDPC) codes is a fundamental problem in coding theory.<n>BP is one of the most popular methods for LDPC code decoding.<n>We present a QAOA-based decoding framework for LDPC codes by formulating a decoding cost function.
• Score: 3.530759252061682
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Decoding Low-Density Parity-Check (LDPC) codes is a fundamental problem in coding theory, and Belief Propagation (BP) is one of the most popular methods for LDPC code decoding. However, BP may encounter convergence issues and suboptimal performance, especially for short-length codes and in high-noise channels. The Quantum Approximate Optimization Algorithm (QAOA) is a type of Variational Quantum Algorithm (VQA) designed to solve combinatorial optimization problems by minimizing a problem-specific cost function. In this paper, we present a QAOA-based decoding framework for LDPC codes by formulating a decoding cost function that incorporates both parity-check constraints and soft channel reliability information. The resulting optimization problem is solved using QAOA to search for low-energy configurations corresponding to valid codewords. We test the proposed method through extensive numerical experiments and compare its performance with BP decoding. The experimental results demonstrate that the QAOA-based decoder achieves a higher probability of correctly recovering the transmitted codeword than BP across multiple experimental settings.

Related papers

• Bayesian Optimization for Quantum Error-Correcting Code Discovery [3.0556222192221667]
  We propose a framework to discover quantum error-correcting codes that improves data efficiency and scalability.<n>Our main contribution is a multi-view chain-complex neural embedding that allows us to predict the logical error rate of quantum LDPC codes without performing expensive simulations.
  arXiv  Detail & Related papers  (2026-01-26T15:10:01Z)
• Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes [0.30912596009895504]
  Decoding quantum error-correcting codes is a key challenge in enabling fault-tolerant quantum computation.<n>In this work, we uncover a key limitation of linear programming (LP) decoding for quantum low-density parity-check codes.<n>We incorporate a post-processing technique known as ordered statistics decoding (OSD) which significantly enhances LP decoding performance in practice.
  arXiv  Detail & Related papers  (2025-08-06T18:00:01Z)
• Threshold Selection for Iterative Decoding of $(v,w)$-regular Binary Codes [84.0257274213152]
  Iterative bit flipping decoders are an efficient choice for sparse $(v,w)$-regular codes.<n>We propose concrete criteria for threshold determination, backed by a closed form model.
  arXiv  Detail & Related papers  (2025-01-23T17:38:22Z)
• Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning [4.642647756403864]
  Hypergraph products are quantum low-density parity-check (LDPC) codes constructed from two classical LDPC codes.<n>In this work, we focus on optimizing performance against the quantum erasure channel.<n>A key advantage of this channel is the existence of an efficient maximum-likelihood decoder.
  arXiv  Detail & Related papers  (2025-01-16T16:01:02Z)
• Quantum-enhanced belief propagation for LDPC decoding [0.0]
  We introduce the quantum-enhanced belief propagation algorithm, which acts as a pre-processing step to belief propagation.<n>We study the possibility of having shared variational parameters between syndromes and, in this case, code lengths.
  arXiv  Detail & Related papers  (2024-12-11T18:14:18Z)
• Decoding Quantum LDPC Codes Using Graph Neural Networks [52.19575718707659]
  We propose a novel decoding method for Quantum Low-Density Parity-Check (QLDPC) codes based on Graph Neural Networks (GNNs) The proposed GNN-based QLDPC decoder exploits the sparse graph structure of QLDPC codes and can be implemented as a message-passing decoding algorithm.
  arXiv  Detail & Related papers  (2024-08-09T16:47:49Z)
• Limitations of the decoding-to-LPN reduction via code smoothing [59.90381090395222]
  Researchers have attempted to demonstrate the algorithmic hardness of the Learning Parity with Noise problem.<n>We characterize the efficiency of the reduction in terms of the parameters of the decoding and primitive problems.
  arXiv  Detail & Related papers  (2024-08-07T12:54:43Z)
• Factor Graph Optimization of Error-Correcting Codes for Belief Propagation Decoding [62.25533750469467]
  Low-Density Parity-Check (LDPC) codes possess several advantages over other families of codes. The proposed approach is shown to outperform the decoding performance of existing popular codes by orders of magnitude.
  arXiv  Detail & Related papers  (2024-06-09T12:08:56Z)
• Near-optimal decoding algorithm for color codes using Population Annealing [44.99833362998488]
  We implement a decoder that finds the recovery operation with the highest success probability. We study the decoder performance on a 4.8.8 color code lattice under different noise models.
  arXiv  Detail & Related papers  (2024-05-06T18:17:42Z)
• Belief Propagation Decoding of Quantum LDPC Codes with Guided Decimation [55.8930142490617]
  We propose a decoder for QLDPC codes based on BP guided decimation (BPGD) BPGD significantly reduces the BP failure rate due to non-convergence.
  arXiv  Detail & Related papers  (2023-12-18T05:58:07Z)
• Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices [60.02503434201552]
  We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix. This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
  arXiv  Detail & Related papers  (2022-12-20T13:41:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.