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/0111003

Exact and Approximate Performance of Concatenated Quantum Codes

Benjamin Rahn, Andrew C. Doherty, Hideo Mabuchi

Published Nov 1, 2001• 2 citations
arXivHTMLPDF

Abstract

We derive the effective channel for a logical qubit protected by an arbitrary quantum error-correcting code, and derive the map between channels induced by concatenation. For certain codes in the presence of single-bit Pauli errors, we calculate the exact threshold error probability for perfect fidelity in the infinite concatenation limit. We then use the control theory technique of balanced truncation to find low-order non-asymptotic approximations for the effective channel dynamics.

DOI
10.48550/arxiv.quant-ph/0111003

Related papers

Exact performance of concatenated quantum codes

Benjamin Rahn, Andrew C. Doherty, Hideo Mabuchi

When a logical qubit is protected using a quantum error-correcting code, the net effect of coding, decoherence (a physical channel acting on qubits in the codeword) and recovery can be represented exactly by an effective channel acting directly on the logical qubit. In this paper we describe a procedure for deriving the map between physical and effective channels that results from a given coding and recovery procedure. We show that the map for a concatenation of codes is given by the composition of the maps for the constituent codes. This perspective leads us to an efficient means for calculating the exact performance of quantum codes with arbitrary levels of concatenation. We present explicit results for single-bit Pauli channels. For certain codes under the symmetric depolarizing channel, we use the coding maps to compute exact threshold error probabilities for achievability of perfect fidelity in the infinite concatenation limit.

arXiv:quant-ph/0206061•Physical Review A•Sep 13, 2002•64 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

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

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

Thresholds for Universal Concatenated Quantum Codes

Christopher Chamberland, Tomas Jochym-O’Connor, Raymond Laflamme

Quantum error correction and fault tolerance make it possible to perform quantum computations in the presence of imprecision and imperfections of realistic devices. An important question is to find the noise rate at which errors can be arbitrarily suppressed. By concatenating the 7-qubit Steane and 15-qubit Reed-Muller codes, the 105-qubit code enables a universal set of fault-tolerant gates despite not all of them being transversal. Importantly, the cnot gate remains transversal in both codes, and as such has increased error protection relative to the other single qubit logical gates. We show that while the level-1 pseudothreshold for the concatenated scheme is limited by the logical Hadamard gate, the error suppression of the logical cnot gates allows for the asymptotic threshold to increase by orders of magnitude at higher levels. We establish a lower bound of 1.28×10^{-3} for the asymptotic threshold of this code, which is competitive with known concatenated models and does not rely on ancillary magic state preparation for universal computation.

arXiv:1603.02704•Physical Review Letters•Jun 28, 2016•49 citations

Error correction for mutually interacting qubits

Julio R. Gea-Banacloche

For a simple model of mutually interacting qubits it is shown how the errors induced by mutual interactions can be eliminated using concatenated coding. The model is solved exactly for arbitrary interaction strength, for two well-known codes, one and two levels deep: this allows one to see under which circumstances error amplitudes add coherently or incoherently. For deeper concatenation, approximate results are derived that make it possible to calculate an approximate ``threshold'' value for the product of interaction strength and free evolution time, below which the failure probability for an encoded qubit decreases exponentially with the depth of the encoding. The results suggest that concatenated coding could fully handle the errors arising from mutual interactions, at no extra cost, in terms of resources needed, than what would be required to deal with random environmental errors.

arXiv:quant-ph/0008027•Physical Review A•Nov 14, 2000•5 citations
We derive the effective channel for a logical qubit protected by an arbitrary quantum error-correcting code, and derive the map between channels induced by concatenation. For certain codes in the presence of single-bit Pauli errors, we calculate the exact threshold error probability for perfect fidelity in the infinite concatenation limit. We then use the control theory technique of balanced truncation to find low-order non-asymptotic approximations for the effective channel dynamics.
When a logical qubit is protected using a quantum error-correcting code, the net effect of coding, decoherence (a physical channel acting on qubits in the codeword) and recovery can be represented exactly by an effective channel acting directly on the logical qubit. In this paper we describe a procedure for deriving the map between physical and effective channels that results from a given coding and recovery procedure. We show that the map for a concatenation of codes is given by the composition of the maps for the constituent codes. This perspective leads us to an efficient means for calculating the exact performance of quantum codes with arbitrary levels of concatenation. We present explicit results for single-bit Pauli channels. For certain codes under the symmetric depolarizing channel, we use the coding maps to compute exact threshold error probabilities for achievability of perfect fidelity in the infinite concatenation limit.
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, 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.
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.
Quantum error correction and fault tolerance make it possible to perform quantum computations in the presence of imprecision and imperfections of realistic devices. An important question is to find the noise rate at which errors can be arbitrarily suppressed. By concatenating the 7-qubit Steane and 15-qubit Reed-Muller codes, the 105-qubit code enables a universal set of fault-tolerant gates despite not all of them being transversal. Importantly, the cnot gate remains transversal in both codes, and as such has increased error protection relative to the other single qubit logical gates. We show that while the level-1 pseudothreshold for the concatenated scheme is limited by the logical Hadamard gate, the error suppression of the logical cnot gates allows for the asymptotic threshold to increase by orders of magnitude at higher levels. We establish a lower bound of 1.28×10^{-3} for the asymptotic threshold of this code, which is competitive with known concatenated models and does not rely on ancillary magic state preparation for universal computation.
For a simple model of mutually interacting qubits it is shown how the errors induced by mutual interactions can be eliminated using concatenated coding. The model is solved exactly for arbitrary interaction strength, for two well-known codes, one and two levels deep: this allows one to see under which circumstances error amplitudes add coherently or incoherently. For deeper concatenation, approximate results are derived that make it possible to calculate an approximate ``threshold'' value for the product of interaction strength and free evolution time, below which the failure probability for an encoded qubit decreases exponentially with the depth of the encoding. The results suggest that concatenated coding could fully handle the errors arising from mutual interactions, at no extra cost, in terms of resources needed, than what would be required to deal with random environmental errors.