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:1912.09635 · IEEE Transactions on Quantum Engineering

Decoding Quantum Error Correction Codes With Local Variation

Michael Hanks, William J. Munro, Kae Nemoto

Published Jan 1, 2020• 2 citations
arXivHTMLPDF

Abstract

In this article, we investigate the role of local information in the decoding of the repetition and surface error correction codes for the protection of quantum states. Our key result is an improvement in resource efficiency when local information is taken into account during the decoding process: the code distance associated with a given logical error rate is reduced with a magnitude depending on the proximity of the physical error rate to the accuracy threshold of the code. We also briefly discuss an averaged approach with local information for table lookup and localized decoding schemes, an expected breakdown of these effects for large-scale systems, and the importance of this resource reduction in the near term.

DOI
10.1109/tqe.2020.2967890

Related papers

Reducing quantum error correction overhead using soft information

Joonas Majaniemi, Elisha S. Matekole

Abstract Imperfect measurements are a prevalent source of error across quantum computing platforms, significantly degrading the logical error rates achievable on current hardware. To mitigate this issue, rich measurement data referred to as soft information has been proposed to efficiently identify and correct measurement errors as they occur. In this work, we model soft information decoding across a variety of physical qubit platforms and decoders and showcase how soft information can make error correction viable at lower code distances and higher physical error rates than is otherwise possible. We simulate the effects of soft information decoding on quantum memories for surface codes and bivariate bicycle codes, and evaluate the error suppression performance of soft decoders against traditional decoders. Our simulations show that soft information decoding on near-term devices can provide up to 11% higher error suppression on superconducting qubits and up to 20% stronger error suppression on neutral atom qubits. These accuracy gains correspond to 13% and 33% reductions in the physical qubit footprint of superconducting and neutral atom devices respectively when operating at a logical error rate of 10 −6 , showcasing that soft information is a powerful tool for reducing the cost and complexity of large-scale fault-tolerant quantum computers.

arXiv:2504.03504•Quantum Science and Technology•Mar 6, 2026•5 citations

Mitigating errors in logical qubits

Samuel C. Smith, Benjamin J. Brown, Stephen D. Bartlett

Quantum error correcting codes can enable large quantum computations provided physical error rates are sufficiently low. We combine post-selection with surface code error correction through the use of exclusive decoders, which abort on decoding instances that are deemed too difficult. For the most discriminating of exclusive decoders, we demonstrate a threshold of 50% under depolarizing noise (or 32(1)% for the fault-tolerant case), and up to a quadratic improvement in logical failure rates below threshold. Furthermore, with a modest exclusion criterion, we identify a regime at low error rates where the exclusion rate decays with code distance, providing a pathway for scalable and time-efficient quantum computing with post-selection. Our exclusive decoder applied to magic state distillation yields a 75% reduction in the number of physical qubits, and a 60% reduction in the total spacetime volume, including accounting for repetitions. Other applications include error mitigation, and in concatenated schemes. Quantum error correction produces an enormous amount of data about the quantum system, including information about whether an uncorrectable error is likely. In this work the authors analyse a new decoder that can abort when decoding is deemed too difficult, yielding improved performance overall.

arXiv:2405.03766•Communications Physics•Nov 28, 2024•25 citations

Quantum error correction with the surface code

Alexander M. Dalzell, Sam McArdle, Mario Berta +10 more

This chapter provides an overview of how to perform quantum error correction using the surface code, which is the most well-studied quantum error correcting code for practical quantum computation. We provide formulas for the code distance—which determines the resource overhead when using the surface code—as a function of the desired logical error rate and underlying physical error rate. We discuss several decoders for the surface code and the possibility of experiencing the backlog problem if the decoder is too slow.

Cambridge University Press eBooks•Apr 24, 2025•0 citations

Local Predecoder to Reduce the Bandwidth and Latency of Quantum Error Correction

Samuel C. Smith, Benjamin J. Brown, Stephen D. Bartlett

A fault-tolerant quantum computer will be supported by a classical decoding system interfacing with quantum hardware to perform quantum error correction. It is important that the decoder can keep pace with the quantum clock speed, within the limitations on communication that are imposed by the physical architecture. To this end, we propose a local ``predecoder,'' which makes greedy corrections to reduce the amount of syndrome data sent to a standard matching decoder. We study these classical overheads for the surface code under a phenomenological phase-flip noise model with imperfect measurements. We find substantial improvements in the run time of the global decoder and the communication bandwidth by using the predecoder. For instance, to achieve a logical-failure probability of $f={10}^{\ensuremath{-}15}$ using qubits with physical error rate $p={10}^{\ensuremath{-}3}$ and a distance $d=22$ code, we find that the bandwidth cost is reduced by a factor of 1000 and that the time taken by a matching decoder is sped up by a factor of 200. To achieve this target failure probability, the predecoding approach requires a 50% increase in the qubit count compared with the optimal decoder.

