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:2210.09730 · ACM Transactions on Quantum Computing

Efficient Syndrome Decoder for Heavy Hexagonal QECC via Machine Learning

Debasmita Bhoumik, Ritajit Majumdar, Dhiraj Madan, Dhinakaran Vinayagamurthy, Shesha Raghunathan, Susmita Sur‐Kolay

Published Dec 16, 2023• 1 citation
arXivHTMLPDF

Abstract

Error syndromes for heavy hexagonal code and other topological codes such as surface code have typically been decoded by using Minimum Weight Perfect Matching– (MWPM) based methods. Recent advances have shown that topological codes can be efficiently decoded by deploying machine learning (ML) techniques, in particular with neural networks. In this work, we first propose an ML-based decoder for heavy hexagonal code and establish its efficiency in terms of the values of threshold and pseudo-threshold for various noise models. We show that the proposed ML-based decoding method achieves ~ 5 × higher values of threshold than that for MWPM. Next, exploiting the property of subsystem codes, we define gauge equivalence for heavy hexagonal code, by which two distinct errors can belong to the same error class. A linear search-based method is proposed for determining the equivalent error classes. This provides a quadratic reduction in the number of error classes to be considered for both bit flip and phase flip errors and thus a further improvement of ~ 14% in the threshold over the basic ML decoder. Last, a novel technique based on rank to determine the equivalent error classes is presented, which is empirically faster than the one based on linear search.

DOI
10.1145/3636516

Related papers

Machine Learning based Decoding of Heavy Hexagonal QECC for Asymmetric Quantum Noise

Debasmita Bhoumik, Ritajit Majumdar, Dhiraj Madan +1 more

Decoding error syndromes for topological quantum error correcting codes, such as surface and heavy hexagonal codes, is computationally expensive. While minimum weight perfect matching (MWPM) algorithms have been commonly used for decoding, recent works have demonstrated the efficacy of machine learning (ML), particularly neural networks, in decoding syndromes for these codes. In this study, we introduce a ML-based decoder tailored to heavy hexagonal code to address asymmetric noise channels which reflect real-world scenario better than the depolarization model considered in previous works. Our proposed decoder shows$\sim 5\times$and$\sim 22\times$improvements in the threshold values for amplitude and amplitude-phase damping noise models respectively over MWPM methods. Our decoder is also robust to changes in asymmetry, with the threshold reducing by only ~ 3.6% for a$10\times$change in asymmetry.

IEEE Computer Society Annual Symposium on VLSI•Jul 1, 2024•0 citations

Convolutional-Neural-Network-Based Hexagonal Quantum Error Correction Decoder

Ao-Qing Li, Fan Li, Qi-Di GAN +1 more

Topological quantum error-correcting codes are an important tool for realizing fault-tolerant quantum computers. Heavy hexagonal coding is a new class of quantum error-correcting coding that assigns physical and auxiliary qubits to the vertices and edges of a low-degree graph. The layout of heavy hexagonal codes is particularly suitable for superconducting qubit architectures to reduce frequency conflicts and crosstalk. Although various topological code decoders have been proposed, constructing the optimal decoder remains challenging. Machine learning is an effective decoding scheme for topological codes, and in this paper, we propose a machine learning heavy hexagonal decoder based on a convolutional neural network (CNN) to obtain the decoding threshold. We test our method on heavy hexagonal codes with code distance of three, five, and seven, and increase it to five, seven, and nine by optimizing the RestNet network architecture. Our results show that the decoder thresholding accuracies are about 0.57% and 0.65%, respectively, which are about 25% higher than the conventional decoding scheme under the depolarizing noise model. The proposed decoding architecture is also applicable to other topological code families.

Applied Sciences•Aug 27, 2023•10 citations

Error-rate-agnostic decoding of topological stabilizer codes

Karl Hammar, Alexei Orekhov, Patrik Wallin Hybelius +4 more

