Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Open Access

Soft information decoding with superconducting qubits

Maurice D. Hanisch1,2, Bence Hetényi1,*, and James R. Wootton1,3,†

  • *Contact author: bence.hetenyi@ibm.com
  • †Contact author: james.wootton@unibas.ch

APS Open Sci. 1, 000019 – Published 8 May, 2026

DOI: https://doi.org/10.1103/y9fh-4x6n

Abstract

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. However, this threshold strongly depends on the classical method used to decode the measurements of the syndrome. These classical algorithms traditionally only interpret binary data, ignoring valuable information contained in complete analog measurement data. We present the first large-scale experimental verification of soft decoding by implementing repetition codes up to distance 51 on superconducting hardware. Unlike previous demonstrations limited to small code distances, this extensive range allows us to confirm a fundamental improvement in the exponential scaling of error suppression rather than a mere constant-factor reduction in error rates. We observe a 25% increase in the threshold, which yields logical error rates up to 30 times lower than standard hard decoding. 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.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (31)

  1. S. Krinner, N. Lacroix, A. Remm, A. Di Paolo, E. Genois, C. Leroux, C. Hellings, S. Lazar, F. Swiadek, J. Herrmann, G. J. Norris, C. K. Andersen, M. Müller, A. Blais, C. Eichler, and A. Wallraff, Realizing repeated quantum error correction in a distance-three surface code, Nature (London) 605, 669 (2022).
  2. Y. Zhao et al., Realization of an error-correcting surface code with superconducting qubits, Phys. Rev. Lett. 129, 030501 (2022).
  3. Google Quantum AI, Suppressing quantum errors by scaling a surface code logical qubit, Nature (London) 614, 676 (2023).
  4. D. Bluvstein et al., Logical quantum processor based on reconfigurable atom arrays, Nature (London) 626, 58 (2024).
  5. M. P. da Silva et al., Demonstration of logical qubits and repeated error correction with better-than-physical error rates, arXiv:2404.02280.
  6. R. S. Gupta, N. Sundaresan, T. Alexander, C. J. Wood, S. T. Merkel, M. B. Healy, M. Hillenbrand, T. Jochym-O’Connor, J. R. Wootton, T. J. Yoder, A. W. Cross, M. Takita, and B. J. Brown, Encoding a magic state with beyond break-even fidelity, Nature (London) 625, 259 (2024).
  7. R. Acharya et al., Quantum error correction below the surface code threshold, Nature (London) 638, 920 (2025).
  8. C. A. Pattison, M. E. Beverland, M. P. da Silva, and N. Delfosse, Improved quantum error correction using soft information, arXiv:2107.13589.
  9. B. M. Varbanov, M. Serra-Peralta, D. Byfield, and B. M. Terhal, Neural network decoder for near-term surface-code experiments, Phys. Rev. Res. 7, 013029 (2025).
  10. J. Bausch, A. W. Senior, F. J. H. Heras, T. Edlich, A. Davies, M. Newman, C. Jones, K. Satzinger, M. Y. Niu, S. Blackwell, G. Holland, D. Kafri, J. Atalaya, C. Gidney, D. Hassabis, S. Boixo, H. Neven, and P. Kohli, Learning to decode the surface code with a recurrent, transformer-based neural network, Nature (London) 635, 834 (2024).
  11. X. Xue, B. D’Anjou, T. F. Watson, D. R. Ward, D. E. Savage, M. G. Lagally, M. Friesen, S. N. Coppersmith, M. A. Eriksson, W. A. Coish, and L. M. K. Vandersypen, Repetitive quantum nondemolition measurement and soft decoding of a silicon spin qubit, Phys. Rev. X 10, 021006 (2020).
  12. N. Sundaresan, T. J. Yoder, Y. Kim, M. Li, E. H. Chen, G. Harper, T. Thorbeck, A. W. Cross, A. D. Córcoles, and M. Takita, Demonstrating multi-round subsystem quantum error correction using matching and maximum likelihood decoders, Nat. Commun. 14, 2852 (2023).
  13. H. Ali, J. Marques, O. Crawford, J. Majaniemi, M. Serra-Peralta, D. Byfield, B. Varbanov, B. M. Terhal, L. DiCarlo, and E. T. Campbell, Reducing the error rate of a superconducting logical qubit using analog readout information, Phys. Rev. Appl. 22, 044031 (2024).
  14. K. C. Miao et al., Overcoming leakage in scalable quantum error correction, Nat. Phys. 19, 1780 (2023).
  15. G. P. Gehér, M. Jastrzebski, E. T. Campbell, and O. Crawford, To reset, or not to reset—that is the question, npj Quantum Inf. 11, 39 (2025).
  16. O. Higgott, PyMatching: A Python package for decoding quantum codes with minimum-weight perfect matching, arXiv:2105.13082.
  17. O. Higgott and C. Gidney, Sparse blossom: Correcting a million errors per core second with minimum-weight matching, Quantum 9, 1600 (2025).
  18. Google Quantum AI, Exponential suppression of bit or phase errors with cyclic error correction, Nature (London) 595, 383 (2021).
  19. B. Hetényi and J. R. Wootton, Tailoring quantum error correction to spin qubits, Phys. Rev. A 109, 032433 (2024).
  20. J. Kelly et al., State preservation by repetitive error detection in a superconducting quantum circuit, Nature (London) 519, 66 (2015).
  21. C. Gidney, Stim: A fast stabilizer circuit simulator, Quantum 5, 497 (2021).
  22. M. Kang, W. C. Campbell, and K. R. Brown, Quantum error correction with metastable states of trapped ions using erasure conversion, PRX Quantum 4, 020358 (2023).
  23. A. Javadi-Abhari, M. Treinish, K. Krsulich, C. J. Wood, J. Lishman, J. Gacon, S. Martiel, P. D. Nation, L. S. Bishop, A. W. Cross, B. R. Johnson, and J. M. Gambetta, Quantum computing with Qiskit, arXiv:2405.08810.
  24. E. B. Wilson, Probable inference, the law of succession, and statistical inference, J. Am. Stat. Assoc. 22, 209 (1927).
  25. I. Hesner, B. Hetényi, and J. R. Wootton, Using detector likelihood for benchmarking quantum error correction, Phys. Rev. A 111, 052452 (2025).
  26. https://github.com/quantumjim/soft_information_decoding.
  27. C. D. Bruzewicz, J. Chiaverini, R. McConnell, and J. M. Sage, Trapped-ion quantum computing: Progress and challenges, Appl. Phys. Rev. 6, 021314 (2019).
  28. G. Burkard, T. D. Ladd, J. M. Nichol, A. Pan, and J. R. Petta, Semiconductor spin qubits, Rev. Mod. Phys. 95, 025003 (2023).
  29. V. A. Epanechnikov, Non-parametric estimation of a multivariate probability density, Theory Probab. Appl. 14, 153 (1969).
  30. Y. Naveh, E. Kashefi, J. R. Wootton, and K. Bertels, Theoretical and practical aspects of verification of quantum computers, in Porceedings of the 2018 Design, Automation & Test in Europe Conference & Exhibition (DATE) (IEEE, Dresden, Germany, 2018), pp. 721–730.
  31. R. R. Curtin et al., mlpack 4: A fast, header-only C++ machine learning library, J. Open Source Softw. 8, 5026 (2023).

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation