Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2307.14989 · Quantum

Decoding algorithms for surface codes

Antonio deMarti iOlius, Patricio Fuentes, Román Orús, Pedro M. Crespo, Josu Etxezarreta Martínez

Published Oct 10, 2024• 57 citations
arXivHTMLPDF

Abstract

Quantum technologies have the potential to solve certain computationally hard problems with polynomial or super-polynomial speedups when compared to classical methods. Unfortunately, the unstable nature of quantum information makes it prone to errors. For this reason, quantum error correction is an invaluable tool to make quantum information reliable and enable the ultimate goal of fault-tolerant quantum computing. Surface codes currently stand as the most promising candidates to build near term error corrected qubits given their two-dimensional architecture, the requirement of only local operations, and high tolerance to quantum noise. Decoding algorithms are an integral component of any error correction scheme, as they are tasked with producing accurate estimates of the errors that affect quantum information, so that they can subsequently be corrected. A critical aspect of decoding algorithms is their speed, since the quantum state will suffer additional errors with the passage of time. This poses a connundrum, where decoding performance is improved at the expense of complexity and viceversa. In this review, a thorough discussion of state-of-the-art decoding algorithms for surface codes is provided. The target audience of this work are both readers with an introductory understanding of the field as well as those seeking to further their knowledge of the decoding paradigm of surface codes. We describe the core principles of these decoding methods as well as existing variants that show promise for improved results. In addition, both the decoding performance, in terms of error correction capability, and decoding complexity, are compared. A review of the existing software tools regarding surface codes decoding is also provided.

DOI
10.22331/q-2024-10-10-1498

Related papers

Real‐Time Decoding For Surface Code

Jia-Ning Li, Tian-hao WEI, Zi-Hao Mei +5 more

ABSTRACT Quantum computing can effectively solve certain specific problems that classical computing cannot address efficiently. However, due to the vulnerability of qubits to noise, quantum error‐correcting codes need to be introduced in the process of implementing quantum computing. Fault‐tolerant quantum computing is achieved through the encoding and decoding of qubits. There are various types of quantum error‐correcting codes, among which the surface code is favored by researchers for its simple topological structure, requirement of only local operations, and relatively high threshold. For quantum error‐correcting codes, corresponding decoders are necessary for decoding. Driven by the demand for fault‐tolerant quantum computing, the decoding of quantum error‐correcting codes must support real‐time functionality, which means there are specific requirements for the decoding speed of decoders. In this review, we focus on work related to real‐time decoding for the surface code, and presents recent advances in this field, particularly those that have been implemented on hardware platforms or show potential for implementation.

Advanced Quantum Technologies•May 1, 2026•1 citation

Fast fault-tolerant decoder for qubit and qudit surface codes

Fern H. E. Watson, Hussain Anwar, Dan E. Browne

The surface code is one of the most promising candidates for combating errors in large scale fault-tolerant quantum computation. A fault-tolerant decoder is a vital part of the error correction process---it is the algorithm which computes the operations needed to correct or compensate for the errors according to the measured syndrome, even when the measurement itself is error prone. Previously decoders based on minimum-weight perfect matching have been studied. However, these are not immediately generalizable from qubit to qudit codes. In this work, we develop a fault-tolerant decoder for the surface code, capable of efficient operation for qubits and qudits of any dimension, generalizing the decoder first introduced by Bravyi and Haah [Phys. Rev. Lett. 111, 200501 (2013)]. We study its performance when both the physical qudits and the syndromes measurements are subject to generalized uncorrelated bit-flip noise (and the higher-dimensional equivalent). We show that, with appropriate enhancements to the decoder and a high enough qudit dimension, a threshold at an error rate of more than $8%$ can be achieved.

arXiv:1411.3028•Physical Review A•Sep 8, 2015•62 citations

A Comprehensive Review of Recent Progress in Quantum Error Correction: Codes, Decoders, and Fault-Tolerant Architectures