Efficient high-performance decoding of topological stabilizer codes has the potential to crucially improve the balance between logical failure rates and the number and individual error rates of the constituent qubits. High-threshold maximum-likelihood decoders require an explicit error model for Pauli errors to decode a specific syndrome, whereas lower-threshold heuristic approaches such as minimum-weight matching are error agnostic. Here we consider an intermediate approach, formulating a decoder that depends on the bias, i.e., the relative probability of phase-flip to bit-flip errors, but is agnostic to error rate. Our decoder is based on counting the number and effective weight of the most likely error chains in each equivalence class of a given syndrome. We use Metropolis-based Monte Carlo sampling to explore the space of error chains and find unique chains that are efficiently identified using a hash table. Using the error-rate invariance, the decoder can sample chains effectively at an error rate which is higher than the physical error rate and without the need for thermalization between chains in different equivalence classes. Applied to the surface code and the $XZZX$ code, the decoder matches maximum-likelihood decoders for moderate code sizes or low error rates. We anticipate that, because of the compressed information content per syndrome, it can be taken full advantage of in combination with machine-learning methods to extrapolate Monte Carlo--generated data.

arXiv:2112.01977•Physical Review A•Apr 25, 2022•9 citations

Efficient Decoding of Surface Code Syndromes for Error Correction in Quantum Computing

Debasmita Bhoumik, Pinaki Sen, Ritajit Majumdar +3 more

Errors in surface code have typically been decoded by Minimum Weight Perfect Matching (MWPM) based method. Recently, neural-network-based Machine Learning (ML) techniques have been employed for this purpose. Here we propose a two-level (low and high) ML-based decoding scheme, where the first level corrects errors on physical qubits and the second one corrects any existing logical errors, for different noise models. Our results show that our proposed decoding method achieves $\sim10 \times$ and $\sim2 \times$ higher values of pseudo-threshold and threshold respectively, than for MWPM. We show that usage of more sophisticated ML models with higher training/testing time, do not provide significant improvement in the decoder performance. Finally, data generation for training the ML decoder requires significant overhead hence lower volume of training data is desirable. We have shown that our decoder maintains a good performance with the train-test-ratio as low as $40:60$.

arXiv:2110.10896•Oct 21, 2021•4 citations

Neural ensemble decoding for topological quantum error-correcting codes

Milap Sheth, Sara Zafar Jafarzadeh, Vlad Gheorghiu

Topological quantum error-correcting codes are a promising candidate for building fault-tolerant quantum computers. Decoding topological codes optimally, however, is known to be a computationally hard problem. Various decoders have been proposed that achieve approximately optimal error thresholds. Due to practical constraints, it is not known if there exists an obvious choice for a decoder. In this paper, we introduce a framework which can combine arbitrary decoders for any given code to significantly reduce the logical error rates. We rely on the crucial observation that two different decoding techniques, while possibly having similar logical error rates, can perform differently on the same error syndrome. We classify each error syndrome to the decoder which is more likely to decode it correctly using machine learning techniques. We apply our framework to an ensemble of minimum-weight perfect matching (MWPM) and hard-decision re-normalization-group decoders for the surface code in the depolarizing noise model. Our simulations show an improvement of 38.4%, 14.6%, and 7.1% over the pseudothreshold of MWPM in the instance of distance 5, 7, and 9 codes, respectively. Lastly, we discuss the advantages and limitations of our framework and applicability to other error-correcting codes. Our framework can provide a significant boost to error correction by combining the strengths of various decoders. In particular, it may allow for combining very fast decoders with moderate error-correcting capability to create a very fast ensemble decoder with high error-correcting capability.

arXiv:1905.02345•Physical Review A•Mar 23, 2020•25 citations

Resgru: Syndrome decoder for heavy-hexagon quantum error correction code

Ashutosh Kumar, Majid Haghparast, Lauri Kettunen