arXiv:2208.04660•Physical Review Applied•Mar 15, 2023•44 citations

Enhancing Surface Code Decoding with Adaptive Machine Learning–Based Quantum Error Correction

A Hussain, Priyanka Rani, Jayapal Lande +3 more

Quantum error correction is still an important hurdle for building fault-tolerant quantum computer. We proposed an adaptive quantum error correction (AQEC) framework that combines machine learning and traditional syndrome pairing approaches to improve error detection and correction efficiency. Our hybrid architecture combines surface codes with neural network-based syndrome decoders that learn optimal strategies for decoding in the presence of varying error rates. Our experimental results show a 23.7% improvement in logical error rate suppression over conventional lookup-table decoders at the same decoding latency, with 35% reduced decoding latency. Achieving a threshold error rate of $1.2 \%$, the proposed model allows for practical quantum computing applications using contemporary noisy intermediate-scale quantum (NISQ) devices This work connects theoretical error correction schemes with practical limitations on implementations in quantum systems.

International Conference on Advancements in Smart, Secure and Intelligent Computing (ASSIC)•Aug 1, 2026•0 citations

Suppressing quantum errors by scaling a surface code logical qubit

Google Quantum AI, Rajeev Acharya, I. L. Aleǐner +97 more

Abstract Practical quantum computing will require error rates well below those achievable with physical qubits. Quantum error correction 1,2 offers a path to algorithmically relevant error rates by encoding logical qubits within many physical qubits, for which increasing the number of physical qubits enhances protection against physical errors. However, introducing more qubits also increases the number of error sources, so the density of errors must be sufficiently low for logical performance to improve with increasing code size. Here we report the measurement of logical qubit performance scaling across several code sizes, and demonstrate that our system of superconducting qubits has sufficient performance to overcome the additional errors from increasing qubit number. We find that our distance-5 surface code logical qubit modestly outperforms an ensemble of distance-3 logical qubits on average, in terms of both logical error probability over 25 cycles and logical error per cycle ((2.914 ± 0.016)% compared to (3.028 ± 0.023)%). To investigate damaging, low-probability error sources, we run a distance-25 repetition code and observe a 1.7 × 10 −6 logical error per cycle floor set by a single high-energy event (1.6 × 10 −7 excluding this event). We accurately model our experiment, extracting error budgets that highlight the biggest challenges for future systems. These results mark an experimental demonstration in which quantum error correction begins to improve performance with increasing qubit number, illuminating the path to reaching the logical error rates required for computation.