Volkan Erol

This review article provides a comprehensive overview of recent developments in the field of quantum error correction (QEC), which stands as one of the biggest challenges for quantum computing. The extreme sensitivity of quantum systems to environmental noise makes it difficult to build reliable and scalable quantum computers. Inspired by pioneering codes like those from Shor and Steane, this work discusses the most promising QEC approaches today, particularly topological codes such as surface codes and low-density parity-check (LDPC) codes. The paper delves into critical experimental successes from industry leaders like Google, IBM, and Quantinuum, including their ”below-threshold” error correction demonstrations and roadmaps for fault-tolerant systems. It also presents a comparative analysis between classical algorithms like Minimum-Weight Perfect Matching (MWPM) and newer, machine learning-based decoder approaches. The discussion section addresses open problems that need to be solved in the future, such as correlated noise, cryogenic control, and the creation of fault-tolerant logical gate sets. This review aims to summarize the current state of the QEC field, serving as a guiding resource for both academics and industry professionals in shaping future research and development strategies.

•Sep 12, 2025•1 citation

A Comprehensive Review of Recent Progress in Quantum Error Correction: Codes, Decoders, and Fault-Tolerant Architectures

Volkan Erol

This review article provides a comprehensive overview of recent developments in the field of quantum error correction (QEC), which stands as one of the biggest challenges for quantum computing. The extreme sensitivity of quantum systems to environmental noise makes it difficult to build reliable and scalable quantum computers. Inspired by pioneering codes like those from Shor and Steane, this work discusses the most promising QEC approaches today, particularly topological codes such as surface codes and low-density parity-check (LDPC) codes. The paper delves into critical experimental successes from industry leaders like Google, IBM, and Quantinuum, including their ”below-threshold” error correction demonstrations and roadmaps for fault-tolerant systems. It also presents a comparative analysis between classical algorithms like Minimum-Weight Perfect Matching (MWPM) and newer, machine learning-based decoder approaches. The discussion section addresses open problems that need to be solved in the future, such as correlated noise, cryogenic control, and the creation of fault-tolerant logical gate sets. This review aims to summarize the current state of the QEC field, serving as a guiding resource for both academics and industry professionals in shaping future research and development strategies.

•Sep 15, 2025•0 citations

Neural-Network Decoders for Quantum Error Correction Using Surface Codes: A Space Exploration of the Hardware Cost-Performance Tradeoffs

Ramon W. J. Overwater, Masoud Babaie, Fabio Sebastiano

Quantum Error Correction (QEC) is required in quantum computers to mitigate the effect of errors on physical qubits. When adopting a QEC scheme based on surface codes, error decoding is the most computationally expensive task in the classical electronic back-end. Decoders employing neural networks (NN) are well-suited for this task but their hardware implementation has not been presented yet. This work presents a space exploration of fully-connected feed-forward NN decoders for small distance surface codes. The goal is to optimize the neural network for high decoding performance, while keeping a minimalistic hardware implementation. This is needed to meet the tight delay constraints of real-time surface code decoding. We demonstrate that hardware based NN-decoders can achieve high decoding performance comparable to other state-of-the-art decoding algorithms whilst being well below the tight delay requirements (440 ns) of current solid-state qubit technologies for both ASIC designs (<30 ns) and FPGA implementations (<90 ns). These results indicate that NN-decoders are viable candidates for further exploration of an integrated hardware implementation in future large-scale quantum computers.

arXiv:2202.05741•IEEE Transactions on Quantum Engineering•Jan 1, 2022•75 citations

New methods in quantum error correction and fault-tolerant quantum computing

Christopher Chamberland

