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

The advantage of the concatenated three-qubit codes

Long Huang

Published Sep 28, 2022• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2209.15435

Related papers

Performance of five-qubit code for arbitrary error channels

Long Yang Huang, Xiaohua Wu, Tao Zhou

In quantum error correction, it is an important assumption that errors on different qubits are independent. In our previous work [Phys. Rev. A {\bf 92}, 052320 (2015)], the generality of the concatenated five-qubit code has been investgated when noises of the principal system and the auxiliary environment are assumed to be the same. In the error correction with concatenated code, tiny differences (in fidelity or independent errors) between initial quantum channels may introduce different effective channels in the next level, and therefore, it is necessary to study a meaningful question: Does five-qubit code still work efficiently when errors on different qubits are different? In the present work, it is discovered that even errors for different qubits are arbitrary, the five-qubit code still works efficiently. Since it is much easier and more accurate to measure the fidelity, one can construct quantum error correction with five-qubit code according to the initial channel fidelity, and it is not necessary to know the complete information of the initial channel. Moreover, when the initial channel fidelity is below $0.992$, the fidelity threshold for five-qubit code is the fidelity of the effective channel after error correction in bit-flip channels.

arXiv:1707.09788•Jul 31, 2017•0 citations

Generality of the concatenated five-qubit code

Long Yang Huang, Bo You, Xiaohua Wu +1 more

In this work, a quantum error correction (QEC) procedure with the concatenated five-qubit code is used to construct a near-perfect effective qubit channel (with a error below ${10}^{\ensuremath{-}5}$) from arbitrary noise channels. The exact performance of the QEC is characterized by a Choi matrix, which can be obtained via a simple and explicit protocol. In a noise model with five free parameters, our numerical results indicate that the concatenated five-qubit code is general: To construct a near-perfect effective channel from the noise channels, the necessary size of the concatenated five-qubit code depends only on the entanglement fidelity of the initial noise channels.

arXiv:1511.00059•Physical Review A•Nov 18, 2015•5 citations

Robustness of the concatenated quantum error-correction protocol against noise for channels affected by fluctuation

Long Yang Huang, Xiaohua Wu, Tao Zhou

In quantum error correction, the description of the noise channel cannot be completely accurate and fluctuation always appears in the noise channel. It is found that when fluctuation of the physical noise channel is considered, the average effective channel is dependent only on the average of the physical noise channel, and the average of the physical noise channel here plays the role of the independent error model in previous works. Now one may conclude that in the independent error model, the results in previous works are also valid for the average channel where fluctuation exists. In some typical cases, our numerical simulations in the concatenated quantum error-correction protocol with a five-qubit code, seven-qubit Steane code, and nine-qubit Shor confirm this conjecture. For a five-qubit code, the effective channels approximate to the depolarizing channel as the concatenated level increases. For the Steane code, the effective channels approximate to one Pauli channel as the concatenated level increases. For the Shor code, the effective channels approximate to either a Pauli-$X$ or Pauli-$Z$ channel in each level, and in the next concatenated level, the effective channels approximate to the other. The numerical results for these codes indicate that the degree of approximation increases as the concatenated level increases, and the fluctuation of the noise channel decays exponentially as concatenated quantum error correction is performed. On the error-correction threshold, the attenuation ratio of the standard deviation of channel fidelity has a roughly stable value. In contrast, standard deviations of off-diagonal elements of the quantum process matrix (Pauli form) decay more quickly than standard deviations of diagonal elements.

arXiv:1810.00390•Physical Review A•Oct 21, 2019•5 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•0 citations

Noise redistribution by stabilizer codes: an organizing view of concatenated three-qubit codes

Long Huang

We formulate stabilizer-code error correction as a code- and recovery-dependent transformation of the noise channel. For a fixed recovery map, syndrome projection produces a block-diagonal logical channel whose diagonal Pauli weights follow from code-induced error classes, with no physical Pauli twirl; concatenation is then iterated redistribution, with the dominant logical error guiding the next code. The bit-flip and phase-flip three-qubit codes with standard recoveries supply a closed-form benchmark, and logically inequivalent recoveries appear as a design degree of freedom for shaping the channel presented to the next decoder. For amplitude damping, the three-qubit rules select $C_2(\hatσ_y)C_1(\hatσ_x)$ and give $f_l=1-\mathcal O(γ^2)$, with an ideal-gate crossover at $γ_c\approx0.30$ ($f=1-1.72755γ^2$) and a favorable gate-count comparison with the five-qubit code under the same assumptions. Correlated noise requires joint class statistics, whereas coherent noise retains intra-class coherences that make the same transformation usable in reverse as a tomographic fingerprint; there the companion work proves local identifiability from a rank certificate evaluated inside the parameter domain, classifies the sole permutation-symmetry ambiguity as structural at any chain length, and closes it with one two-qubit marginal channel. The construction remains an analytic benchmark, not a universal prescription for an inner code beneath a surface code.

quant-pharXiv:2610.31007•Oct 23, 2026•0 citations

Efficiently computing logical noise in quantum error-correcting codes

Stefanie J. Beale, Joel J. Wallman

Quantum error correction protocols have been developed to offset the high sensitivity to noise inherent in quantum systems. However, much is still unknown about the behavior of a quantum error-correcting code under general noise, including noisy measurements. This lack of knowledge is largely due to the computational cost of simulating quantum systems large enough to perform nontrivial encodings. In this paper, we develop general methods for incorporating noisy measurement operations into simulations of quantum error-correcting codes and show that measurement errors on readout qubits manifest as a renormalization on the effective logical noise. We also derive general methods for reducing the computational complexity of calculating the exact effective logical noise by many orders of magnitude. This reduction is achieved by determining when different recovery operations produce equivalent logical noise. These methods could also be used to better approximate soft decoding schemes for concatenated codes or to reduce the size of a lookup table to speed up the error correction step in implementations of quantum error-correcting codes. We give examples of such reductions for the three-qubit, five-qubit, Steane, concatenated, and toric codes.