arXiv:2207.06431•Nature•Feb 22, 2023•1,354 citations
In this article, we investigate the role of local information in the decoding of the repetition and surface error correction codes for the protection of quantum states. Our key result is an improvement in resource efficiency when local information is taken into account during the decoding process: the code distance associated with a given logical error rate is reduced with a magnitude depending on the proximity of the physical error rate to the accuracy threshold of the code. We also briefly discuss an averaged approach with local information for table lookup and localized decoding schemes, an expected breakdown of these effects for large-scale systems, and the importance of this resource reduction in the near term.
Abstract Imperfect measurements are a prevalent source of error across quantum computing platforms, significantly degrading the logical error rates achievable on current hardware. To mitigate this issue, rich measurement data referred to as soft information has been proposed to efficiently identify and correct measurement errors as they occur. In this work, we model soft information decoding across a variety of physical qubit platforms and decoders and showcase how soft information can make error correction viable at lower code distances and higher physical error rates than is otherwise possible. We simulate the effects of soft information decoding on quantum memories for surface codes and bivariate bicycle codes, and evaluate the error suppression performance of soft decoders against traditional decoders. Our simulations show that soft information decoding on near-term devices can provide up to 11% higher error suppression on superconducting qubits and up to 20% stronger error suppression on neutral atom qubits. These accuracy gains correspond to 13% and 33% reductions in the physical qubit footprint of superconducting and neutral atom devices respectively when operating at a logical error rate of 10 −6 , showcasing that soft information is a powerful tool for reducing the cost and complexity of large-scale fault-tolerant quantum computers.
Quantum error correcting codes can enable large quantum computations provided physical error rates are sufficiently low. We combine post-selection with surface code error correction through the use of exclusive decoders, which abort on decoding instances that are deemed too difficult. For the most discriminating of exclusive decoders, we demonstrate a threshold of 50% under depolarizing noise (or 32(1)% for the fault-tolerant case), and up to a quadratic improvement in logical failure rates below threshold. Furthermore, with a modest exclusion criterion, we identify a regime at low error rates where the exclusion rate decays with code distance, providing a pathway for scalable and time-efficient quantum computing with post-selection. Our exclusive decoder applied to magic state distillation yields a 75% reduction in the number of physical qubits, and a 60% reduction in the total spacetime volume, including accounting for repetitions. Other applications include error mitigation, and in concatenated schemes. Quantum error correction produces an enormous amount of data about the quantum system, including information about whether an uncorrectable error is likely. In this work the authors analyse a new decoder that can abort when decoding is deemed too difficult, yielding improved performance overall.
This chapter provides an overview of how to perform quantum error correction using the surface code, which is the most well-studied quantum error correcting code for practical quantum computation. We provide formulas for the code distance—which determines the resource overhead when using the surface code—as a function of the desired logical error rate and underlying physical error rate. We discuss several decoders for the surface code and the possibility of experiencing the backlog problem if the decoder is too slow.
A fault-tolerant quantum computer will be supported by a classical decoding system interfacing with quantum hardware to perform quantum error correction. It is important that the decoder can keep pace with the quantum clock speed, within the limitations on communication that are imposed by the physical architecture. To this end, we propose a local ``predecoder,'' which makes greedy corrections to reduce the amount of syndrome data sent to a standard matching decoder. We study these classical overheads for the surface code under a phenomenological phase-flip noise model with imperfect measurements. We find substantial improvements in the run time of the global decoder and the communication bandwidth by using the predecoder. For instance, to achieve a logical-failure probability of $f={10}^{\ensuremath{-}15}$ using qubits with physical error rate $p={10}^{\ensuremath{-}3}$ and a distance d=22d=22d=22 code, we find that the bandwidth cost is reduced by a factor of 1000 and that the time taken by a matching decoder is sped up by a factor of 200. To achieve this target failure probability, the predecoding approach requires a 50% increase in the qubit count compared with the optimal decoder.
Quantum error correction is still an important hurdle for building fault-tolerant quantum computer. We proposed an adaptive quantum error correction (AQEC) framework that combines machine learning and traditional syndrome pairing approaches to improve error detection and correction efficiency. Our hybrid architecture combines surface codes with neural network-based syndrome decoders that learn optimal strategies for decoding in the presence of varying error rates. Our experimental results show a 23.7% improvement in logical error rate suppression over conventional lookup-table decoders at the same decoding latency, with 35% reduced decoding latency. Achieving a threshold error rate of 1.2%1.2 \%1.2%, the proposed model allows for practical quantum computing applications using contemporary noisy intermediate-scale quantum (NISQ) devices This work connects theoretical error correction schemes with practical limitations on implementations in quantum systems.
Abstract Practical quantum computing will require error rates well below those achievable with physical qubits. Quantum error correction 1,2 offers a path to algorithmically relevant error rates by encoding logical qubits within many physical qubits, for which increasing the number of physical qubits enhances protection against physical errors. However, introducing more qubits also increases the number of error sources, so the density of errors must be sufficiently low for logical performance to improve with increasing code size. Here we report the measurement of logical qubit performance scaling across several code sizes, and demonstrate that our system of superconducting qubits has sufficient performance to overcome the additional errors from increasing qubit number. We find that our distance-5 surface code logical qubit modestly outperforms an ensemble of distance-3 logical qubits on average, in terms of both logical error probability over 25 cycles and logical error per cycle ((2.914 ± 0.016)% compared to (3.028 ± 0.023)%). To investigate damaging, low-probability error sources, we run a distance-25 repetition code and observe a 1.7 × 10 −6 logical error per cycle floor set by a single high-energy event (1.6 × 10 −7 excluding this event). We accurately model our experiment, extracting error budgets that highlight the biggest challenges for future systems. These results mark an experimental demonstration in which quantum error correction begins to improve performance with increasing qubit number, illuminating the path to reaching the logical error rates required for computation.