Quantum computers have the potential to solve several interesting problems in polynomial \ntime for which no polynomial time classical algorithms have been found. However, \none of the major challenges in building quantum devices is that quantum systems are very \nsensitive to noise arising from undesired interactions with the environment. Noise can lead \nto errors which can corrupt the results of the computation. Quantum error correction is \none way to mitigate the effects of noise arising in quantum devices. \nWith a plethora of quantum error correcting codes that can be used in various settings, \none of the main challenges of quantum error correction is understanding how well various \ncodes perform under more realistic noise models that can be observed in experiments. \nThis thesis proposes a new decoding algorithm which can optimize threshold values of \nerror correcting codes under different noise models. The algorithm can be applied to \nany Markovian noise model. Further, it is shown that for certain noise models, logical \nClifford corrections can further improve a code's threshold value if the code obeys certain \nsymmetries. \n \nSince gates and measurements cannot in general be performed with perfect precision, \nthe operations required to perform quantum error correction can introduce more errors \ninto the system thus negating the benefits of error correction. Fault-tolerant quantum \ncomputing is a way to perform quantum error correction with imperfect operations while \nretaining the ability to suppress errors as long as the noise is below a code's threshold. \nOne of the main challenges in performing fault-tolerant error correction is the high resource \nrequirements that are needed to obtain very low logical noise rates. With the use of \nflag qubits, this thesis develops new fault-tolerant error correction protocols that are applicable \nto arbitrary distance codes. Various code families are shown to satisfy the requirements \nof flag fault-tolerant error correction. We also provide circuits using a constant number of \nqubits for these codes. It is shown that the proposed flag fault-tolerant method uses fewer \nqubits than previous fault-tolerant error correction protocols. \n \nIt is often the case that the noise afflicting a quantum device cannot be fully characterized. \nFurther, even with some knowledge of the noise, it can be very challenging to use \nanalytic decoding methods to improve the performance of a fault-tolerant scheme. This \nthesis presents decoding schemes using several state of the art machine learning techniques \nwith a focus on fault-tolerant quantum error correction in regimes that are relevant to near \nterm experiments. It is shown that even in low noise rate regimes and with no knowledge \nof the noise, noise can be further suppressed for small distance codes. Limitations of machine \nlearning decoders as well as the classical resources required to perform active error \ncorrection are discussed. \n \nIn many cases, gate times can be much shorter than typical measurement times of \nquantum states. Further, classical decoding of the syndrome information used in quantum \nerror correction to compute recovery operators can also be much slower than gate times. \nFor these reasons, schemes where error correction can be implemented in a frame (known \nas the Pauli frame) have been developed to avoid active error correction. In this thesis, we \ngeneralize previous Pauli frame schemes and show how Clifford frame error correction can \nbe implemented with minimal overhead. Clifford frame error correction is necessary if the \nlogical component of recovery operators were chosen from the Clifford group, but could \nalso be used in randomized benchmarking schemes.