arXiv:2003.10511•Physical Review A•Jun 2, 2021•4 citations
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.
In quantum error correction, it is an important assumption that errors on different qubits are independent. In our previous work [Phys. Rev. A {\bf 92}, 052320 (2015)], the generality of the concatenated five-qubit code has been investgated when noises of the principal system and the auxiliary environment are assumed to be the same. In the error correction with concatenated code, tiny differences (in fidelity or independent errors) between initial quantum channels may introduce different effective channels in the next level, and therefore, it is necessary to study a meaningful question: Does five-qubit code still work efficiently when errors on different qubits are different? In the present work, it is discovered that even errors for different qubits are arbitrary, the five-qubit code still works efficiently. Since it is much easier and more accurate to measure the fidelity, one can construct quantum error correction with five-qubit code according to the initial channel fidelity, and it is not necessary to know the complete information of the initial channel. Moreover, when the initial channel fidelity is below 0.9920.9920.992, the fidelity threshold for five-qubit code is the fidelity of the effective channel after error correction in bit-flip channels.
In this work, a quantum error correction (QEC) procedure with the concatenated five-qubit code is used to construct a near-perfect effective qubit channel (with a error below ${10}^{\ensuremath{-}5}$) from arbitrary noise channels. The exact performance of the QEC is characterized by a Choi matrix, which can be obtained via a simple and explicit protocol. In a noise model with five free parameters, our numerical results indicate that the concatenated five-qubit code is general: To construct a near-perfect effective channel from the noise channels, the necessary size of the concatenated five-qubit code depends only on the entanglement fidelity of the initial noise channels.
In quantum error correction, the description of the noise channel cannot be completely accurate and fluctuation always appears in the noise channel. It is found that when fluctuation of the physical noise channel is considered, the average effective channel is dependent only on the average of the physical noise channel, and the average of the physical noise channel here plays the role of the independent error model in previous works. Now one may conclude that in the independent error model, the results in previous works are also valid for the average channel where fluctuation exists. In some typical cases, our numerical simulations in the concatenated quantum error-correction protocol with a five-qubit code, seven-qubit Steane code, and nine-qubit Shor confirm this conjecture. For a five-qubit code, the effective channels approximate to the depolarizing channel as the concatenated level increases. For the Steane code, the effective channels approximate to one Pauli channel as the concatenated level increases. For the Shor code, the effective channels approximate to either a Pauli-XXX or Pauli-ZZZ channel in each level, and in the next concatenated level, the effective channels approximate to the other. The numerical results for these codes indicate that the degree of approximation increases as the concatenated level increases, and the fluctuation of the noise channel decays exponentially as concatenated quantum error correction is performed. On the error-correction threshold, the attenuation ratio of the standard deviation of channel fidelity has a roughly stable value. In contrast, standard deviations of off-diagonal elements of the quantum process matrix (Pauli form) decay more quickly than standard deviations of diagonal elements.
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 formulate stabilizer-code error correction as a code- and recovery-dependent transformation of the noise channel. For a fixed recovery map, syndrome projection produces a block-diagonal logical channel whose diagonal Pauli weights follow from code-induced error classes, with no physical Pauli twirl; concatenation is then iterated redistribution, with the dominant logical error guiding the next code. The bit-flip and phase-flip three-qubit codes with standard recoveries supply a closed-form benchmark, and logically inequivalent recoveries appear as a design degree of freedom for shaping the channel presented to the next decoder. For amplitude damping, the three-qubit rules select C2(σ^y)C1(σ^x)C_2(\hatσ_y)C_1(\hatσ_x)C2​(σ^y​)C1​(σ^x​) and give fl=1−O(γ2)f_l=1-\mathcal O(γ^2)fl​=1−O(γ2), with an ideal-gate crossover at γc≈0.30γ_c\approx0.30γc​≈0.30 (f=1−1.72755γ2f=1-1.72755γ^2f=1−1.72755γ2) and a favorable gate-count comparison with the five-qubit code under the same assumptions. Correlated noise requires joint class statistics, whereas coherent noise retains intra-class coherences that make the same transformation usable in reverse as a tomographic fingerprint; there the companion work proves local identifiability from a rank certificate evaluated inside the parameter domain, classifies the sole permutation-symmetry ambiguity as structural at any chain length, and closes it with one two-qubit marginal channel. The construction remains an analytic benchmark, not a universal prescription for an inner code beneath a surface code.
Quantum error correction protocols have been developed to offset the high sensitivity to noise inherent in quantum systems. However, much is still unknown about the behavior of a quantum error-correcting code under general noise, including noisy measurements. This lack of knowledge is largely due to the computational cost of simulating quantum systems large enough to perform nontrivial encodings. In this paper, we develop general methods for incorporating noisy measurement operations into simulations of quantum error-correcting codes and show that measurement errors on readout qubits manifest as a renormalization on the effective logical noise. We also derive general methods for reducing the computational complexity of calculating the exact effective logical noise by many orders of magnitude. This reduction is achieved by determining when different recovery operations produce equivalent logical noise. These methods could also be used to better approximate soft decoding schemes for concatenated codes or to reduce the size of a lookup table to speed up the error correction step in implementations of quantum error-correcting codes. We give examples of such reductions for the three-qubit, five-qubit, Steane, concatenated, and toric codes.