A Factor-Graph Formulation of CSS Syndrome Decoding: Joint BP and Four-State BP

• URL: http://arxiv.org/abs/2605.05132v1
• Date: Wed, 06 May 2026 17:05:36 GMT
• Title: A Factor-Graph Formulation of CSS Syndrome Decoding: Joint BP and Four-State BP
• Abstract summary: We call the sum-product algorithm on this factorization joint belief propagation (joint BP)<n>This note compares joint BP with the four-state Pauli-label factor graph used for four-state BP.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: For CSS syndrome decoding, the two check matrices impose binary parity-check constraints on the two Pauli error components. The posterior can therefore be written as a binary factor graph with two Tanner graphs coupled by the local joint prior at each qubit. We call the sum-product algorithm on this factorization joint belief propagation (joint BP). Joint BP retains the local channel correlation between the two Pauli components. This note compares joint BP with the four-state Pauli-label factor graph used for four-state BP. The two algorithms are shown to have the same posterior weights, messages, and beliefs after relabeling the four local Pauli states and marginalizing the irrelevant binary component.

Related papers

• Distributed synthesis of arbitrary graph states in quantum networks via rank-two GF(2) reduction [10.444672877393124]
  Existing schemes for synthesizing graph states in quantum networks are essentially edge-by-edge constructions.<n>This paper proposes a new method for synthesizing arbitrary N-node graph states in quantum networks.
  arXiv  Detail & Related papers  (2026-08-21T14:37:08Z)
• Measurement-Based Loss Tolerance in Graph-GKP Codes through Syndrome-Resolved Pauli-Frame Decoding [46.2474896050764]
  We develop a causal framework that unifies these mechanisms for measurement-based loss tolerance under pure loss.<n>We derive decoder-conditioned branch restriction, signed-outcome reconstruction, Pauli-frame updating, and syndrome-resolved logical fusion.<n>The resulting graph-GKP interface provides a unified causal control layer for fault-tolerant MBQC, fusion-based computation, and all-photonic repeaters.
  arXiv  Detail & Related papers  (2026-08-01T19:14:42Z)
• Spatially Coupled MacKay-Neal/Hsu-Anastasopoulos CSS Codes Achieve the Quantum-Erasure Hashing Bound by Seeded BP Decoding [0.0]
  We show that hard-erasure CSS codes can reach the hashing bound on the quantum erasure channel under seeded BP decoding.<n>The paper gives a DE-level proof that seeded BP decoding with finite-degree factor graphs achieves the hashing bound for the X/Z equal-rate family.
  arXiv  Detail & Related papers  (2026-06-30T17:34:54Z)
• Fixed-Parameter Tractability of Private Synthetic Data Generation [84.99100741615423]
  We study the problem of generating synthetic data under differential privacy.<n>Our algorithms attain optimal error rates across all regimes and are realized by two different approaches.
  arXiv  Detail & Related papers  (2026-06-09T15:14:11Z)
• Mapping Text to Multiplex Graph: Prompt Compression as Lévy Walk-Guided Graph Pruning [55.43705665875779]
  RAGP formulates prompt compression as Redundancy-Aware Graph Pruning on a multiplex graph.<n> Experiments on LongBench show that RAGP achieves an average score of 49.3 under a 4x compression ratio.
  arXiv  Detail & Related papers  (2026-05-04T01:41:31Z)
• BrepGPT: Autoregressive B-rep Generation with Voronoi Half-Patch [61.20046418942948]
  Boundary representation (B-rep) is the de facto standard for CAD model representation in modern industrial design.<n>We present BrepGPT, a single-stage autoregressive framework for B-rep generation.
  arXiv  Detail & Related papers  (2025-11-27T07:16:53Z)
• An almost-linear time decoding algorithm for quantum LDPC codes under circuit-level noise [0.562479170374811]
  Fault-tolerant quantum computers must be designed in conjunction with classical co-processors.<n>We introduce the belief propagation plus ordered Tanner forest (BP+OTF) algorithm as an almost-linear time decoder for quantum low-density parity-check codes.
  arXiv  Detail & Related papers  (2024-09-02T19:50:57Z)
• On the Constant Depth Implementation of Pauli Exponentials [49.48516314472825]
  We decompose $Zotimes n$ exponentials of arbitrary length into circuits of constant depth using $mathcalO(n)$ ancillae and two-body XX and ZZ interactions.<n>We prove the correctness of our approach, after introducing novel rewrite rules for circuits which benefit from qubit recycling.
  arXiv  Detail & Related papers  (2024-08-15T17:09:08Z)
• 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)
• Graph Convolutional Network with Generalized Factorized Bilinear Aggregation [31.674649135019386]
  We propose a novel generalization of Factorized Bilinear (FB) layer to model the feature interactions in Graph Convolutional Networks (GCNs) Our experimental results on multiple datasets demonstrate that the GFB-GCN is competitive with other methods for text classification.
  arXiv  Detail & Related papers  (2021-07-24T17:57:06Z)
• Refined Belief-Propagation Decoding of Quantum Codes with Scalar Messages [4.340338299803562]
  Codes based on sparse matrices have good performance and can be efficiently decoded by belief-propagation (BP) BP decoding of stabilizer codes suffers a performance loss from the short cycles in the underlying Tanner graph. We show that running BP with message normalization according to a serial schedule may significantly improve the decoding performance and error-floor in computer simulation.
  arXiv  Detail & Related papers  (2021-02-14T10:29:58Z)
• Refined Belief Propagation Decoding of Sparse-Graph Quantum Codes [4.340338299803562]
  We propose a refined BP decoding algorithm for quantum codes with complexity roughly the same as binary BP. For a given error syndrome, this algorithm decodes to the same output as the conventional quaternary BP, but the passed node-to-node messages are single-valued. Message strength normalization can naturally be applied to these single-valued messages to improve the performance.
  arXiv  Detail & Related papers  (2020-02-16T03:51:59Z)
• Pruning Neural Belief Propagation Decoders [77.237958592189]
  We introduce a method to tailor an overcomplete parity-check matrix to (neural) BP decoding using machine learning. We achieve performance within 0.27 dB and 1.5 dB of the ML performance while reducing the complexity of the decoder.
  arXiv  Detail & Related papers  (2020-01-21T12:05:46Z)

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.