Abstract Decoding is a central bottleneck in near-term quantum error correction (QEC), where repeated syndrome extraction must be translated into reliable logical outcomes under realistic noise and hardware constraints. We study heavy-hexagon (HH) quantum memory experiments and propose Resgru , a lightweight recurrent neural decoder that maps time-ordered detection events to a binary logical-class prediction for each shot. We benchmark Resgru against a standard minimum-weight perfect matching (MWPM) decoder instantiated on the same detector error model for HH code at code distances d ∈ { 3 , 5 , 7 } under circuit-level depolarizing noise with physical error rate p = 0.1 % . Resgru consistently achieved higher logical fidelity than MWPM decoder and yields lower per-round logical error rates, including a 28% reduction for d = 5 and a 14% reduction for d = 7 . Despite being trained only on short sequences, Resgru maintains an advantage when evaluated on longer simulated memory experiments up to 300 QEC rounds.

Physica Scripta•Jul 8, 2026•1 citation
Error syndromes for heavy hexagonal code and other topological codes such as surface code have typically been decoded by using Minimum Weight Perfect Matching– (MWPM) based methods. Recent advances have shown that topological codes can be efficiently decoded by deploying machine learning (ML) techniques, in particular with neural networks. In this work, we first propose an ML-based decoder for heavy hexagonal code and establish its efficiency in terms of the values of threshold and pseudo-threshold for various noise models. We show that the proposed ML-based decoding method achieves ~ 5 × higher values of threshold than that for MWPM. Next, exploiting the property of subsystem codes, we define gauge equivalence for heavy hexagonal code, by which two distinct errors can belong to the same error class. A linear search-based method is proposed for determining the equivalent error classes. This provides a quadratic reduction in the number of error classes to be considered for both bit flip and phase flip errors and thus a further improvement of ~ 14% in the threshold over the basic ML decoder. Last, a novel technique based on rank to determine the equivalent error classes is presented, which is empirically faster than the one based on linear search.
Decoding error syndromes for topological quantum error correcting codes, such as surface and heavy hexagonal codes, is computationally expensive. While minimum weight perfect matching (MWPM) algorithms have been commonly used for decoding, recent works have demonstrated the efficacy of machine learning (ML), particularly neural networks, in decoding syndromes for these codes. In this study, we introduce a ML-based decoder tailored to heavy hexagonal code to address asymmetric noise channels which reflect real-world scenario better than the depolarization model considered in previous works. Our proposed decoder shows∼5×\sim 5\times∼5×and∼22×\sim 22\times∼22×improvements in the threshold values for amplitude and amplitude-phase damping noise models respectively over MWPM methods. Our decoder is also robust to changes in asymmetry, with the threshold reducing by only ~ 3.6% for a10×10\times10×change in asymmetry.
Topological quantum error-correcting codes are an important tool for realizing fault-tolerant quantum computers. Heavy hexagonal coding is a new class of quantum error-correcting coding that assigns physical and auxiliary qubits to the vertices and edges of a low-degree graph. The layout of heavy hexagonal codes is particularly suitable for superconducting qubit architectures to reduce frequency conflicts and crosstalk. Although various topological code decoders have been proposed, constructing the optimal decoder remains challenging. Machine learning is an effective decoding scheme for topological codes, and in this paper, we propose a machine learning heavy hexagonal decoder based on a convolutional neural network (CNN) to obtain the decoding threshold. We test our method on heavy hexagonal codes with code distance of three, five, and seven, and increase it to five, seven, and nine by optimizing the RestNet network architecture. Our results show that the decoder thresholding accuracies are about 0.57% and 0.65%, respectively, which are about 25% higher than the conventional decoding scheme under the depolarizing noise model. The proposed decoding architecture is also applicable to other topological code families.
Efficient high-performance decoding of topological stabilizer codes has the potential to crucially improve the balance between logical failure rates and the number and individual error rates of the constituent qubits. High-threshold maximum-likelihood decoders require an explicit error model for Pauli errors to decode a specific syndrome, whereas lower-threshold heuristic approaches such as minimum-weight matching are error agnostic. Here we consider an intermediate approach, formulating a decoder that depends on the bias, i.e., the relative probability of phase-flip to bit-flip errors, but is agnostic to error rate. Our decoder is based on counting the number and effective weight of the most likely error chains in each equivalence class of a given syndrome. We use Metropolis-based Monte Carlo sampling to explore the space of error chains and find unique chains that are efficiently identified using a hash table. Using the error-rate invariance, the decoder can sample chains effectively at an error rate which is higher than the physical error rate and without the need for thermalization between chains in different equivalence classes. Applied to the surface code and the XZZXXZZXXZZX code, the decoder matches maximum-likelihood decoders for moderate code sizes or low error rates. We anticipate that, because of the compressed information content per syndrome, it can be taken full advantage of in combination with machine-learning methods to extrapolate Monte Carlo--generated data.
Errors in surface code have typically been decoded by Minimum Weight Perfect Matching (MWPM) based method. Recently, neural-network-based Machine Learning (ML) techniques have been employed for this purpose. Here we propose a two-level (low and high) ML-based decoding scheme, where the first level corrects errors on physical qubits and the second one corrects any existing logical errors, for different noise models. Our results show that our proposed decoding method achieves ∼10×\sim10 \times∼10× and ∼2×\sim2 \times∼2× higher values of pseudo-threshold and threshold respectively, than for MWPM. We show that usage of more sophisticated ML models with higher training/testing time, do not provide significant improvement in the decoder performance. Finally, data generation for training the ML decoder requires significant overhead hence lower volume of training data is desirable. We have shown that our decoder maintains a good performance with the train-test-ratio as low as 40:6040:6040:60.
Topological quantum error-correcting codes are a promising candidate for building fault-tolerant quantum computers. Decoding topological codes optimally, however, is known to be a computationally hard problem. Various decoders have been proposed that achieve approximately optimal error thresholds. Due to practical constraints, it is not known if there exists an obvious choice for a decoder. In this paper, we introduce a framework which can combine arbitrary decoders for any given code to significantly reduce the logical error rates. We rely on the crucial observation that two different decoding techniques, while possibly having similar logical error rates, can perform differently on the same error syndrome. We classify each error syndrome to the decoder which is more likely to decode it correctly using machine learning techniques. We apply our framework to an ensemble of minimum-weight perfect matching (MWPM) and hard-decision re-normalization-group decoders for the surface code in the depolarizing noise model. Our simulations show an improvement of 38.4%, 14.6%, and 7.1% over the pseudothreshold of MWPM in the instance of distance 5, 7, and 9 codes, respectively. Lastly, we discuss the advantages and limitations of our framework and applicability to other error-correcting codes. Our framework can provide a significant boost to error correction by combining the strengths of various decoders. In particular, it may allow for combining very fast decoders with moderate error-correcting capability to create a very fast ensemble decoder with high error-correcting capability.
Abstract Decoding is a central bottleneck in near-term quantum error correction (QEC), where repeated syndrome extraction must be translated into reliable logical outcomes under realistic noise and hardware constraints. We study heavy-hexagon (HH) quantum memory experiments and propose Resgru , a lightweight recurrent neural decoder that maps time-ordered detection events to a binary logical-class prediction for each shot. We benchmark Resgru against a standard minimum-weight perfect matching (MWPM) decoder instantiated on the same detector error model for HH code at code distances d ∈ { 3 , 5 , 7 } under circuit-level depolarizing noise with physical error rate p = 0.1 % . Resgru consistently achieved higher logical fidelity than MWPM decoder and yields lower per-round logical error rates, including a 28% reduction for d = 5 and a 14% reduction for d = 7 . Despite being trained only on short sequences, Resgru maintains an advantage when evaluated on longer simulated memory experiments up to 300 QEC rounds.