Skip to content

PriorTilt: Decoding quantum LDPC codes with sparse perturbations of belief propagation priors

Min Ye, Nicolas Delfosse

quant-pharXiv:2611.13373

Abstract

Although belief propagation (BP) is a widely adopted decoder for classical low-density parity-check (LDPC) codes, its accuracy is limited in the quantum setting. We introduce , a variant of BP obtained by selectively perturbing a small fraction of its prior log-likelihood ratios using offsets determined by recent posterior and outgoing-message statistics, while preserving the same message-passing rules. We compare with Relay-BP and beam search decoders for circuit-level decoding of three benchmark codes. achieves a lower logical error rate (LER) than both baselines at every tested data point. For the [[144,12,12]] Gross code BB144 at noise rate p=10-3, the LER reductions reach 4.3× relative to Relay-BP and 3.1× relative to the beam search decoder. At p=10-3, has lower mean decoding times than Relay-BP on all three codes and achieves mean decoding speedups of approximately 2.6×--3.0× over the beam search decoder. For BB144 at p=10-3, achieves an LER approximately 610× lower than the standard min-sum BP decoder with the same iteration budget, while perturbing fewer than 0.5\% of its priors per round on average.

Create a lesson