aiqbench analysis
This research introduces a "swim distance" decoder confidence score to reliably estimate logical error probabilities in fault-tolerant quantum circuits without additional quantum resources. By selectively aborting computations with low confidence scores, the method achieves massive improvements in logical error rates for both shallow and large-scale algorithms. The findings provide a practical framework for enhancing observable estimation and noise mitigation in future quantum hardware implementations.
Error mitigation for logical circuits using decoder confidence
arXiv:2512.15689v4 Announce Type: replace Abstract: Fault-tolerant quantum computers use decoders to monitor for errors and find a plausible correction. A decoder may provide a \emph{decoder confidence score} (DCS) to gauge its success. We adopt a \emph{swim distance} DCS, computed from the shortest path between syndrome clusters. By contracting tensor networks, we compare its performance under phenomenological noise to the well-known \emph{complementary gap} and find that both reliably estimate the logical error probability (LEP) in a decoding window. We explore ways to use this to mitigate the LEP in entire logical circuits. For shallow circuits, we just abort if any decoding window produces an exceptionally low DCS: for one window of a distance-13 surface code under circuit-level noise, rejecting a mere $0.1\%$ of possible DCS values improves the window's mean LEP by more than 5 orders of magnitude. For larger algorithms comprising up to billions of windows, DCS-based rejection remains effective for enhancing observable estimation. Moreover, one can use the DCS to assign each circuit's output a unique LEP, and use it as a basis for maximum likelihood estimation. This can reduce the effects of noise by an order of magnitude at no quantum cost; we explore the combination of these methods.
Abstract:Fault-tolerant quantum computers use decoders to monitor for errors and find a plausible correction. A decoder may provide a \emph{decoder confidence score} (DCS) to gauge its success. We adopt a \emph{swim distance} DCS, computed from the shortest path between syndrome clusters. By contracting tensor networks, we compare its performance under phenomenological noise to the well-known \emph{complementary gap} and find that both reliably estimate the logical error probability (LEP) in a decoding window. We explore ways to use this to mitigate the LEP in entire logical circuits. For shallow circuits, we just abort if any decoding window produces an exceptionally low DCS: for one window of a distance-13 surface code under circuit-level noise, rejecting a mere $0.1\%$ of possible DCS values improves the window's mean LEP by more than 5 orders of magnitude. For larger algorithms comprising up to billions of windows, DCS-based rejection remains effective for enhancing observable estimation. Moreover, one can use the DCS to assign each circuit's output a unique LEP, and use it as a basis for maximum likelihood estimation. This can reduce the effects of noise by an order of magnitude at no quantum cost; we explore the combination of these methods.
25 pages (19 main, 6 Supplementary Information). 15 figures (9 main, 6 supplementary information). v4: added window independence calculations and discussion; reformatted appendices into Methods and SI
arXiv:2512.15689 [quant-ph]
(or arXiv:2512.15689v4 [quant-ph] for this version)
Full text under the publisher's open licence · 231 words
Related coverage

AI and Quantum Computing Briefing
livetradingnews.com · Aug 4, 2026

IBM maps a path from error reduction to full quantum correction
Quantum Zeitgeist · Sep 16, 2026

Error mitigation cuts sampling overhead for quantum circuits
Quantum Zeitgeist · Oct 15, 2026

Lattice-Based Cryptography Explained
Quantum Zeitgeist · Aug 15, 2026