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

Quantum Error Source and Channel Coding

Dennis G. Lucarelli

Published Apr 20, 2020• 0 citations
arXivHTMLPDF

Abstract

Quantum error correction draws many of its principles and constructions from classical coding theory, adapted to the unique aspects of quantum mechanics. Here we extend this correspondence to a block of logical qubits, each prepared in the same quantum code, by coupling the block through a classical error correcting code: syndrome qubits then carry error information from several logical qubits at once, and collective inference recovers the errors. Algebraically, the construction defines subgroups of the product stabilizer group corresponding to duals of classical codes, and we prove that a lookup table decoder corrects every error pattern respecting the correction radii of the two constituent codes. For classical algebraic code families, the number of syndrome qubits serving $L$ logical qubits scales as ${\cal O}(\log_2(L+1))$ at the code-capacity level, though at the price of stabilizer weight growing with the block length. An entropy bound shows that check weights need not grow with $L$. Under a phenomenological noise model, the same lookup table identifies measurement errors by nearest-neighbor post-processing, and classical algebraic decoders locate exactly the logical qubits carrying errors even with noisy syndromes. More broadly, we argue that quantum error correction, reduced to its functional core, is source compression in the sense of Shannon, whose source and channel coding theorems bound the overhead rates of quantum post-selection tasks.

DOI
10.48550/arxiv.2004.09479

Related papers

Channel-Adapted Quantum Error Correction

Andrew S. Fletcher

Quantum error correction (QEC) is an essential concept for any quantum information processing device. Typically, QEC is designed with minimal assumptions about the noise process; this generic assumption exacts a high cost in efficiency and performance. In physical systems, errors are not likely to be arbitrary; rather we will have reasonable models for the structure of quantum decoherence. We may choose quantum error correcting codes and recovery operations that specifically target the most likely errors. We present a convex optimization method to determine the optimal (in terms of average entanglement fidelity) recovery operation for a given channel, encoding, and information source. This is solvable via a semidefinite program (SDP). We present computational algorithms to generate near-optimal recovery operations structured to begin with a projective syndrome measurement. These structured operations are more computationally scalable than the SDP required for computing the optimal; we can thus numerically analyze longer codes. Using Lagrange duality, we bound the performance of the structured recovery operations and show that they are nearly optimal in many relevant cases. We present two classes of channel-adapted quantum error correcting codes specifically designed for the amplitude damping channel. These have significantly higher rates with shorter block lengths than corresponding generic quantum error correcting codes. Both classes are stabilizer codes, and have good fidelity performance with stabilizer recovery operations. The encoding, syndrome measurement, and syndrome recovery operations can all be implemented with Clifford group operations.

arXiv:0706.3400•Jun 22, 2007•28 citations

Metachecks in Bivariate Bicycle Codes: Syndrome Distance, Measurement Faults, and Repair Limits

Mohammad Rowshan

Faulty syndrome measurements can corrupt an otherwise correct quantum-error correction step. Bivariate bicycle (BB) codes contain dependent stabilizer checks, so every valid syndrome obeys additional parity constraints, or metachecks. We study how far this built-in redundancy can identify measurement faults and when the remaining ambiguity is unavoidable, while separately checking the code's logical structure. A logical decomposition is used as a preliminary safety check: it identifies a $k/2$-dimensional annihilator subspace and a $k/2$-dimensional colon quotient, and the minimum-weight logical need not be visible from the annihilator side alone. On the measurement side, translation symmetry partitions syndrome locations into classes that carry identical metacheck information. This gives an exact characterization of the leading single-fault ambiguity, a bound on how many fault locations can be distinguished, and a family-level repair limit when the encoded dimension stays bounded while the block length grows. Under a static-data assumption, the same calculation gives the minimum number of checks that must be remeasured to remove every single-fault ambiguity. Exact finite-code calculations illustrate both regimes: all single measurement faults are distinguishable in a 72-qubit BB code, whereas the 144-qubit Gross code merges its 72 syndrome locations into 36 indistinguishable pairs. In a 108-qubit example, one logical component first appears at weight 12 while the other contains a weight-10 logical. Sustained phenomenological experiments show that joint data--measurement decoding is more robust than a separated repair stage on the more ambiguous codes. The resulting tests apply to general two-block BB codes, including non-coprime periods and repeated-root cases.

