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:2609.25251

Exploring Asymmetric QEC Code Concatenation

Sayam Sethi, Maxwell Poster, Aditi Awasthi, Willers Yang, Joshua Viszlai, Jonathan Mark Baker

quant-phSubmitted Sep 21, 2026• Announced Sep 23, 2026• 1 citation
arXivHTMLPDF

Abstract

Concatenated quantum error-correcting codes have recently gained popularity because they improve the effective distance of a joint code without requiring the discovery of new codes with desirable parameters. A common building block for such studies is the $[[4,1,2]]$ Iceberg code, the smallest error-detecting code and therefore the one with the lowest resource overhead. However, it has an asymmetric number of $X$ and $Z$ checks, and concatenating it produces skewed logical error rates (LERs) between the $X$ and $Z$ observables. This asymmetry can be mitigated by Clifford-deforming the individual blocks of the concatenation, but the space of possible Hadamard deformations grows doubly exponentially with the number of concatenation levels. We formalize this deformation space and investigate it by proposing six concrete deformation strategies, which we compare under a code capacity (with and without bias) noise model using a concatenated maximum-likelihood soft-information decoder. Among the strategies we study, one one of them achieves near-identical $X$ and $Z$ LERs in a logical-memory experiment while simultaneously reducing the total LER (the sum of the $X$ and $Z$ error rates).

AI Summary

The paper asks how blockwise Hadamard deformations can balance logical $X$- and $Z$-error rates in concatenated $[[4,1,2]]$ Iceberg codes. Although the constituent code has equal $X$ and $Z$ distances, its unequal numbers of $X$- and $Z$-type checks produce asymmetric soft information during concatenated decoding. It counts deformation assignments on the concatenation tree: each four-qubit block has $16$ Hadamard choices, giving $c_l=c_{l-1}^4\,16=2^{4(4^l-1)/3}$ assignments at level $l$. Rather than search this space exhaustively, it compares six fixed strategies, including uniform deformations and patterns alternating across levels or between blocks within a level. Logical-memory simulations cover one through four concatenation levels using a level-by-level maximum-likelihood soft-information decoder and $500{,}000$ Monte Carlo shots. Tests use code-capacity depolarizing noise and $X$- or $Z$-biased Pauli noise, with probabilities $0.8p$ for the dominant Pauli and $0.1p$ for each other Pauli. The undeformed construction exhibits a logical $Z$-error rate up to $60$ times its logical $X$-error rate at four levels. Among the tested strategies, alternating complementary mixed Hadamard patterns between blocks within each level gives near-equal $X$ and $Z$ logical-error rates and lowers their sum; it also remains the most balanced under the tested biased channels. The conclusions concern these six patterns and simulated noise settings, not an optimized deformation over the full space. Selecting robust deformations for arbitrary concatenation levels and error models is left for further work.

Some signs of AI-generated textIncrementalStrong assumptionsUnclear writingPossible error

Central claim may not hold: The displayed decoding rule selects an individual correction using syndrome-flip marginal weights and does not specify the stabilizer-coset probability sums required to establish the claimed logical maximum-likelihood decoding. The supplied results contain neither plotted data nor numerical values substantiating the winning strategy's near-equal X/Z error rates and reduced sum. The paper incorrectly equates Y-biased noise with depolarizing noise, although their X/Z-component marginals and joint probabilities differ.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
Accepted poster at the 8th International Quantum Error Correction (QEC) conference; 6 pages, 5 figures

Related papers

Staying Sober: A Shot-Free Predictor of Logical Error Rates for Concatenated Quantum Error Correcting Codes

Sayam Sethi, Aditi Awasthi, Maxwell Poster +2 more

