Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This research demonstrates how discrepancies between quantum hardware noise models and actual device drift can be leveraged to improve error correction, significantly reducing logical error rates on IBM and Google processors. By treating model mismatches as informative signals rather than errors, the authors achieve substantial fidelity gains in surface-code memory experiments without requiring new physical qubits. This approach offers a practical pathway to enhance decoder robustness against hardware instability, a critical step toward fault-tolerant quantum computing.
Sources coveringarXiv, Quantum Zeitgeist
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Decoder Model Compatibility Provides Information beyond the Logical Gap under Drifting and Correlated Quantum Noise

arXiv3 min read

arXiv:2609.29018v1 Announce Type: new Abstract: Quantum error-correcting decoders provide both corrections and confidence estimates for the logical-error risk of individual measurement records. Such confidence can guide postselection, but it depends on the accuracy of the decoder noise model. When the physical device drifts away from that model, confidence measures such as the logical gap can become miscalibrated. We show that this mismatch can itself provide useful information. On IBM quantum hardware, syndrome statistics drift across consecutive acquisition windows, and the resulting detector histories differ substantially from those predicted by the stationary detector error model used for decoding. We observe a similar hardware-model mismatch in independent Google surface-code memory data. We exploit this effect by assigning additional rejection weight to detector histories that are unlikely under the assumed model. For minimum-weight perfect matching (MWPM), the minimum weight $W$ provides an inexpensive proxy for syndrome surprisal. On held-out IBM repetition-code memories, likelihood-aware postselection reduces the retained logical-error probability (LEP) by $10.6\%$ at $d=7$ and $28.8\%$ at $d=9$, both at $15\%$ rejection. On Google ten-round $d=5$ XZZX surface-code memory data, it reduces retained LEP by $75.4\%$ at $90\%$ rejection. Applied to Google's magic-state cultivation experiment with the Tesseract decoder, it reduces tomography infidelity by $34.7\%$ with $30\%$ additional grafting-stage rejection, or increases accepted yield by $30.4\%$ at a target fidelity of $97.0\%$. Burst-noise simulations show that the advantage persists as code distance and syndrome-extraction volume increase. The method reuses quantities already produced during logical-gap decoding and requires only an additional fitting step.

Authors:Aaron C. Hoyt, Chunshu Wu, Shuwen Kan, Sean Garner, Avimita Chatterjee, Drew Rebar, Norman M. Tubman, Katherine Klymko, Chenxu Liu, Ang Li, Samuel Stein

Abstract:Quantum error-correcting decoders provide both corrections and confidence estimates for the logical-error risk of individual measurement records. Such confidence can guide postselection, but it depends on the accuracy of the decoder noise model. When the physical device drifts away from that model, confidence measures such as the logical gap can become miscalibrated. We show that this mismatch can itself provide useful information. On IBM quantum hardware, syndrome statistics drift across consecutive acquisition windows, and the resulting detector histories differ substantially from those predicted by the stationary detector error model used for decoding. We observe a similar hardware-model mismatch in independent Google surface-code memory data. We exploit this effect by assigning additional rejection weight to detector histories that are unlikely under the assumed model. For minimum-weight perfect matching (MWPM), the minimum weight $W$ provides an inexpensive proxy for syndrome surprisal. On held-out IBM repetition-code memories, likelihood-aware postselection reduces the retained logical-error probability (LEP) by $10.6\%$ at $d=7$ and $28.8\%$ at $d=9$, both at $15\%$ rejection. On Google ten-round $d=5$ XZZX surface-code memory data, it reduces retained LEP by $75.4\%$ at $90\%$ rejection. Applied to Google's magic-state cultivation experiment with the Tesseract decoder, it reduces tomography infidelity by $34.7\%$ with $30\%$ additional grafting-stage rejection, or increases accepted yield by $30.4\%$ at a target fidelity of $97.0\%$. Burst-noise simulations show that the advantage persists as code distance and syndrome-extraction volume increase. The method reuses quantities already produced during logical-gap decoding and requires only an additional fitting step.

arXiv:2609.29018 [quant-ph]

(or arXiv:2609.29018v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2609.29018 arXiv-issued DOI via DataCite (pending registration)

Full text under the publisher's open licence · 283 words

Related coverage