quant-pharXiv:2609.39121•Oct 1, 2026•0 citations

Biased-Noise Quantum Reed-Solomon Codes and a Tornado Concatenation for Cat Qubits

Cheng-You Ho, Daniel Wang, Simba Shi +2 more

Dissipative cat qubits exponentially suppress one Pauli error channel with the mean photon number, leaving the conjugate bit-flip error as the dominant failure mode. This strong noise bias makes the full machinery of general quantum error correction unnecessary: a code need only protect against a single error type, and any classical linear code can be promoted to a Clifford stabilizer code that does exactly this. We use this observation to build a bit-flip-only quantum Reed-Solomon (RS) code. Starting from the maximum-distance-separable RS code [7, 3, 5] over GF($2^3$), we binary-expand it to the linear code [21, 9, 6] over GF(2) and realize it as a [[21, 9, $d_X = 6, d_Z = 1$]] bit-flip code whose stabilizers are products of $Z$ operators. Because no phase-flip correction is attempted, the construction discards the redundancy that standard quantum RS codes spend on correcting $Z$ errors -- which a strongly biased cat qubit renders unnecessary -- and yields a shallow Clifford circuit that samples directly in Stim. Errors are decoded by an optimal bounded-distance syndrome-lookup table. We then introduce a Tornado architecture: a two-layer concatenation that wraps every position of the outer RS code in an inner distance-three repetition code, yielding a [[63, 9, 18]] code decoded by a two-stage inner majority vote and outer lookup decoder. Monte-Carlo simulation shows that at a physical bit-flip rate $p = 0.1$ the Tornado code reaches a logical error rate $p_L \approx 5.3 \times 10^{-3}$, below both parent codes, and that its logical error rate scales as $p_L \propto p^6$ at low $p$, in contrast to $p^2$ for the repetition code and $p^3$ for the standalone RS code. We give the exact construction, the error and circuit model, an asymptotic scaling analysis, and an honest account of the overhead cost and single-shot assumptions.

quant-pharXiv:2607.13105•Jul 15, 2026•0 citations

Theory of quantum error-correcting codes

Emanuel H. Knill, Raymond Laflamme

Quantum error correction will be necessary for preserving coherent states against noise and other unwanted interactions in quantum computation and communication. We develop a general theory of quantum error correction based on encoding states into larger Hilbert spaces subject to known interactions. We obtain necessary and sufficient conditions for the perfect recovery of an encoded state after its degradation by an interaction. The conditions depend only on the behavior of the logical states. We use them to give a recovery-operator-independent definition of error-correcting codes. We relate this definition to four others: the existence of a left inverse of the interaction, an explicit representation of the error syndrome using tensor products, perfect recovery of the completely entangled state, and an information theoretic identity. Two notions of fidelity and error for imperfect recovery are introduced, one for pure and the other for entangled states. The latter is more appropriate when using codes in a quantum memory or in applications of quantum teleportation to communication. We show that the error for entangled states is bounded linearly by the error for pure states. A formal definition of independent interactions for qubits is given. This leads to lower bounds on the number of qubits required to correct e errors and a formal proof that the classical bounds on the probability of error of e-error-correcting codes applies to e-error-correcting quantum codes, provided that the interaction is dominated by an identity component.

Physical Review A•Feb 1, 1997•1,642 citations

Hierarchical Quantum Error Correction with Hypergraph Product Code and Rotated Surface Code

Junichi Haruna, Keisuke Fujii

