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:1805.08227 · Physical Review A

Performance of quantum error correction with coherent errors

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

Published Feb 12, 2019• 88 citations
arXivHTMLPDF

Abstract

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}$.

DOI
10.1103/physreva.99.022313

Related papers

Modeling coherent errors in quantum error correction

Daniel Greenbaum, Zachary Dutton

Analysis of quantum error correcting codes is typically done using a stochastic, Pauli channel error model for describing the noise on physical qubits. However, it was recently found that coherent errors (systematic rotations) on physical data qubits result in both physical and logical error rates that differ significantly from those predicted by a Pauli model. Here we examine the accuracy of the Pauli approximation for noise containing coherent errors (characterized by a rotation angle ) under the repetition code. We derive an analytic expression for the logical error channel as a function of arbitrary code distance d and concatenation level n , in the small error limit. We find that coherent physical errors result in logical errors that are partially coherent and therefore non-Pauli. However, the coherent part of the logical error is negligible at fewer than error correction cycles when the decoder is optimized for independent Pauli errors, thus providing a regime of validity for the Pauli approximation. Above this number of correction cycles, the persistent coherent logical error will cause logical failure more quickly than the Pauli model would predict, and this may need to be combated with coherent suppression methods at the physical level or larger codes.

arXiv:1612.03908•Quantum Science and Technology•Dec 20, 2017•90 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

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

Coherence in logical quantum channels

Joseph K. Iverson, John P. Preskill

Abstract We study the effectiveness of quantum error correction against coherent noise. Coherent errors (for example, unitary noise) can interfere constructively, so that in some cases the average infidelity of a quantum circuit subjected to coherent errors may increase quadratically with the circuit size; in contrast, when errors are incoherent (for example, depolarizing noise), the average infidelity increases at worst linearly with circuit size. We consider the performance of quantum stabilizer codes against a noise model in which a unitary rotation is applied to each qubit, where the axes and angles of rotation are nearly the same for all qubits. In particular, we show that for the toric code subject to such independent coherent noise, and for minimal-weight decoding, the logical channel after error correction becomes increasingly incoherent as the length of the code increases, provided the noise strength decays inversely with the code distance. A similar conclusion holds for weakly correlated coherent noise. Our methods can also be used for analyzing the performance of other codes and fault-tolerant protocols against coherent noise. However, our result does not show that the coherence of the logical channel is suppressed in the more physically relevant case where the noise strength is held constant as the code block grows, and we recount the difficulties that prevented us from extending the result to that case. Nevertheless our work supports the idea that fault-tolerant quantum computing schemes will work effectively against coherent noise, providing encouraging news for quantum hardware builders who worry about the damaging effects of control errors and coherent interactions with the environment.

arXiv:1912.04319•New Journal of Physics•Apr 29, 2020•77 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

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•5 citations
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⋄\ensuremath′{D}_{\ensuremath{\diamond}}^{\ensuremath{'}}D\ensuremath⋄\ensuremath′​ of the logical qubit with the same quantity at the physical level D\ensuremath⋄{D}_{\ensuremath{\diamond}}D\ensuremath⋄​, we show that D\ensuremath⋄\ensuremath′\ensuremath≤cD\ensuremath⋄d{D}_{\ensuremath{\diamond}}^{\ensuremath{'}}\ensuremath{\le}c{D}_{\ensuremath{\diamond}}^{d}D\ensuremath⋄\ensuremath′​\ensuremath≤cD\ensuremath⋄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⋄\ensuremath′\ensuremath∼D\ensuremath⋄(d+1)/2{D}_{\ensuremath{\diamond}}^{\ensuremath{'}}\ensuremath{\sim}{D}_{\ensuremath{\diamond}}^{(d+1)/2}D\ensuremath⋄\ensuremath′​\ensuremath∼D\ensuremath⋄(d+1)/2​.
Analysis of quantum error correcting codes is typically done using a stochastic, Pauli channel error model for describing the noise on physical qubits. However, it was recently found that coherent errors (systematic rotations) on physical data qubits result in both physical and logical error rates that differ significantly from those predicted by a Pauli model. Here we examine the accuracy of the Pauli approximation for noise containing coherent errors (characterized by a rotation angle ) under the repetition code. We derive an analytic expression for the logical error channel as a function of arbitrary code distance d and concatenation level n , in the small error limit. We find that coherent physical errors result in logical errors that are partially coherent and therefore non-Pauli. However, the coherent part of the logical error is negligible at fewer than error correction cycles when the decoder is optimized for independent Pauli errors, thus providing a regime of validity for the Pauli approximation. Above this number of correction cycles, the persistent coherent logical error will cause logical failure more quickly than the Pauli model would predict, and this may need to be combated with coherent suppression methods at the physical level or larger codes.
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.
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.
Abstract We study the effectiveness of quantum error correction against coherent noise. Coherent errors (for example, unitary noise) can interfere constructively, so that in some cases the average infidelity of a quantum circuit subjected to coherent errors may increase quadratically with the circuit size; in contrast, when errors are incoherent (for example, depolarizing noise), the average infidelity increases at worst linearly with circuit size. We consider the performance of quantum stabilizer codes against a noise model in which a unitary rotation is applied to each qubit, where the axes and angles of rotation are nearly the same for all qubits. In particular, we show that for the toric code subject to such independent coherent noise, and for minimal-weight decoding, the logical channel after error correction becomes increasingly incoherent as the length of the code increases, provided the noise strength decays inversely with the code distance. A similar conclusion holds for weakly correlated coherent noise. Our methods can also be used for analyzing the performance of other codes and fault-tolerant protocols against coherent noise. However, our result does not show that the coherence of the logical channel is suppressed in the more physically relevant case where the noise strength is held constant as the code block grows, and we recount the difficulties that prevented us from extending the result to that case. Nevertheless our work supports the idea that fault-tolerant quantum computing schemes will work effectively against coherent noise, providing encouraging news for quantum hardware builders who worry about the damaging effects of control errors and coherent interactions with the environment.
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.
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.