Code-Agnostic Graph Neural Network Decoding from Detection Error Models: A Reconciled Quantitative and Structural Assessment
Abstract
Graph neural network (GNN) decoders for quantum error correction have historically been locked to specific code families. The POLYMECHANON preprint [1,2] proposes a decoder whose sole input is the detection error model (DEM) — a tripartite graph of detectors, error mechanisms, and logical observables — making the code data rather than an architectural design choice. This paper provides an independent, arithmetic-first assessment of that claim. We convert the reported headline numbers into concrete quantities: a 25% reduction in logical failures versus correlated MWPM on the rotated surface code corresponds to an improvement factor of 0.75, which under the standard scaling ansatz p_L ∝ (p/p_th)^⌈d/2⌉ is equivalent to a relative pseudo-threshold improvement of ≈10.06% at d = 5 and ≈7.46% at d = 7; a 16% reduction on the [[130,4,6]] qLDPC code corresponds to a factor of 0.84 and an equivalent threshold improvement of ≈5.98%. The reported latency advantage ("a few ms per shot on a single GPU" versus "a few tens of ms" for BP+OSD on a CPU core) would bound the speedup in [4×, 25×], midpoint ≈10×, with an explicit hardware-asymmetry caveat — but this latency analysis is conditional on claims not verifiable in the available abstract record of [1,2]. We derive DEM graph sizes for canonical cases (441 detectors, 1,337 mechanisms, 2,681 edges at d = 8, R = 8 under stated conventions), prove a cheap non-isomorphism certificate between surface-code and qLDPC DEMs via part-size vectors, and show that the claimed post-selection result (>10× error reduction at >90% shot retention) would arithmetically require discarded shots to fail at ≈9.1× the base rate — a strong, testable separability condition, conditional on a claim not verifiable in the available abstract record of [1,2]. We identify size-generalization, DEM fidelity, and hardware-fair latency comparison as the principal open risks, and propose falsification experiments for each. ## 1. Introduction Fault-tolerant quantum Full text and updates: papers.qnfo.org/papers/code-agnostic-graph-neural-network-decoding-from-detection-error-models-a-reconc/
