Papers › Soft information decoding with superconducting qubits
Soft information decoding with superconducting qubits
Maurice D. Hanisch, Bence Hetényi, James R. Wootton
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Quantum error correction promises a viable path to fault-tolerant computations, enabling exponential error suppression when the device's error rates remain below the protocol's threshold. This threshold, however, strongly depends on the classical method used to decode the syndrome measurements. These classical algorithms traditionally only interpret binary data, ignoring valuable information contained in the complete analog measurement data. In this work, we leverage this richer "soft information" to decode repetition code experiments implemented on superconducting hardware. We find that "soft decoding" can raise the threshold by 25%, yielding up to 30 times lower error rates. Analyzing the trade-off between information volume and decoding performance we show that a single byte of information per measurement suffices to reach optimal decoding. This underscores the effectiveness and practicality of soft decoding on hardware, including in time-sensitive contexts such as real-time decoding.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections