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:2206.03122 · PRX Quantum

Improved Single-Shot Decoding of Higher-Dimensional Hypergraph-Product Codes

Oscar Higgott, Nikolas P. Breuckmann

Published May 30, 2023• 51 citations
arXivHTMLPDF

Abstract

In this work, we study the single-shot performance of higher-dimensional hypergraph product codes decoded using belief propagation and ordered-statistics decoding [P.Panteleev and G. Kalachev, Quantum 5, 585 (2021)].We find that decoding data-qubit and syndrome-measurement errors together in a single stage leads to single-shot thresholds that greatly exceed all previously observed single-shot thresholds for these codes.For the three-dimensional toric code and a phenomenological noise model, our results are consistent with a sustainable threshold of 7.1% for Z errors, compared to the threshold of 2.90% previously found using a two-stage decoder [Quintavalle et al., 2021].For the four-dimensional (4D) toric code, for which both X and Z error correction is single shot, our results are consistent with a sustainable single-shot threshold of 4.3%, which is even higher than the threshold of 2.93% for the two-dimensional toric code for the same noise model but using L rounds of stabilizer measurement.We also explore the performance of balanced-product and 4D hypergraph-product codes, which we show lead to a reduction in qubit overhead compared the surface code for phenomenological error rates as high as 1%.

DOI
10.1103/prxquantum.4.020332

Related papers

Improved energy barrier in higher-dimensional hypergraph product codes

Guangqi Zhao

Single-shot error correction outperforms conventional approaches by requiring only one round of stabilizer measurements for decoding, even in the presence of measurement errors. This capability relates to the confinement property of codes, which provides an energy barrier lower bound. Earlier research established a confinement property for higher-dimensional hypergraph product (HHGP) codes (Quintavalle et al. 2021 PRX Quantum), yielding an energy barrier lower bound for these codes. In this work, by analyzing the structure of logical operators, we show an improved energy barrier lower bound for HHGP codes with low-density parity-check (LDPC) property. Our bound exceeds results derived from confinement alone, and unlike standard hypergraph product codes, these higher dimensional variants can possess macroscopic energy barriers even when the underlying classical codes lack this property. Specifically, our analysis shows that the energy barrier of LDPC HHGP codes is lower bounded by the distance of the underlying classical codes. This bound is tight if the underlying classical codes exhibit system size-dependent distances but constant energy barriers, like 3D and 4D toric codes.

arXiv:2506.19219•Physical Review A•Nov 25, 2025•1 citation

Generalized Quantum Data-Syndrome Codes and Belief Propagation Decoding for Phenomenological Noise

Kao-Yueh Kuo, Ching–Yi Lai

Quantum stabilizer codes often struggle with syndrome errors due to measurement imperfections. Typically, multiple rounds of syndrome extraction are employed to ensure reliable error information. In this paper, we consider phenomenological decoding problems, where data qubit errors may occur between extractions, and each measurement can be faulty. We introduce generalized quantum data-syndrome codes along with a generalized check matrix that integrates both quaternary and binary alphabets to represent diverse error sources. This results in a Tanner graph with mixed variable nodes, enabling the design of belief propagation (BP) decoding algorithms that effectively handle phenomenological errors. Importantly, our BP decoders are applicable to general sparse quantum codes. Through simulations, we achieve an error threshold of more than 3% for quantum memory protected by rotated toric codes, using solely BP without post-processing. Our results indicate that d rounds of syndrome extraction are sufficient for a toric code of distance d. We observe that at high error rates, fewer rounds of syndrome extraction tend to perform better, while more rounds improve performance at lower error rates. Additionally, we propose a method to construct effective redundant stabilizer checks for single-shot error correction. Our simulations show that BP decoding remains highly effective even with a high syndrome error rate.

arXiv:2310.12682•IEEE Transactions on Information Theory•Jan 14, 2025•6 citations

Single-shot error correction on toric codes with high-weight stabilizers

Yingjia Lin, Shilin Huang, Kenneth R. Brown

For quantum error correction codes the required number of measurement rounds typically increases with the code distance when measurements are faulty. Single-shot error correction allows for an error threshold with only one round of noisy syndrome measurements regardless of the code size. Here we implement single-shot check operators for toric codes. The single-shot checks are constructed by Gaussian elimination following Campbell [Campbell, Quantum Sci. Technol. 4, 025006 (2019)]. The single-shot check operators result in a sustainable threshold at 5.62% for an error model with noisy measurements, outperforming the conventional toric code-check operators with multiple rounds of noisy measurement. The cost of the transformation is nonlocal high-weight stabilizer generators. We then consider a gate-based error model that leads to increased measurement error with stabilizer weight. Here we find no single-shot threshold behavior and instead find the code family will have an optimal code size for a fixed error rate. For this error model the conventional check operators with multiple measurements yields a lower logical error rate.

arXiv:2310.16160•Physical Review A•May 29, 2024•7 citations

Decoding across the quantum low-density parity-check code landscape

Joschka Roffe, David R. White, Simon Burton +1 more

We show that belief propagation combined with ordered statistics post-processing is a general decoder for quantum low-density parity-check codes constructed from the hypergraph product.To this end, we run numerical simulations of the decoder applied to three families of hypergraph product code: topological codes, fixed-rate random codes, and a new class of codes that we call semitopological codes.Our new code families share properties of both topological and random hypergraph product codes, with a construction that allows for a finely controlled trade-off between code threshold and stabilizer locality.Our results indicate thresholds across all three families of hypergraph product code, and provide evidence of exponential suppression in the low error regime.For the toric code, we observe a threshold in the range 9.9% ± 0.2%.This result improves upon previous quantum decoders based on belief propagation, and approaches the performance of the minimum-weight perfectmatching algorithm.We expect semitopological codes to have the same threshold as toric codes, as they are identical in the bulk, and we present numerical evidence supporting this observation.

arXiv:2005.07016•Physical Review Research•Dec 28, 2020•290 citations

Combining hard and soft decoders for hypergraph product codes

Antoine Grospellier, Lucien Grouès, Anirudh Krishna +1 more

Hypergraph product codes are a class of constant-rate quantum low-density parity-check (LDPC) codes equipped with a linear-time decoder called small-set-flip (SSF). This decoder displays sub-optimal performance in practice and requires very large error correcting codes to be effective. In this work, we present new hybrid decoders that combine the belief propagation (BP) algorithm with the SSF decoder. We present the results of numerical simulations when codes are subject to independent bit-flip and phase-flip errors. We provide evidence that the threshold of these codes is roughly 7.5% assuming an ideal syndrome extraction, and remains close to 3% in the presence of syndrome noise. This result subsumes and significantly improves upon an earlier work by Grospellier and Krishna (arXiv:1810.03681). The low-complexity high-performance of these heuristic decoders suggests that decoding should not be a substantial difficulty when moving from zero-rate surface codes to constant-rate LDPC codes and gives a further hint that such codes are well-worth investigating in the context of building large universal quantum computers.

arXiv:2004.11199•Quantum•Apr 15, 2021•65 citations

Single-Shot Decoding of Biased-Tailored Quantum LDPC Codes

Devon Campbell

Quantum processors often exhibit biased noise (dominant$Z$errors) and noisy readout, both of which degrade reliability and reproducibility. This work unifies two complementary strategies: bias tailoring, which realigns stabilizers to the dominant error basis, and single-shot (SS) decoding, which leverages metachecks to identify measurement faults from a single noisy round. We instantiate this in a four-dimensional lifted hypergraph-product (4D-LHP) LDPC code built from quasi-cyclic protograph seeds. Simulations show that tailoring reduces word-error rate (WER) by 20-60% across realistic$Z: X$bias ratios (1:1 to 103:1), with the largest gains at moderate bias. Under realistic$q=4 \%$measurement noise, a single SS round recovers$\sim 33 \%$of the performance lost to readout faults; metachecks detect > 99.8% of faulty syndromes, ffering near-complete fault visibility despite modest correction capability. These results indicate that 4D-LHP codes offer practical resilience under realistic noise, making them well-suited for integration into orchestrated QPU-CPU workflows.

