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:quant-ph/0409084 · IEEE Transactions on Automatic Control

Generalized Performance of Concatenated Quantum Codes—A Dynamical Systems Approach

J. Fern, Julia Kempe, S.N. Simic, Shankar Sastry

Published Mar 1, 2006• 21 citations
arXivHTMLPDF

Abstract

We apply a dynamical systems approach to concatenation of quantum error correcting codes, extending and generalizing the results of Rahn to both diagonal and nondiagonal channels. Our point of view is global: instead of focusing on particular types of noise channels, we study the geometry of the coding map as a discrete-time dynamical system on the entire space of noise channels. In the case of diagonal channels, we show that any code with distance at least three corrects (in the infinite concatenation limit) an open set of errors. For Calderbank–Shor–Steane (CSS) codes, we give a more precise characterization of that set. We show how to incorporate noise in the gates, thus completing the framework. We derive some general bounds for noise channels, which allows us to analyze several codes in detail.

DOI
10.1109/tac.2006.871942

Related papers

Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction

Mitsuru Hamada

A method for concatenating quantum error-correcting codes is presented. The method is applicable to a wide class of quantum error-correcting codes known as Calderbank-Shor-Steane (CSS) codes. As a result, codes that achieve a high rate in the Shannon-theoretic sense and that are decodable in polynomial time are presented. The rate is the highest among those known to be achievable by CSS codes. Moreover, the best known lower bound on the greatest minimum distance of codes constructible in polynomial time is improved for a wide range.

arXiv:quant-ph/0610195•IEEE Transactions on Information Theory•Dec 1, 2008•54 citations

Quantum error correction against correlated noise

James Clemens, Shabnam Siddiqui, Julio R. Gea-Banacloche

We consider quantum error correction against correlated noise using simple and concatenated Calderbank-Shor-Steane codes as well as $n$-qubit repetition codes. We characterize the performance of various codes by means of the fidelity following the error correction of a single logical qubit in a quantum register. For concatenated codes we find a threshold in the single-qubit error rate below which the encoded qubit is perfectly protected. The threshold depends on the correlation strength of the noise and goes to zero for perfect correlation. Finally, we concatenate the traditional error correcting codes with a decoherence free subspace and evaluate the performance over the whole range from uncorrelated noise to perfectly correlated noise.

Physical Review A•Jun 14, 2004•67 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

Performance of quantum error correction with coherent errors

Eric Huang, Andrew C. Doherty, Steven T. Flammia

