Belief Propagation with Quantum Messages (BPQM)

• The paper introduces BPQM as a novel quantum generalization of belief propagation that replaces classical messages with quantum states, achieving measurement-optimal decoding on tree and CQ channels.
• It demonstrates efficient quantum circuit implementations using bit-node and check-node unitaries that employ Fourier transforms and eigenvalue recursions for message combining.
• The analysis establishes fidelity bounds and density evolution techniques for designing LDPC and polar codes, extending BPQM to symmetric q-ary pure-state and depolarized CQ channels.

Belief Propagation with Quantum Messages (BPQM) generalizes classical belief propagation by replacing classical messages with quantum states and local classical updates with quantum channel-combining unitaries. This framework enables quantum message-passing decoding for codes used on classical–quantum (CQ) channels, exploiting the structure of code graphs such as trees or polar SC networks to achieve measurement-optimal or near-optimal decoding, often at lower circuit complexity than universal collective measurements. Recent advances extend BPQM to symmetric $q$-ary pure-state channels, general CQ channels via paired measurement BPQM (PMBPQM), and support density evolution and threshold analysis for LDPC and polar codes.

1. Foundations: Classical BP and Quantum BPQM Generalization

Classical belief propagation (BP) passes scalar likelihoods or log-likelihood ratios over factor graphs representing code constraints, employing "sum–product" updates at variable and check nodes to estimate marginal probabilities for decoding. BP achieves exact MAP decoding for tree-structured graphs and is heuristically powerful for loopy graphs (e.g., LDPC, turbo codes).

BPQM replaces classical scalar or vector-valued messages with quantum systems—typically qubits (for binary channels) or $q$-dimensional states (for $q$-ary channels). Messages encode quantum "beliefs" about variable values via state overlap (in pure-state models) or density matrices. Local message-combining rules become quantum convolutions, implemented by small quantum circuits (unitary gates and controlled measurements) that output new message states (Renes, 2016).

All variants preserve the graphical/dataflow structure of standard BP: messages are passed along edges of the factor graph, update rules are local at each node, and roots receive quantum messages suitable for optimal or near-optimal measurement-based inference.

2. BPQM for Binary and Q-ary Pure-State Channels

For symmetric $q$-ary pure-state channels (PSC), the input alphabet $X=[q]$ maps $u\in[q]$ to pure quantum states $|\psi_u\rangle$. The channel is characterized by the circulant Gram matrix $G_{i,j}=\langle\psi_i|\psi_j\rangle$, with symmetry $G_{i,j}=g_{(j-i)\bmod q}$. Diagonalization yields the eigen-list $\Lambda=[\lambda_0,\dots,\lambda_{q-1}]$ via discrete Fourier basis $v_m$, with $\lambda_m=\sum_{k=0}^{q-1} g_k\omega^{km}$ ($\omega=e^{2\pi i/q}$).

BPQM node update rules are expressed in terms of closed-form recursions on Gram-matrix eigenvalues:

• Bit-node combining ("$\oplus$"): If $W_1,W_2$ have eigen-lists $\Lambda^{(1)},\Lambda^{(2)}$, the bit-node combined channel $W=W_1\oplus W_2$ has

$$\lambda_j = \frac{1}{q}\sum_{k=0}^{q-1} \lambda^{(1)}_{k}\lambda^{(2)}_{j-k},\quad\mu_j = \sum_k \mu^{(1)}_k \mu^{(2)}_{j-k}$$

• Check-node combining ("$\ominus$"): The check-combined channel $W_1\ominus W_2$ yields $q$ PSCs indexed by syndrome $m$ (with probability $p_m$), each having

$$\lambda^{(m)}_j = \frac{\lambda^{(1)}_{m+j}\lambda^{(2)}_{-j}}{q\,p_m},\quad p_m = \frac{1}{q^2}\sum_{j=0}^{q-1}\lambda^{(1)}_{m+j}\lambda^{(2)}_{-j}$$

These recursions generalize classical Bhattacharyya- or LLR-based updates and are independent of the physical realization of the output quantum states (Mandal et al., 29 Jan 2026).

3. Quantum Circuit Realization and Message-Passing Operations

BPQM decoding is implemented by explicit small-depth quantum circuits:

• Bit-node unitary ($U_{bit}$): In the Fourier basis, $U_{+}$ “adds” Fourier indices, and a controlled unitary resets the second register, leaving the first in the compressed quantum message state. Explicitly,