•Oct 22, 2018•0 citations
Quantum technologies have the potential to solve certain computationally hard problems with polynomial or super-polynomial speedups when compared to classical methods. Unfortunately, the unstable nature of quantum information makes it prone to errors. For this reason, quantum error correction is an invaluable tool to make quantum information reliable and enable the ultimate goal of fault-tolerant quantum computing. Surface codes currently stand as the most promising candidates to build near term error corrected qubits given their two-dimensional architecture, the requirement of only local operations, and high tolerance to quantum noise. Decoding algorithms are an integral component of any error correction scheme, as they are tasked with producing accurate estimates of the errors that affect quantum information, so that they can subsequently be corrected. A critical aspect of decoding algorithms is their speed, since the quantum state will suffer additional errors with the passage of time. This poses a connundrum, where decoding performance is improved at the expense of complexity and viceversa. In this review, a thorough discussion of state-of-the-art decoding algorithms for surface codes is provided. The target audience of this work are both readers with an introductory understanding of the field as well as those seeking to further their knowledge of the decoding paradigm of surface codes. We describe the core principles of these decoding methods as well as existing variants that show promise for improved results. In addition, both the decoding performance, in terms of error correction capability, and decoding complexity, are compared. A review of the existing software tools regarding surface codes decoding is also provided.
ABSTRACT Quantum computing can effectively solve certain specific problems that classical computing cannot address efficiently. However, due to the vulnerability of qubits to noise, quantum error‐correcting codes need to be introduced in the process of implementing quantum computing. Fault‐tolerant quantum computing is achieved through the encoding and decoding of qubits. There are various types of quantum error‐correcting codes, among which the surface code is favored by researchers for its simple topological structure, requirement of only local operations, and relatively high threshold. For quantum error‐correcting codes, corresponding decoders are necessary for decoding. Driven by the demand for fault‐tolerant quantum computing, the decoding of quantum error‐correcting codes must support real‐time functionality, which means there are specific requirements for the decoding speed of decoders. In this review, we focus on work related to real‐time decoding for the surface code, and presents recent advances in this field, particularly those that have been implemented on hardware platforms or show potential for implementation.
The surface code is one of the most promising candidates for combating errors in large scale fault-tolerant quantum computation. A fault-tolerant decoder is a vital part of the error correction process---it is the algorithm which computes the operations needed to correct or compensate for the errors according to the measured syndrome, even when the measurement itself is error prone. Previously decoders based on minimum-weight perfect matching have been studied. However, these are not immediately generalizable from qubit to qudit codes. In this work, we develop a fault-tolerant decoder for the surface code, capable of efficient operation for qubits and qudits of any dimension, generalizing the decoder first introduced by Bravyi and Haah [Phys. Rev. Lett. 111, 200501 (2013)]. We study its performance when both the physical qudits and the syndromes measurements are subject to generalized uncorrelated bit-flip noise (and the higher-dimensional equivalent). We show that, with appropriate enhancements to the decoder and a high enough qudit dimension, a threshold at an error rate of more than 88%8 can be achieved.
This review article provides a comprehensive overview of recent developments in the field of quantum error correction (QEC), which stands as one of the biggest challenges for quantum computing. The extreme sensitivity of quantum systems to environmental noise makes it difficult to build reliable and scalable quantum computers. Inspired by pioneering codes like those from Shor and Steane, this work discusses the most promising QEC approaches today, particularly topological codes such as surface codes and low-density parity-check (LDPC) codes. The paper delves into critical experimental successes from industry leaders like Google, IBM, and Quantinuum, including their ”below-threshold” error correction demonstrations and roadmaps for fault-tolerant systems. It also presents a comparative analysis between classical algorithms like Minimum-Weight Perfect Matching (MWPM) and newer, machine learning-based decoder approaches. The discussion section addresses open problems that need to be solved in the future, such as correlated noise, cryogenic control, and the creation of fault-tolerant logical gate sets. This review aims to summarize the current state of the QEC field, serving as a guiding resource for both academics and industry professionals in shaping future research and development strategies.
This review article provides a comprehensive overview of recent developments in the field of quantum error correction (QEC), which stands as one of the biggest challenges for quantum computing. The extreme sensitivity of quantum systems to environmental noise makes it difficult to build reliable and scalable quantum computers. Inspired by pioneering codes like those from Shor and Steane, this work discusses the most promising QEC approaches today, particularly topological codes such as surface codes and low-density parity-check (LDPC) codes. The paper delves into critical experimental successes from industry leaders like Google, IBM, and Quantinuum, including their ”below-threshold” error correction demonstrations and roadmaps for fault-tolerant systems. It also presents a comparative analysis between classical algorithms like Minimum-Weight Perfect Matching (MWPM) and newer, machine learning-based decoder approaches. The discussion section addresses open problems that need to be solved in the future, such as correlated noise, cryogenic control, and the creation of fault-tolerant logical gate sets. This review aims to summarize the current state of the QEC field, serving as a guiding resource for both academics and industry professionals in shaping future research and development strategies.
Quantum Error Correction (QEC) is required in quantum computers to mitigate the effect of errors on physical qubits. When adopting a QEC scheme based on surface codes, error decoding is the most computationally expensive task in the classical electronic back-end. Decoders employing neural networks (NN) are well-suited for this task but their hardware implementation has not been presented yet. This work presents a space exploration of fully-connected feed-forward NN decoders for small distance surface codes. The goal is to optimize the neural network for high decoding performance, while keeping a minimalistic hardware implementation. This is needed to meet the tight delay constraints of real-time surface code decoding. We demonstrate that hardware based NN-decoders can achieve high decoding performance comparable to other state-of-the-art decoding algorithms whilst being well below the tight delay requirements (440 ns) of current solid-state qubit technologies for both ASIC designs (<30 ns) and FPGA implementations (<90 ns). These results indicate that NN-decoders are viable candidates for further exploration of an integrated hardware implementation in future large-scale quantum computers.
Quantum computers have the potential to solve several interesting problems in polynomial \ntime for which no polynomial time classical algorithms have been found. However, \none of the major challenges in building quantum devices is that quantum systems are very \nsensitive to noise arising from undesired interactions with the environment. Noise can lead \nto errors which can corrupt the results of the computation. Quantum error correction is \none way to mitigate the effects of noise arising in quantum devices. \nWith a plethora of quantum error correcting codes that can be used in various settings, \none of the main challenges of quantum error correction is understanding how well various \ncodes perform under more realistic noise models that can be observed in experiments. \nThis thesis proposes a new decoding algorithm which can optimize threshold values of \nerror correcting codes under different noise models. The algorithm can be applied to \nany Markovian noise model. Further, it is shown that for certain noise models, logical \nClifford corrections can further improve a code's threshold value if the code obeys certain \nsymmetries. \n \nSince gates and measurements cannot in general be performed with perfect precision, \nthe operations required to perform quantum error correction can introduce more errors \ninto the system thus negating the benefits of error correction. Fault-tolerant quantum \ncomputing is a way to perform quantum error correction with imperfect operations while \nretaining the ability to suppress errors as long as the noise is below a code's threshold. \nOne of the main challenges in performing fault-tolerant error correction is the high resource \nrequirements that are needed to obtain very low logical noise rates. With the use of \nflag qubits, this thesis develops new fault-tolerant error correction protocols that are applicable \nto arbitrary distance codes. Various code families are shown to satisfy the requirements \nof flag fault-tolerant error correction. We also provide circuits using a constant number of \nqubits for these codes. It is shown that the proposed flag fault-tolerant method uses fewer \nqubits than previous fault-tolerant error correction protocols. \n \nIt is often the case that the noise afflicting a quantum device cannot be fully characterized. \nFurther, even with some knowledge of the noise, it can be very challenging to use \nanalytic decoding methods to improve the performance of a fault-tolerant scheme. This \nthesis presents decoding schemes using several state of the art machine learning techniques \nwith a focus on fault-tolerant quantum error correction in regimes that are relevant to near \nterm experiments. It is shown that even in low noise rate regimes and with no knowledge \nof the noise, noise can be further suppressed for small distance codes. Limitations of machine \nlearning decoders as well as the classical resources required to perform active error \ncorrection are discussed. \n \nIn many cases, gate times can be much shorter than typical measurement times of \nquantum states. Further, classical decoding of the syndrome information used in quantum \nerror correction to compute recovery operators can also be much slower than gate times. \nFor these reasons, schemes where error correction can be implemented in a frame (known \nas the Pauli frame) have been developed to avoid active error correction. In this thesis, we \ngeneralize previous Pauli frame schemes and show how Clifford frame error correction can \nbe implemented with minimal overhead. Clifford frame error correction is necessary if the \nlogical component of recovery operators were chosen from the Clifford group, but could \nalso be used in randomized benchmarking schemes.