International Journal of Scientific Research in Computer Sciences and Engineering
Neural Syndrome Decoding Versus Minimum-Weight Matching: A Controlled Benchmark for Quantum Repetition Codes
Srinivasa Rao Gundu, Swathi Jarapla
Abstract
Learned decoders are often proposed as a faster, more adaptable replacement for minimum-weight perfect matching (MWPM) in quantum error correction, yet published comparisons mix datasets, noise levels and metrics, and many omit a matching baseline altogether. This paper contributes a controlled benchmark in which a multilayer perceptron (MLP), a two-layer LSTM and a Transformer encoder are trained and tested on identical Stim-generated repetition-code data (distances 3 to 11, circuit-level depolarizing noise, five measurement rounds) under one training protocol, and are scored against MWPM and a trivial majority-class predictor over five independent seeds. We report logical error rate, balanced accuracy, F1 for the logical-error class and ROC-AUC rather than raw accuracy, because roughly 12% of shots at a physical error rate of 0.05 (and under 1% at 0.003) carry a logical flip, so a decoder that never predicts an error already scores 88% (99.2% at the lower rate). With 3,200 training shots, none of the neural decoders matches MWPM at any distance. MWPM drives the logical error rate from 4.3% at distance 3 to nearly zero at distance 11, whereas the neural decoders stay between 5% and 12% and the MLP falls back to the majority prediction once the syndrome has 60 bits. Presenting the temporal structure of the syndrome to the network, one token per measurement round, gives the largest and most consistent gain, and a Transformer fed scalar detector tokens without positional information collapses. We also examine the effect of training-set size, a shift in test-time noise, and decoding latency, and we discuss which conclusions the data do and do not support.