Estimating the logical error rate (LER) of a quantum error-correcting (QEC) code by Monte Carlo sampling takes $O(p^{-\lceil d/2 \rceil}/\varepsilon^2)$ samples at physical error rate $p$, code distance $d$ and relative error $\varepsilon$, which becomes intractable at large distances and low error rates, and especially for concatenated codes, whose distance grows as $d^{\ell}$ with the number of levels $\ell$. The fail fast method reduces this cost by sampling the failures of each weight separately, but it only works for unconcatenated codes, and does not model the soft information that the levels of a concatenated code pass to each other. We propose a predictor that takes the stabilizers, the minimum-weight logical operators and, for odd $d$, the logical operators of weight $d + 1$ of a code, and computes, without sampling, the leading monomial $c\,p^{o}$ of the LER when expressed as a polynomial in $p$, at every level of concatenation, in time polynomial in the code parameters and linear in $\ell$ for fixed budgets. We prove that our prediction is exact for any unconcatenated stabilizer code, for every logical observable and arbitrary per-qubit error rates, whenever no budget is exhausted. Furthermore, for concatenated codes, we construct a recursive approach that computes the leading monomial exactly in exponential time, and our predictor approximates this approach. Our predictions match exact enumeration at level 1 on every code we evaluate, and up to three levels for the iceberg code. Using our predictor, we evaluate and compare $37$ code configurations under four noise biases in $48$ core-hours, where Monte Carlo sampling would need more than $10^{12}$ shots at $p = 10^{-3}$ for $113$ of these $148$ cases.

quant-pharXiv:2610.06606•Oct 6, 2026•0 citations

High-Rate Concatenated Quantum Error-Correcting Codes for Qudits

Takanori Nishi, Hayato Goto

Qudits provide a larger local Hilbert space than qubits and have recently attracted interest as building blocks for efficient fault-tolerant quantum computation (FTQC). In this work, we extend many-hypercube (MHC) codes, high-rate concatenated quantum codes, from qubits to qudits of prime dimension $q$. We construct the level-2 and level-3 MHC codes with parameters $\left[\!\left[6^2,4^2,2^2\right]\!\right]_q$ and $\left[\!\left[6^3,4^3,2^3\right]\!\right]_q$, respectively, and generalize the level-by-level minimum-distance (LLMD) decoder originally proposed for the qubit MHC codes. In a qudit $X$-error model, we evaluate the code-capacity performance of the qudit MHC codes for dimensions up to $q=13$. We find that the error threshold increases monotonically with the local dimension $q$, reaching $10.0\%$ for $q=13$, nearly double the value of $5.1\%$ for qubits. Furthermore, for sufficiently large local dimensions, we observe a pronounced waterfall regime in which the logical error rate decreases substantially faster than expected from conventional distance-based estimates. To understand the origin of the observed qudit advantage, we analyze the decoding performance in terms of the entropy of the underlying $q$-ary noise channel. This analysis reveals a competition between the increased syndrome information available at larger $q$ and the simultaneous growth of the typical physical error weight at fixed entropy. These results demonstrate that higher-dimensional quantum systems can substantially improve the performance of high-rate concatenated quantum codes and motivate further development of qudit-based FTQC architectures.

quant-pharXiv:2610.11225•Oct 9, 2026•0 citations

Elevator Codes: Concatenation for resource-efficient quantum memory under biased noise

Peter Shanahan, Diego Ruiz

Biased-noise qubits, in which one type of error (e.g. $X$- and $Y$-type errors) is significantly suppressed relative to the other (e.g. $Z$-type errors), can significantly reduce the overhead of quantum error correction. Codes such as the rectangular surface code or XZZX code substantially reduce the qubit overhead under biased noise, but they still face challenges. The rectangular surface code suffers from a relatively low threshold, while the XZZX code requires twice as many physical qubits to maintain the same code distance as the surface code. In this work, we introduce a 2D local code construction that outperforms these codes for noise biases $η\ge 7\times10^{4}$, reducing the qubit overhead by over 50% at $p_Z=10^{-3}$ and $η= 2 \times 10^6$ to achieve a logical error rate of $10^{-12}$. Our construction relies on the concatenation of two classical codes. The inner codes are repetition phase-flip codes while the outer codes are high-rate bit-flip codes enabled by their implementation at the logical level, which circumvents device connectivity constraints. These results indicate that under sufficiently biased noise, it is advantageous to address phase-flip and bit-flip errors at different layers of the coding scheme. The inner code should prioritize a high threshold for phase-flip errors, while the bit-flip outer code should optimize for encoding rate efficiency. In the strong biased-noise regime, high-rate outer codes keep the overhead for correcting residual bit-flip errors comparable to that of the repetition code itself, meaningfully lower than that required by earlier approaches.

quant-pharXiv:2601.10786•Jan 19, 2026•7 citations

Learning to Concatenate Quantum Codes

Nico Meyer, Christopher Mutschler, Dominik Seuß +2 more