We compare the performance of quantum error correcting codes when memory errors are unitary with the more familiar case of dephasing noise. For a wide range of codes, we analytically compute the effective logical channel that results when the error correction steps are performed noiselessly. Our examples include the entire family of repetition codes, the five-qubit, Steane, Shor, and surface codes. When errors are measured in terms of the diamond norm, we find that the error correction is typically much more effective for unitary errors than for dephasing. We observe this behavior for a wide range of codes after a single level of encoding, and in the thresholds of concatenated codes using hard decoders. We show that this holds with great generality by proving a bound on the performance of any stabilizer code when the noise at the physical level is unitary. By comparing the diamond norm error ${D}_{\ensuremath{\diamond}}^{\ensuremath{'}}$ of the logical qubit with the same quantity at the physical level ${D}_{\ensuremath{\diamond}}$, we show that ${D}_{\ensuremath{\diamond}}^{\ensuremath{'}}\ensuremath{\le}c{D}_{\ensuremath{\diamond}}^{d}$ where $d$ is the distance of the code and $c$ is a constant that depends on the code but not on the error. This bound compares very favorably to the performance of error correction for dephasing noise and other Pauli channels, where an error correcting code of odd distance $d$ will exhibit a scaling ${D}_{\ensuremath{\diamond}}^{\ensuremath{'}}\ensuremath{\sim}{D}_{\ensuremath{\diamond}}^{(d+1)/2}$.

arXiv:1805.08227•Physical Review A•Feb 12, 2019•88 citations

An analysis of Shor and Steane code performance under coherent errors

Chaobin Liu

We derive explicit process matrices (effective channels) for the Shor code (a nine-qubit code) and the Steane code (a seven-qubit code) under any unital error channel applied to each physical qubit. These matrices provide valuable insights into the performance of these codes. The derived process matrix enables a rigorous proof that a concatenated code with a symmetric decoder can map an open set of arbitrary error channels to the identity channel. This result generalizes a previously established theorem, which was limited to an open set of diagonal error channels. For commonly studied coherent error models, we leverage the process matrices to perform precise analyses of code performance in terms of average gate infidelity and diamond distance, comparing the physical error channels to the resulting effective channels after error correction. These results refine and extend related findings in prior works.

International Journal of Quantum Information•Jun 17, 2026•0 citations

The Effects of Quantum Error Correction on Noisy Systems

Stefanie J. Beale

Full accuracy simulations of quantum systems are very costly, and as a result most studies \nof quantum error correction assume a probabilistic Pauli error model, largely because such \nerrors can be e ciently simulated. Therefore, the behaviour of more general noise in a \nquantum error correcting code is poorly characterized. In this thesis, we present results which \ndemonstrate the scaling of the logical noise with respect to the physical delity, and argue \nthat the e ective logical noise approaches a Pauli channel as the code distance increases, \neven when no recovery operations are applied. As a result, we argue that the average logical \n delity can be used to accurately quantify the e ective logical noise, and to select recovery \noperations appropriate to the system. We further demonstrate that when physical noise \nacts on fewer than d qubits in an [[n; k; d]] code, the resultant noise is Pauli, and develop \na method for approximating the dominant contributions to the e ective logical noise up to \na speci ed precision in terms of the physical in delity. We derive conditions under which \nsets of recovery operations will produce equivalent logical noise channels, with examples of \nequivalencies in the 3 qubit repetition code, the 5 qubit code, the Steane code, and the Shor \ncode. We also provide a general expression for the e ective logical noise when the physical \nqubits undergo depolarizing or Pauli noise in a quantum error correcting code, examine the \nbehaviour of depolarizing noise under concatenation of the 5 qubit and Steane codes, and \npresent an algorithm for soft decoding which is not subject to statistical sampling, with an \nemphasis on the e ective behaviour of a concatenated 5 qubit code undergoing depolarizing \nnoise after applying a specialized version our soft decoding algorithm.

•Aug 23, 2018•0 citations
We apply a dynamical systems approach to concatenation of quantum error correcting codes, extending and generalizing the results of Rahn to both diagonal and nondiagonal channels. Our point of view is global: instead of focusing on particular types of noise channels, we study the geometry of the coding map as a discrete-time dynamical system on the entire space of noise channels. In the case of diagonal channels, we show that any code with distance at least three corrects (in the infinite concatenation limit) an open set of errors. For Calderbank–Shor–Steane (CSS) codes, we give a more precise characterization of that set. We show how to incorporate noise in the gates, thus completing the framework. We derive some general bounds for noise channels, which allows us to analyze several codes in detail.
A method for concatenating quantum error-correcting codes is presented. The method is applicable to a wide class of quantum error-correcting codes known as Calderbank-Shor-Steane (CSS) codes. As a result, codes that achieve a high rate in the Shannon-theoretic sense and that are decodable in polynomial time are presented. The rate is the highest among those known to be achievable by CSS codes. Moreover, the best known lower bound on the greatest minimum distance of codes constructible in polynomial time is improved for a wide range.
We consider quantum error correction against correlated noise using simple and concatenated Calderbank-Shor-Steane codes as well as nnn-qubit repetition codes. We characterize the performance of various codes by means of the fidelity following the error correction of a single logical qubit in a quantum register. For concatenated codes we find a threshold in the single-qubit error rate below which the encoded qubit is perfectly protected. The threshold depends on the correlation strength of the noise and goes to zero for perfect correlation. Finally, we concatenate the traditional error correcting codes with a decoherence free subspace and evaluate the performance over the whole range from uncorrelated noise to perfectly correlated noise.
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.
We compare the performance of quantum error correcting codes when memory errors are unitary with the more familiar case of dephasing noise. For a wide range of codes, we analytically compute the effective logical channel that results when the error correction steps are performed noiselessly. Our examples include the entire family of repetition codes, the five-qubit, Steane, Shor, and surface codes. When errors are measured in terms of the diamond norm, we find that the error correction is typically much more effective for unitary errors than for dephasing. We observe this behavior for a wide range of codes after a single level of encoding, and in the thresholds of concatenated codes using hard decoders. We show that this holds with great generality by proving a bound on the performance of any stabilizer code when the noise at the physical level is unitary. By comparing the diamond norm error ${D}_{\ensuremath{\diamond}}^{\ensuremath{'}}$ of the logical qubit with the same quantity at the physical level ${D}_{\ensuremath{\diamond}}$, we show that ${D}_{\ensuremath{\diamond}}^{\ensuremath{'}}\ensuremath{\le}c{D}_{\ensuremath{\diamond}}^{d}$ where ddd is the distance of the code and ccc is a constant that depends on the code but not on the error. This bound compares very favorably to the performance of error correction for dephasing noise and other Pauli channels, where an error correcting code of odd distance ddd will exhibit a scaling ${D}_{\ensuremath{\diamond}}^{\ensuremath{'}}\ensuremath{\sim}{D}_{\ensuremath{\diamond}}^{(d+1)/2}$.
We derive explicit process matrices (effective channels) for the Shor code (a nine-qubit code) and the Steane code (a seven-qubit code) under any unital error channel applied to each physical qubit. These matrices provide valuable insights into the performance of these codes. The derived process matrix enables a rigorous proof that a concatenated code with a symmetric decoder can map an open set of arbitrary error channels to the identity channel. This result generalizes a previously established theorem, which was limited to an open set of diagonal error channels. For commonly studied coherent error models, we leverage the process matrices to perform precise analyses of code performance in terms of average gate infidelity and diamond distance, comparing the physical error channels to the resulting effective channels after error correction. These results refine and extend related findings in prior works.
Full accuracy simulations of quantum systems are very costly, and as a result most studies \nof quantum error correction assume a probabilistic Pauli error model, largely because such \nerrors can be e ciently simulated. Therefore, the behaviour of more general noise in a \nquantum error correcting code is poorly characterized. In this thesis, we present results which \ndemonstrate the scaling of the logical noise with respect to the physical delity, and argue \nthat the e ective logical noise approaches a Pauli channel as the code distance increases, \neven when no recovery operations are applied. As a result, we argue that the average logical \n delity can be used to accurately quantify the e ective logical noise, and to select recovery \noperations appropriate to the system. We further demonstrate that when physical noise \nacts on fewer than d qubits in an [[n; k; d]] code, the resultant noise is Pauli, and develop \na method for approximating the dominant contributions to the e ective logical noise up to \na speci ed precision in terms of the physical in delity. We derive conditions under which \nsets of recovery operations will produce equivalent logical noise channels, with examples of \nequivalencies in the 3 qubit repetition code, the 5 qubit code, the Steane code, and the Shor \ncode. We also provide a general expression for the e ective logical noise when the physical \nqubits undergo depolarizing or Pauli noise in a quantum error correcting code, examine the \nbehaviour of depolarizing noise under concatenation of the 5 qubit and Steane codes, and \npresent an algorithm for soft decoding which is not subject to statistical sampling, with an \nemphasis on the e ective behaviour of a concatenated 5 qubit code undergoing depolarizing \nnoise after applying a specialized version our soft decoding algorithm.