Abstract We propose and analyze a hierarchical quantum error correction (QEC) scheme that concatenates hypergraph product (HGP) codes with rotated surface codes and that is compatible with quantum computers with only nearest-neighbor interactions. The outer code employs (3,4)-random HGP codes, known for their constant encoding rate and favorable distance scaling, while the inner code consists of a rotated surface code with distance 5, allowing hardware compatibility through lattice surgery. To address the decoding bottleneck, we utilize a soft-decision decoding strategy that combines belief propagation with ordered statistics decoding, enhanced by a syndrome-conditioned logical error probability computed via a tailored lookup table for the inner code. Numerical simulations under a code capacity noise model demonstrate that our hierarchical codes achieve logical error suppression below the threshold. Furthermore, we derive explicit conditions under which the proposed codes surpass surface codes as a QEC code in both qubit efficiency and error rate. In particular, for the size parameter $s \ge 4$ (which corresponds to 16 logical qubits) and the distance $d\ge 25$, our construction outperforms the rotated surface code in practical regimes with physical error rates around or less than $10^{-2}$. These results suggest that concatenated quantum low-density parity-check surface architectures can offer a scalable and resource-efficient path toward near-term fault-tolerant quantum computation.

arXiv:2505.18592•Progress of Theoretical and Experimental Physics•Sep 23, 2025•0 citations

Area Theorems for Quantum Error Correction

Avijit Mandal, Mert Gökduman, Henry D. Pfister

The extrinsic information transfer (EXIT) and generalized EXIT (GEXIT) area theorems provide fundamental conservation laws that connect the rate of classical codes to the performance of maximum-a-posteriori decoding on binary memoryless channels. In this work, we generalize these area theorems to quantum error correction. We first develop a coset-entropy formalism for nested linear codes, where the message specifies a coset and encoder randomization selects a codeword within that coset. The area under the resulting coset (G)EXIT function equals the normalized dimension of the quotient. For stabilizer codes, the measured syndrome restricts the Pauli error but does not always determine its logical effect, and the remaining uncertainty is an entropy over logical correction classes. We show that this entropy equals a classical coset entropy associated with the stabilizer group and the Pauli operators that commute with it. The resulting quantum GEXIT function has area equal to the number of encoded qubits per channel use for any stabilizer code, and this applies to the depolarizing channel through its joint four-valued Pauli-error distribution. For CSS codes on the quantum erasure channel and under independent bit- and phase-flip noise, the logical correction problem separates into two binary coset-decoding problems. On the quantum erasure channel, the duality between the stabilizer group and the Pauli operators that commute with it gives a folding identity at complementary erasure probabilities. Using this and the area theorem, we derive an upper bound on the rate of code families with vanishing logical error probability that matches the capacity of the quantum erasure channel. For the depolarizing channel, we also derive a rate-dependent converse, using a connection between correction-class entropy and coherent information to establish an inequality involving the complementary channel.

cs.ITCross-listedarXiv:2610.22710•Oct 19, 2026•0 citations
Quantum error correction draws many of its principles and constructions from classical coding theory, adapted to the unique aspects of quantum mechanics. Here we extend this correspondence to a block of logical qubits, each prepared in the same quantum code, by coupling the block through a classical error correcting code: syndrome qubits then carry error information from several logical qubits at once, and collective inference recovers the errors. Algebraically, the construction defines subgroups of the product stabilizer group corresponding to duals of classical codes, and we prove that a lookup table decoder corrects every error pattern respecting the correction radii of the two constituent codes. For classical algebraic code families, the number of syndrome qubits serving LLL logical qubits scales as O(log⁡2(L+1)){\cal O}(\log_2(L+1))O(log2​(L+1)) at the code-capacity level, though at the price of stabilizer weight growing with the block length. An entropy bound shows that check weights need not grow with LLL. Under a phenomenological noise model, the same lookup table identifies measurement errors by nearest-neighbor post-processing, and classical algebraic decoders locate exactly the logical qubits carrying errors even with noisy syndromes. More broadly, we argue that quantum error correction, reduced to its functional core, is source compression in the sense of Shannon, whose source and channel coding theorems bound the overhead rates of quantum post-selection tasks.
Quantum error correction (QEC) is an essential concept for any quantum information processing device. Typically, QEC is designed with minimal assumptions about the noise process; this generic assumption exacts a high cost in efficiency and performance. In physical systems, errors are not likely to be arbitrary; rather we will have reasonable models for the structure of quantum decoherence. We may choose quantum error correcting codes and recovery operations that specifically target the most likely errors. We present a convex optimization method to determine the optimal (in terms of average entanglement fidelity) recovery operation for a given channel, encoding, and information source. This is solvable via a semidefinite program (SDP). We present computational algorithms to generate near-optimal recovery operations structured to begin with a projective syndrome measurement. These structured operations are more computationally scalable than the SDP required for computing the optimal; we can thus numerically analyze longer codes. Using Lagrange duality, we bound the performance of the structured recovery operations and show that they are nearly optimal in many relevant cases. We present two classes of channel-adapted quantum error correcting codes specifically designed for the amplitude damping channel. These have significantly higher rates with shorter block lengths than corresponding generic quantum error correcting codes. Both classes are stabilizer codes, and have good fidelity performance with stabilizer recovery operations. The encoding, syndrome measurement, and syndrome recovery operations can all be implemented with Clifford group operations.
Faulty syndrome measurements can corrupt an otherwise correct quantum-error correction step. Bivariate bicycle (BB) codes contain dependent stabilizer checks, so every valid syndrome obeys additional parity constraints, or metachecks. We study how far this built-in redundancy can identify measurement faults and when the remaining ambiguity is unavoidable, while separately checking the code's logical structure. A logical decomposition is used as a preliminary safety check: it identifies a k/2k/2k/2-dimensional annihilator subspace and a k/2k/2k/2-dimensional colon quotient, and the minimum-weight logical need not be visible from the annihilator side alone. On the measurement side, translation symmetry partitions syndrome locations into classes that carry identical metacheck information. This gives an exact characterization of the leading single-fault ambiguity, a bound on how many fault locations can be distinguished, and a family-level repair limit when the encoded dimension stays bounded while the block length grows. Under a static-data assumption, the same calculation gives the minimum number of checks that must be remeasured to remove every single-fault ambiguity. Exact finite-code calculations illustrate both regimes: all single measurement faults are distinguishable in a 72-qubit BB code, whereas the 144-qubit Gross code merges its 72 syndrome locations into 36 indistinguishable pairs. In a 108-qubit example, one logical component first appears at weight 12 while the other contains a weight-10 logical. Sustained phenomenological experiments show that joint data--measurement decoding is more robust than a separated repair stage on the more ambiguous codes. The resulting tests apply to general two-block BB codes, including non-coprime periods and repeated-root cases.
Dissipative cat qubits exponentially suppress one Pauli error channel with the mean photon number, leaving the conjugate bit-flip error as the dominant failure mode. This strong noise bias makes the full machinery of general quantum error correction unnecessary: a code need only protect against a single error type, and any classical linear code can be promoted to a Clifford stabilizer code that does exactly this. We use this observation to build a bit-flip-only quantum Reed-Solomon (RS) code. Starting from the maximum-distance-separable RS code [7, 3, 5] over GF(232^323), we binary-expand it to the linear code [21, 9, 6] over GF(2) and realize it as a [[21, 9, dX=6,dZ=1d_X = 6, d_Z = 1dX​=6,dZ​=1]] bit-flip code whose stabilizers are products of ZZZ operators. Because no phase-flip correction is attempted, the construction discards the redundancy that standard quantum RS codes spend on correcting ZZZ errors -- which a strongly biased cat qubit renders unnecessary -- and yields a shallow Clifford circuit that samples directly in Stim. Errors are decoded by an optimal bounded-distance syndrome-lookup table. We then introduce a Tornado architecture: a two-layer concatenation that wraps every position of the outer RS code in an inner distance-three repetition code, yielding a [[63, 9, 18]] code decoded by a two-stage inner majority vote and outer lookup decoder. Monte-Carlo simulation shows that at a physical bit-flip rate p=0.1p = 0.1p=0.1 the Tornado code reaches a logical error rate pL≈5.3×10−3p_L \approx 5.3 \times 10^{-3}pL​≈5.3×10−3, below both parent codes, and that its logical error rate scales as pL∝p6p_L \propto p^6pL​∝p6 at low ppp, in contrast to p2p^2p2 for the repetition code and p3p^3p3 for the standalone RS code. We give the exact construction, the error and circuit model, an asymptotic scaling analysis, and an honest account of the overhead cost and single-shot assumptions.
Quantum error correction will be necessary for preserving coherent states against noise and other unwanted interactions in quantum computation and communication. We develop a general theory of quantum error correction based on encoding states into larger Hilbert spaces subject to known interactions. We obtain necessary and sufficient conditions for the perfect recovery of an encoded state after its degradation by an interaction. The conditions depend only on the behavior of the logical states. We use them to give a recovery-operator-independent definition of error-correcting codes. We relate this definition to four others: the existence of a left inverse of the interaction, an explicit representation of the error syndrome using tensor products, perfect recovery of the completely entangled state, and an information theoretic identity. Two notions of fidelity and error for imperfect recovery are introduced, one for pure and the other for entangled states. The latter is more appropriate when using codes in a quantum memory or in applications of quantum teleportation to communication. We show that the error for entangled states is bounded linearly by the error for pure states. A formal definition of independent interactions for qubits is given. This leads to lower bounds on the number of qubits required to correct e errors and a formal proof that the classical bounds on the probability of error of e-error-correcting codes applies to e-error-correcting quantum codes, provided that the interaction is dominated by an identity component.
Abstract We propose and analyze a hierarchical quantum error correction (QEC) scheme that concatenates hypergraph product (HGP) codes with rotated surface codes and that is compatible with quantum computers with only nearest-neighbor interactions. The outer code employs (3,4)-random HGP codes, known for their constant encoding rate and favorable distance scaling, while the inner code consists of a rotated surface code with distance 5, allowing hardware compatibility through lattice surgery. To address the decoding bottleneck, we utilize a soft-decision decoding strategy that combines belief propagation with ordered statistics decoding, enhanced by a syndrome-conditioned logical error probability computed via a tailored lookup table for the inner code. Numerical simulations under a code capacity noise model demonstrate that our hierarchical codes achieve logical error suppression below the threshold. Furthermore, we derive explicit conditions under which the proposed codes surpass surface codes as a QEC code in both qubit efficiency and error rate. In particular, for the size parameter s≥4s \ge 4s≥4 (which corresponds to 16 logical qubits) and the distance d≥25d\ge 25d≥25, our construction outperforms the rotated surface code in practical regimes with physical error rates around or less than 10−210^{-2}10−2. These results suggest that concatenated quantum low-density parity-check surface architectures can offer a scalable and resource-efficient path toward near-term fault-tolerant quantum computation.
The extrinsic information transfer (EXIT) and generalized EXIT (GEXIT) area theorems provide fundamental conservation laws that connect the rate of classical codes to the performance of maximum-a-posteriori decoding on binary memoryless channels. In this work, we generalize these area theorems to quantum error correction. We first develop a coset-entropy formalism for nested linear codes, where the message specifies a coset and encoder randomization selects a codeword within that coset. The area under the resulting coset (G)EXIT function equals the normalized dimension of the quotient. For stabilizer codes, the measured syndrome restricts the Pauli error but does not always determine its logical effect, and the remaining uncertainty is an entropy over logical correction classes. We show that this entropy equals a classical coset entropy associated with the stabilizer group and the Pauli operators that commute with it. The resulting quantum GEXIT function has area equal to the number of encoded qubits per channel use for any stabilizer code, and this applies to the depolarizing channel through its joint four-valued Pauli-error distribution. For CSS codes on the quantum erasure channel and under independent bit- and phase-flip noise, the logical correction problem separates into two binary coset-decoding problems. On the quantum erasure channel, the duality between the stabilizer group and the Pauli operators that commute with it gives a folding identity at complementary erasure probabilities. Using this and the area theorem, we derive an upper bound on the rate of code families with vanishing logical error probability that matches the capacity of the quantum erasure channel. For the depolarizing channel, we also derive a rate-dependent converse, using a connection between correction-class entropy and coherent information to establish an inequality involving the complementary channel.