Concatenating quantum error correction codes scales error correction capability by driving logical error rates down double-exponentially across levels. However, the noise structure shifts under concatenation, making it hard to choose an optimal code sequence. We automate this choice by estimating the effective noise channel after each level and selecting the next code accordingly. In particular, we use learning-based methods to tailor small, non-additive encoders when the noise exhibits sufficient structure, then switch to standard codes once the noise is nearly uniform. In simulations, this level-wise adaptation achieves a target logical error rate with far fewer qubits than concatenating stabilizer codes alone--reducing qubit counts by up to two orders of magnitude for strongly structured noise. Therefore, this hybrid, learning-based strategy offers a promising tool for early fault-tolerant quantum computing.

quant-pharXiv:2604.14931•Apr 17, 2026•2 citations

Clifford-Deformed Compass Codes

Julie Campos, Kenneth R. Brown

We can design efficient quantum error-correcting (QEC) codes by tailoring them to our choice of quantum architecture. Useful tools for constructing such codes include Clifford deformations and appropriate gauge fixings of compass codes. In this work, we find Clifford deformations that can be applied to elongated compass codes resulting in QEC codes with improved performance under noise models with errors biased towards dephasing commonly seen in quantum computing architectures. These Clifford deformations enhance decoder performance by introducing symmetries, while the stabilizers of compass codes can be selected to obtain more information on high-rate errors. As a result, the codes exhibit thresholds that increase with bias and lower logical error rates under both code capacity and phenomenological noise models. One of the Clifford deformations we explore yields QEC codes with better thresholds and logical error rates than those of the XZZX surface code at moderate biases under code capacity noise.

arXiv:2412.03808•Quantum•Apr 16, 2026•7 citations

Bidirectional Decoding for Concatenated Quantum Hamming Codes

Chao Zhang, Zipeng Wu, Jiahui Wu +1 more

High-rate concatenated quantum codes offer a promising pathway toward fault-tolerant quantum computation, yet designing efficient decoders that fully exploit their error-correction capability remains a significant challenge. In this work, we introduce a hard-decision decoder for concatenated quantum Hamming codes with time complexity polynomial in the block length. This decoder overcomes the limitations of conventional local decoding by leveraging higher-level syndrome information to revise lower-level recovery decisions -- a strategy we refer to as bidirectional decoding. For the concatenated $[[15,7,3]]$ quantum Hamming code under independent bit-flip noise, the bidirectional decoder improves the threshold from approximately $1.56\%$ to $4.35\%$ compared with standard local decoding. Moreover, the decoder empirically preserves the full $3^{L}$ code-distance scaling for at least three levels of concatenation, resulting in substantially faster logical-error suppression than the $2^{L+1}$ scaling offered by local decoders. Our results can enhance the competitiveness of concatenated-code architectures for low-overhead fault-tolerant quantum computation.

