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

Learning to Concatenate Quantum Codes

Nico Meyer, Christopher Mutschler, Dominik Seuß, Andreas Maier, Daniel D. Scherer

quant-phcs.LGSubmitted Apr 16, 2026• Announced Apr 17, 2026• 2 citations• Revised Sep 3, 2026 (v2)
v1 · Apr 16, 2026v2 · Sep 3, 2026
arXivHTMLPDF

Abstract

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.

Comments
Accepted to the IEEE International Conference on Quantum Computing and Engineering (QCE 2026), Toronto, Ontario, Canada. 7 pages, 5 figures, 1 table

Related papers

Correctable noise of quantum-error-correcting codes under adaptive concatenation

Jesse Fern

We examine the transformation of noise under a quantum-error-correcting code (QECC) concatenated repeatedly with itself, by analyzing the effects of a quantum channel after each level of concatenation using recovery operators that are optimally adapted to use error syndrome information from the previous levels of the code. We use the Shannon entropy of these channels to estimate the thresholds of correctable noise for QECCs and find considerable improvements under this adaptive concatenation. Similar methods could be used to increase quantum-fault-tolerant thresholds.

arXiv:quant-ph/0703258•Physical Review A•Jan 18, 2008•17 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

Fault-tolerant computation without concatenation

Eric Dennis

It has been known that error-correction via concatenated codes can be done with exponentially small failure rate if the error rate for physical qubits is below a certain accuracy threshold (probably ∼ 10 −3 –10 −6). Other, un-concatenated codes with their own attractive features—e.g., an accuracy threshold ∼ 10 −2 —have also been studied. A method to obtain universal computation is presented here which does not rely on any concatenated structure within the code itself, but instead emulates this structure with logical qubits in order to construct an encoded Toffoli gate. This realizes ∼ 10 −2 as a threshold for fault-tolerant quantum computation. 1 QEC codes and universal computation In the “space ” of all possible quantum error-correcting codes, much recent work has focused on a relatively small class, namely concatenated codes [1]–[7]. The basic idea behind these is to improve the results of a given few-qubit code by

•May 7, 1999•2 citations

Learning to Decode Concatenated Quantum Codes with Hierarchical Message Passing

Jiahui Wu, Chao Zhang, Zipeng Wu +1 more

We introduce a neural message-passing framework for decoding general concatenated stabilizer codes. Soft beliefs propagate bidirectionally across concatenation levels, and lightweight neural networks learn only to aggregate incoming messages. For the concatenated $[[15,7,3]]$ quantum Hamming code, the resulting decoder achieves substantially higher thresholds than the state-of-the-art bidirectional hard-decision decoder under both bit-flip and depolarizing noise. In particular, the depolarizing pseudo-threshold nearly doubles, from $6.5\%$ to $12.3\%$. For many-hypercube codes, a decoder fine-tuned on circuit-level errors in Knill's teleportation-based error correction can achieve lower logical-CNOT failure rates than their dedicated decoder, using a fixed number of message-passing iterations instead of extensive combinatorial search. Our framework provides a generic decoding tool for exploring the design space of concatenated codes, including non-CSS constructions, toward low-overhead fault tolerance.

quant-pharXiv:2608.28571•Aug 31, 2026•1 citation

The advantage of the concatenated three-qubit codes

Long Huang

In this work, the efficient quantum error-correction protocol against the general independent noise is constructed with the three-qubit codes. The rules of concatenation are summarized according to the error-correcting capability of the codes. The codes not only play the role of correcting errors, but the role of polarizing the effective channel. For any independent noise, the most suitable error-correction protocol can be constructed based on the rules of concatenation. The most significant aspect of using the concatenated three-qubit codes is to realize quantum error-correction with the non-ideal gate operations, because the error-correction schemes of the three-qubit codes are simple and modular. For example, for the amplitude damping noise with the initial channel fidelity 0.9, the effective channel fidelity can reach 0.94731 (or 0.961634 with the ideal quantum gate operations) when using the 4 levels concatenated quantum error-correction with the three-qubit codes. The protocol with the three-qubit codes needs 81 qubits and 366 quantum gate operations when the accuracy rate is 0.9995. Meanwhile, when using the 3 levels concatenated quantum error-correction with the five-qubit code, the effective channel fidelity can only reach 0.922798 (or 0.975488 with the ideal quantum gate operations). The protocol with the five-qubit code needs 125 qubits and 1147 quantum gate operations when the accuracy rate is 0.9995. The physical resources costed is multiple of the physical resources costed by realizing the three-qubit quantum error-correction, the protocol has a higher fault tolerance threshold, and no increase in complexity. So, we believe it will be helpful for realizing quantum error-correction in the physical system.

arXiv:2209.15435•Sep 28, 2022•3 citations

Protection of Exponential Operation using Stabilizer Codes in the Early Fault Tolerance Era

Dawei Zhong, Todd A. Brun

Quantum error correction offers a promising path to suppress errors in quantum processors, but the resources required to protect logical operations from noise, especially non-Clifford operations, pose a substantial challenge to achieve practical quantum advantage in the early fault-tolerant quantum computing (EFTQC) era. In this work, we develop a systematic scheme to encode exponential maps of the form $\exp(-iθP)$ into stabilizer codes with simple circuit structures and low qubit overhead. We provide encoded circuits with small first-order logical error rate after postselection for the [[n, n-2, 2]] quantum error-detecting codes and the [[5, 1, 3]], [[7, 1, 3]], and [[15, 7, 3]] quantum error-correcting codes. Detailed analysis shows that under the level of physical noise of current devices, our encoding scheme is 4--7 times less noisy than the unencoded operation, while at most 3% of runs need to be discarded.

quant-pharXiv:2602.13399•Feb 17, 2026•3 citations
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 examine the transformation of noise under a quantum-error-correcting code (QECC) concatenated repeatedly with itself, by analyzing the effects of a quantum channel after each level of concatenation using recovery operators that are optimally adapted to use error syndrome information from the previous levels of the code. We use the Shannon entropy of these channels to estimate the thresholds of correctable noise for QECCs and find considerable improvements under this adaptive concatenation. Similar methods could be used to increase quantum-fault-tolerant thresholds.
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.
It has been known that error-correction via concatenated codes can be done with exponentially small failure rate if the error rate for physical qubits is below a certain accuracy threshold (probably ∼ 10 −3 –10 −6). Other, un-concatenated codes with their own attractive features—e.g., an accuracy threshold ∼ 10 −2 —have also been studied. A method to obtain universal computation is presented here which does not rely on any concatenated structure within the code itself, but instead emulates this structure with logical qubits in order to construct an encoded Toffoli gate. This realizes ∼ 10 −2 as a threshold for fault-tolerant quantum computation. 1 QEC codes and universal computation In the “space ” of all possible quantum error-correcting codes, much recent work has focused on a relatively small class, namely concatenated codes [1]–[7]. The basic idea behind these is to improve the results of a given few-qubit code by
We introduce a neural message-passing framework for decoding general concatenated stabilizer codes. Soft beliefs propagate bidirectionally across concatenation levels, and lightweight neural networks learn only to aggregate incoming messages. For the concatenated [[15,7,3]][[15,7,3]][[15,7,3]] quantum Hamming code, the resulting decoder achieves substantially higher thresholds than the state-of-the-art bidirectional hard-decision decoder under both bit-flip and depolarizing noise. In particular, the depolarizing pseudo-threshold nearly doubles, from 6.5%6.5\%6.5% to 12.3%12.3\%12.3%. For many-hypercube codes, a decoder fine-tuned on circuit-level errors in Knill's teleportation-based error correction can achieve lower logical-CNOT failure rates than their dedicated decoder, using a fixed number of message-passing iterations instead of extensive combinatorial search. Our framework provides a generic decoding tool for exploring the design space of concatenated codes, including non-CSS constructions, toward low-overhead fault tolerance.
In this work, the efficient quantum error-correction protocol against the general independent noise is constructed with the three-qubit codes. The rules of concatenation are summarized according to the error-correcting capability of the codes. The codes not only play the role of correcting errors, but the role of polarizing the effective channel. For any independent noise, the most suitable error-correction protocol can be constructed based on the rules of concatenation. The most significant aspect of using the concatenated three-qubit codes is to realize quantum error-correction with the non-ideal gate operations, because the error-correction schemes of the three-qubit codes are simple and modular. For example, for the amplitude damping noise with the initial channel fidelity 0.9, the effective channel fidelity can reach 0.94731 (or 0.961634 with the ideal quantum gate operations) when using the 4 levels concatenated quantum error-correction with the three-qubit codes. The protocol with the three-qubit codes needs 81 qubits and 366 quantum gate operations when the accuracy rate is 0.9995. Meanwhile, when using the 3 levels concatenated quantum error-correction with the five-qubit code, the effective channel fidelity can only reach 0.922798 (or 0.975488 with the ideal quantum gate operations). The protocol with the five-qubit code needs 125 qubits and 1147 quantum gate operations when the accuracy rate is 0.9995. The physical resources costed is multiple of the physical resources costed by realizing the three-qubit quantum error-correction, the protocol has a higher fault tolerance threshold, and no increase in complexity. So, we believe it will be helpful for realizing quantum error-correction in the physical system.
Quantum error correction offers a promising path to suppress errors in quantum processors, but the resources required to protect logical operations from noise, especially non-Clifford operations, pose a substantial challenge to achieve practical quantum advantage in the early fault-tolerant quantum computing (EFTQC) era. In this work, we develop a systematic scheme to encode exponential maps of the form exp⁡(−iθP)\exp(-iθP)exp(−iθP) into stabilizer codes with simple circuit structures and low qubit overhead. We provide encoded circuits with small first-order logical error rate after postselection for the [[n, n-2, 2]] quantum error-detecting codes and the [[5, 1, 3]], [[7, 1, 3]], and [[15, 7, 3]] quantum error-correcting codes. Detailed analysis shows that under the level of physical noise of current devices, our encoding scheme is 4--7 times less noisy than the unencoded operation, while at most 3% of runs need to be discarded.