arXiv:2509.06316•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•0 citations
In this work, we study the single-shot performance of higher-dimensional hypergraph product codes decoded using belief propagation and ordered-statistics decoding [P.Panteleev and G. Kalachev, Quantum 5, 585 (2021)].We find that decoding data-qubit and syndrome-measurement errors together in a single stage leads to single-shot thresholds that greatly exceed all previously observed single-shot thresholds for these codes.For the three-dimensional toric code and a phenomenological noise model, our results are consistent with a sustainable threshold of 7.1% for Z errors, compared to the threshold of 2.90% previously found using a two-stage decoder [Quintavalle et al., 2021].For the four-dimensional (4D) toric code, for which both X and Z error correction is single shot, our results are consistent with a sustainable single-shot threshold of 4.3%, which is even higher than the threshold of 2.93% for the two-dimensional toric code for the same noise model but using L rounds of stabilizer measurement.We also explore the performance of balanced-product and 4D hypergraph-product codes, which we show lead to a reduction in qubit overhead compared the surface code for phenomenological error rates as high as 1%.
Single-shot error correction outperforms conventional approaches by requiring only one round of stabilizer measurements for decoding, even in the presence of measurement errors. This capability relates to the confinement property of codes, which provides an energy barrier lower bound. Earlier research established a confinement property for higher-dimensional hypergraph product (HHGP) codes (Quintavalle et al. 2021 PRX Quantum), yielding an energy barrier lower bound for these codes. In this work, by analyzing the structure of logical operators, we show an improved energy barrier lower bound for HHGP codes with low-density parity-check (LDPC) property. Our bound exceeds results derived from confinement alone, and unlike standard hypergraph product codes, these higher dimensional variants can possess macroscopic energy barriers even when the underlying classical codes lack this property. Specifically, our analysis shows that the energy barrier of LDPC HHGP codes is lower bounded by the distance of the underlying classical codes. This bound is tight if the underlying classical codes exhibit system size-dependent distances but constant energy barriers, like 3D and 4D toric codes.
Quantum stabilizer codes often struggle with syndrome errors due to measurement imperfections. Typically, multiple rounds of syndrome extraction are employed to ensure reliable error information. In this paper, we consider phenomenological decoding problems, where data qubit errors may occur between extractions, and each measurement can be faulty. We introduce generalized quantum data-syndrome codes along with a generalized check matrix that integrates both quaternary and binary alphabets to represent diverse error sources. This results in a Tanner graph with mixed variable nodes, enabling the design of belief propagation (BP) decoding algorithms that effectively handle phenomenological errors. Importantly, our BP decoders are applicable to general sparse quantum codes. Through simulations, we achieve an error threshold of more than 3% for quantum memory protected by rotated toric codes, using solely BP without post-processing. Our results indicate that d rounds of syndrome extraction are sufficient for a toric code of distance d. We observe that at high error rates, fewer rounds of syndrome extraction tend to perform better, while more rounds improve performance at lower error rates. Additionally, we propose a method to construct effective redundant stabilizer checks for single-shot error correction. Our simulations show that BP decoding remains highly effective even with a high syndrome error rate.
For quantum error correction codes the required number of measurement rounds typically increases with the code distance when measurements are faulty. Single-shot error correction allows for an error threshold with only one round of noisy syndrome measurements regardless of the code size. Here we implement single-shot check operators for toric codes. The single-shot checks are constructed by Gaussian elimination following Campbell [Campbell, Quantum Sci. Technol. 4, 025006 (2019)]. The single-shot check operators result in a sustainable threshold at 5.62% for an error model with noisy measurements, outperforming the conventional toric code-check operators with multiple rounds of noisy measurement. The cost of the transformation is nonlocal high-weight stabilizer generators. We then consider a gate-based error model that leads to increased measurement error with stabilizer weight. Here we find no single-shot threshold behavior and instead find the code family will have an optimal code size for a fixed error rate. For this error model the conventional check operators with multiple measurements yields a lower logical error rate.
We show that belief propagation combined with ordered statistics post-processing is a general decoder for quantum low-density parity-check codes constructed from the hypergraph product.To this end, we run numerical simulations of the decoder applied to three families of hypergraph product code: topological codes, fixed-rate random codes, and a new class of codes that we call semitopological codes.Our new code families share properties of both topological and random hypergraph product codes, with a construction that allows for a finely controlled trade-off between code threshold and stabilizer locality.Our results indicate thresholds across all three families of hypergraph product code, and provide evidence of exponential suppression in the low error regime.For the toric code, we observe a threshold in the range 9.9% ± 0.2%.This result improves upon previous quantum decoders based on belief propagation, and approaches the performance of the minimum-weight perfectmatching algorithm.We expect semitopological codes to have the same threshold as toric codes, as they are identical in the bulk, and we present numerical evidence supporting this observation.
Hypergraph product codes are a class of constant-rate quantum low-density parity-check (LDPC) codes equipped with a linear-time decoder called small-set-flip (SSF). This decoder displays sub-optimal performance in practice and requires very large error correcting codes to be effective. In this work, we present new hybrid decoders that combine the belief propagation (BP) algorithm with the SSF decoder. We present the results of numerical simulations when codes are subject to independent bit-flip and phase-flip errors. We provide evidence that the threshold of these codes is roughly 7.5% assuming an ideal syndrome extraction, and remains close to 3% in the presence of syndrome noise. This result subsumes and significantly improves upon an earlier work by Grospellier and Krishna (arXiv:1810.03681). The low-complexity high-performance of these heuristic decoders suggests that decoding should not be a substantial difficulty when moving from zero-rate surface codes to constant-rate LDPC codes and gives a further hint that such codes are well-worth investigating in the context of building large universal quantum computers.
Quantum processors often exhibit biased noise (dominantZZZerrors) and noisy readout, both of which degrade reliability and reproducibility. This work unifies two complementary strategies: bias tailoring, which realigns stabilizers to the dominant error basis, and single-shot (SS) decoding, which leverages metachecks to identify measurement faults from a single noisy round. We instantiate this in a four-dimensional lifted hypergraph-product (4D-LHP) LDPC code built from quasi-cyclic protograph seeds. Simulations show that tailoring reduces word-error rate (WER) by 20-60% across realisticZ:XZ: XZ:Xbias ratios (1:1 to 103:1), with the largest gains at moderate bias. Under realisticq=4%q=4 \%q=4%measurement noise, a single SS round recovers∼33%\sim 33 \%∼33%of the performance lost to readout faults; metachecks detect > 99.8% of faulty syndromes, ffering near-complete fault visibility despite modest correction capability. These results indicate that 4D-LHP codes offer practical resilience under realistic noise, making them well-suited for integration into orchestrated QPU-CPU workflows.