quant-pharXiv:2601.09131•Jan 15, 2026•6 citations
Concatenated quantum error-correcting codes have recently gained popularity because they improve the effective distance of a joint code without requiring the discovery of new codes with desirable parameters. A common building block for such studies is the [[4,1,2]][[4,1,2]][[4,1,2]] Iceberg code, the smallest error-detecting code and therefore the one with the lowest resource overhead. However, it has an asymmetric number of XXX and ZZZ checks, and concatenating it produces skewed logical error rates (LERs) between the XXX and ZZZ observables. This asymmetry can be mitigated by Clifford-deforming the individual blocks of the concatenation, but the space of possible Hadamard deformations grows doubly exponentially with the number of concatenation levels. We formalize this deformation space and investigate it by proposing six concrete deformation strategies, which we compare under a code capacity (with and without bias) noise model using a concatenated maximum-likelihood soft-information decoder. Among the strategies we study, one one of them achieves near-identical XXX and ZZZ LERs in a logical-memory experiment while simultaneously reducing the total LER (the sum of the XXX and ZZZ error rates).
The paper asks how blockwise Hadamard deformations can balance logical XXX- and ZZZ-error rates in concatenated [[4,1,2]][[4,1,2]][[4,1,2]] Iceberg codes. Although the constituent code has equal XXX and ZZZ distances, its unequal numbers of XXX- and ZZZ-type checks produce asymmetric soft information during concatenated decoding.
It counts deformation assignments on the concatenation tree: each four-qubit block has 161616 Hadamard choices, giving cl=cl−14 16=24(4l−1)/3c_l=c_{l-1}^4\,16=2^{4(4^l-1)/3}cl​=cl−14​16=24(4l−1)/3 assignments at level lll. Rather than search this space exhaustively, it compares six fixed strategies, including uniform deformations and patterns alternating across levels or between blocks within a level. Logical-memory simulations cover one through four concatenation levels using a level-by-level maximum-likelihood soft-information decoder and 500,000500{,}000500,000 Monte Carlo shots. Tests use code-capacity depolarizing noise and XXX- or ZZZ-biased Pauli noise, with probabilities 0.8p0.8p0.8p for the dominant Pauli and 0.1p0.1p0.1p for each other Pauli.
The undeformed construction exhibits a logical ZZZ-error rate up to 606060 times its logical XXX-error rate at four levels. Among the tested strategies, alternating complementary mixed Hadamard patterns between blocks within each level gives near-equal XXX and ZZZ logical-error rates and lowers their sum; it also remains the most balanced under the tested biased channels.
The conclusions concern these six patterns and simulated noise settings, not an optimized deformation over the full space. Selecting robust deformations for arbitrary concatenation levels and error models is left for further work.
Estimating the logical error rate (LER) of a quantum error-correcting (QEC) code by Monte Carlo sampling takes O(p−⌈d/2⌉/ε2)O(p^{-\lceil d/2 \rceil}/\varepsilon^2)O(p−⌈d/2⌉/ε2) samples at physical error rate ppp, code distance ddd and relative error ε\varepsilonε, which becomes intractable at large distances and low error rates, and especially for concatenated codes, whose distance grows as dℓd^{\ell}dℓ with the number of levels ℓ\ellℓ. The fail fast method reduces this cost by sampling the failures of each weight separately, but it only works for unconcatenated codes, and does not model the soft information that the levels of a concatenated code pass to each other. We propose a predictor that takes the stabilizers, the minimum-weight logical operators and, for odd ddd, the logical operators of weight d+1d + 1d+1 of a code, and computes, without sampling, the leading monomial c poc\,p^{o}cpo of the LER when expressed as a polynomial in ppp, at every level of concatenation, in time polynomial in the code parameters and linear in ℓ\ellℓ for fixed budgets. We prove that our prediction is exact for any unconcatenated stabilizer code, for every logical observable and arbitrary per-qubit error rates, whenever no budget is exhausted. Furthermore, for concatenated codes, we construct a recursive approach that computes the leading monomial exactly in exponential time, and our predictor approximates this approach. Our predictions match exact enumeration at level 1 on every code we evaluate, and up to three levels for the iceberg code. Using our predictor, we evaluate and compare 373737 code configurations under four noise biases in 484848 core-hours, where Monte Carlo sampling would need more than 101210^{12}1012 shots at p=10−3p = 10^{-3}p=10−3 for 113113113 of these 148148148 cases.
Qudits provide a larger local Hilbert space than qubits and have recently attracted interest as building blocks for efficient fault-tolerant quantum computation (FTQC). In this work, we extend many-hypercube (MHC) codes, high-rate concatenated quantum codes, from qubits to qudits of prime dimension qqq. We construct the level-2 and level-3 MHC codes with parameters [ ⁣[62,42,22] ⁣]q\left[\!\left[6^2,4^2,2^2\right]\!\right]_q[[62,42,22]]q​ and [ ⁣[63,43,23] ⁣]q\left[\!\left[6^3,4^3,2^3\right]\!\right]_q[[63,43,23]]q​, respectively, and generalize the level-by-level minimum-distance (LLMD) decoder originally proposed for the qubit MHC codes. In a qudit XXX-error model, we evaluate the code-capacity performance of the qudit MHC codes for dimensions up to q=13q=13q=13. We find that the error threshold increases monotonically with the local dimension qqq, reaching 10.0%10.0\%10.0% for q=13q=13q=13, nearly double the value of 5.1%5.1\%5.1% for qubits. Furthermore, for sufficiently large local dimensions, we observe a pronounced waterfall regime in which the logical error rate decreases substantially faster than expected from conventional distance-based estimates. To understand the origin of the observed qudit advantage, we analyze the decoding performance in terms of the entropy of the underlying qqq-ary noise channel. This analysis reveals a competition between the increased syndrome information available at larger qqq and the simultaneous growth of the typical physical error weight at fixed entropy. These results demonstrate that higher-dimensional quantum systems can substantially improve the performance of high-rate concatenated quantum codes and motivate further development of qudit-based FTQC architectures.
Biased-noise qubits, in which one type of error (e.g. XXX- and YYY-type errors) is significantly suppressed relative to the other (e.g. ZZZ-type errors), can significantly reduce the overhead of quantum error correction. Codes such as the rectangular surface code or XZZX code substantially reduce the qubit overhead under biased noise, but they still face challenges. The rectangular surface code suffers from a relatively low threshold, while the XZZX code requires twice as many physical qubits to maintain the same code distance as the surface code. In this work, we introduce a 2D local code construction that outperforms these codes for noise biases η≥7×104η\ge 7\times10^{4}η≥7×104, reducing the qubit overhead by over 50% at pZ=10−3p_Z=10^{-3}pZ​=10−3 and η=2×106η= 2 \times 10^6η=2×106 to achieve a logical error rate of 10−1210^{-12}10−12. Our construction relies on the concatenation of two classical codes. The inner codes are repetition phase-flip codes while the outer codes are high-rate bit-flip codes enabled by their implementation at the logical level, which circumvents device connectivity constraints. These results indicate that under sufficiently biased noise, it is advantageous to address phase-flip and bit-flip errors at different layers of the coding scheme. The inner code should prioritize a high threshold for phase-flip errors, while the bit-flip outer code should optimize for encoding rate efficiency. In the strong biased-noise regime, high-rate outer codes keep the overhead for correcting residual bit-flip errors comparable to that of the repetition code itself, meaningfully lower than that required by earlier approaches.
Concatenating quantum error correction codes scales error correction capability by driving logical error rates down double-exponentially across levels. However, the noise structure shifts under concatenation, making it hard to choose an optimal code sequence. We automate this choice by estimating the effective noise channel after each level and selecting the next code accordingly. In particular, we use learning-based methods to tailor small, non-additive encoders when the noise exhibits sufficient structure, then switch to standard codes once the noise is nearly uniform. In simulations, this level-wise adaptation achieves a target logical error rate with far fewer qubits than concatenating stabilizer codes alone--reducing qubit counts by up to two orders of magnitude for strongly structured noise. Therefore, this hybrid, learning-based strategy offers a promising tool for early fault-tolerant quantum computing.
We can design efficient quantum error-correcting (QEC) codes by tailoring them to our choice of quantum architecture. Useful tools for constructing such codes include Clifford deformations and appropriate gauge fixings of compass codes. In this work, we find Clifford deformations that can be applied to elongated compass codes resulting in QEC codes with improved performance under noise models with errors biased towards dephasing commonly seen in quantum computing architectures. These Clifford deformations enhance decoder performance by introducing symmetries, while the stabilizers of compass codes can be selected to obtain more information on high-rate errors. As a result, the codes exhibit thresholds that increase with bias and lower logical error rates under both code capacity and phenomenological noise models. One of the Clifford deformations we explore yields QEC codes with better thresholds and logical error rates than those of the XZZX surface code at moderate biases under code capacity noise.
High-rate concatenated quantum codes offer a promising pathway toward fault-tolerant quantum computation, yet designing efficient decoders that fully exploit their error-correction capability remains a significant challenge. In this work, we introduce a hard-decision decoder for concatenated quantum Hamming codes with time complexity polynomial in the block length. This decoder overcomes the limitations of conventional local decoding by leveraging higher-level syndrome information to revise lower-level recovery decisions -- a strategy we refer to as bidirectional decoding. For the concatenated [[15,7,3]][[15,7,3]][[15,7,3]] quantum Hamming code under independent bit-flip noise, the bidirectional decoder improves the threshold from approximately 1.56%1.56\%1.56% to 4.35%4.35\%4.35% compared with standard local decoding. Moreover, the decoder empirically preserves the full 3L3^{L}3L code-distance scaling for at least three levels of concatenation, resulting in substantially faster logical-error suppression than the 2L+12^{L+1}2L+1 scaling offered by local decoders. Our results can enhance the competitiveness of concatenated-code architectures for low-overhead fault-tolerant quantum computation.