$$U_{+}: |v_j\rangle\otimes|v_{j'}\rangle \mapsto |v_{j+j'}\rangle\otimes|v_{j'}\rangle$$

followed by $(\sum_k|v_k\rangle\langle v_k|\otimes U_k)U_{+}$.

• Check-node unitary ($U_{check}$): The transformation

$$\tilde{U}: |v_j\rangle\otimes|v_{j'}\rangle \mapsto |v_{j+j'}\rangle\otimes|v_{-j'}\rangle$$

is used, then the registers are swapped and the second register is inverse-DFTed and measured, outputting syndrome $m$.

For binary pure-state channels, these unitaries can be constructed explicitly with $O(1)$ circuit depth per node, independent of $q$ (Mandal et al., 29 Jan 2026).

4. Performance Guarantees: Optimality and Fidelity Bounds

BPQM achieves the following key performance features:

• Helstrom/PGM-optimality on trees: On tree factor graphs, the BPQM procedure at the root implements the exact Helstrom measurement with minimum error probability for distinguishing codeword states or marginal bits (Renes, 2016, Piveteau et al., 2021, Piveteau et al., 23 Sep 2025).
• Fidelity bounds for $q$-ary PSCs:
  • Bit-node: $F(W_1\oplus W_2)\le(q-1)F(W_1)F(W_2)$
  • Check-node: $$F(W_1\ominus W_2)\le F(W_1)+F(W_2)+(q-1)F(W_1)F(W_2)$$
  • These bounds mirror classical polarization/threshold inequalities and ensure improved error rates through recursion (Mandal et al., 29 Jan 2026).
• Extension to general CQ channels via PMBPQM: “Paired measurement” BPQM (PMBPQM) alternates quantum unitary combine steps with local measurements, mapping the system back to a mixture of single-qubit channels. While PMBPQM is suboptimal in general, for binary PSCs it achieves the Helstrom bound exactly, and for symmetric CQ channels with depolarization its gap to optimality is less than 1% in tested cases (Brandsen et al., 2022).

5. Density Evolution and Code Design (LDPC, Polar Codes)

BPQM supports direct quantum analogs of classical density evolution (DE) for code design and threshold analysis:

• Polar codes: Initialize $N=2^n$ base channels, recursively apply “CheckCombine” and “BitCombine” via BPQM recursions. Monte Carlo “bags” of eigen-lists (or parameter pairs $(\delta,\gamma)$ for binary CQ) are evolved through the code transform. At the end, synthetic channels are ranked, and information/frozen bits are selected to meet block-error constraints (Mandal et al., 29 Jan 2026, Mandal et al., 2024).
• LDPC code thresholds: For $(d_v,d_c)$-regular ensembles, iterations alternate $d_c-1$ check combines and $d_v-1$ bit combines, tracking the evolution of a “typical” message channel via recursive eigen-list updates (Mandal et al., 29 Jan 2026).
• Threshold quantification: Asymptotic DE on pure-state channels yields BPQM thresholds matching the Holevo capacity, whereas classical thresholds are bounded by the Shannon capacity (Piveteau et al., 23 Sep 2025).

6. Generalizations: Nonbinary Alphabets and Quantum Graphical Models

BPQM generalizes to symmetric $q$-ary PSCs via circulant Gram matrix eigendecomposition and eigen-list tracking. The approach accommodates any physical realization of the channel states, provided the Gram matrix structure is preserved. BPQM’s operator-message machinery further integrates into quantum graphical models, quantum Markov networks, and quantum Bayesian networks, with convergence guarantees on tree and certain network structures (0708.1337, Tucci, 2020).

Some limitations are noted: message sizes grow with dimension; check-node operations are more complex for high-degree nodes; extensions to mixed-state channels or loopy graphs require approximate cloning or local measurement heuristics, which retain near-optimality empirically (Piveteau et al., 2021).

7. Practical Applications and Computational Complexity

BPQM has direct utility in quantum-enhanced communications, especially for low-photon optical channels (e.g., BPSK modulated pure-loss) where quantum joint-detection BPQM receivers exceed the performance and photon-information efficiency (PIE) of any separable detection scheme (Rengaswamy et al., 2020). BPQM enables:

• Efficient joint-decoding for tree codes, turbo codes (via message-passing across concatenated factor graphs) (Piveteau et al., 23 Sep 2025)
• Practical code design for CQ channels, surpassing classical BP in noise resilience for sufficiently quantum-coherent channels (Mandal et al., 2024)
• Polynomial or polylogarithmic circuit complexity for local variants; with paired-measurement modifications, quantum implementation remains $O(N\log N)$ for polar codes and $O(n)$ for trees, while classical simulation is exponential in code length due to quantum superposition branching (Mandal et al., 2024, Mandal et al., 29 Jan 2026)

BPQM completes the link between collective quantum measurement and scalable code-constrained quantum decoding, allowing explicit, efficient circuit construction and DE-based code optimization for symmetric $q$-ary pure-state and binary CQ channels (Mandal et al., 29 Jan 2026, Renes, 2016, Brandsen et al., 2022).