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

Area Theorems for Quantum Error Correction

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

cs.ITquant-phSubmitted Oct 15, 2026• Announced Oct 19, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

AI Summary

The paper asks whether classical EXIT/GEXIT area laws have counterparts for quantum stabilizer decoding that account for degeneracy. It develops a coset-entropy formalism for nested classical codes and identifies stabilizer logical-correction uncertainty $H(M\mid S)$ with classical coset-decoding entropy for $\mathcal S\subseteq\mathcal S^\perp$. For every $[[n,k]]$ stabilizer code, the normalized entropy derivative defines an EXIT/GEXIT function lying in $[0,1]$ with integral $k/n$. This holds for quantum erasures and depolarizing noise; the latter uses the full correlated Pauli distribution and parameter $a=h_4(p)/2$, where $h_4(p)=h_2(p)+p\log_2 3$. CSS correction entropy separates into two binary coset entropies for erasures and independent bit/phase flips. For erasures, symplectic shortening/puncturing duality gives $A(\epsilon)+A(1-\epsilon)=2k$. Together with the slope bound and Fano’s inequality, this recovers the capacity-matching converse $R\leq1-2\epsilon$. For depolarizing noise, relating correction entropy to coherent information and extracting another depolarizing channel from the complementary output yields $R\leq[(h_4(f(p))-h_4(p))/2]^+$, with $f(p)=(3-2p-2\sqrt{3p(1-p)})/4$. This bound vanishes at the antidegradability point $p=1/4$. Numerical checks use large surface and bivariate-bicycle codes for erasures and exhaustive small-code calculations for depolarizing noise. Results assume code-capacity noise and perfect syndrome measurements. The depolarizing converse is not competitive with the best known capacity upper bounds; practical-decoder design and circuit-level extensions remain prospective.

Little sign of AI-generated textAI use disclosedIncremental
The authors also used Codex and Claude Code to refine the scripts that generate the numerical results and to draft a detailed discussion of these results.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
This work will be presented in part at ITW 2026 in Tempe, Arizona

Related papers

The Landauer Equality for Quantum Error Correction

Rolando P. Hong Enriquez

Quantum error correction protects logical qubits from decoherence but requires repeated syndrome extraction whose fundamental thermodynamic cost has not been characterized exactly. We prove five theorems and two corollaries that supply this characterization for stabilizer codes. First, a no-go result establishes that every error-correction cycle requires strictly positive work, ruling out passive error correction. Second, a duality identity shows that the combined measurement and erasure cost per syndrome-extraction round is determined solely by the number of stabilizer generators; only the split between measurement and erasure depends on the error rate. Third, a coherence dissipation theorem quantifies the additional irreversible work generated when projective stabilizer measurements destroy quantum coherence in the data register. CSS codes eliminate this cost for generators aligned with the noise channel’s eigenbasis, yielding a thermodynamic criterion for code selection under non-Pauli noise. Fourth, a Crooks fluctuation theorem for the full syndrome cycle yields a Jarzynski equality and exponential tail bounds on rare work fluctuations. Fifth, a variance formula captures the effect of syndrome correlations among stabilizers that share physical qubits. We evaluate all results across eleven codes, from a three-qubit repetition code to a 144-qubit quantum low-density parity-check code, establishing a Pareto trade-off between thermodynamic cost and error-suppression capability. Comparison with four experimental platforms—two superconducting, one trapped-ion, and one neutral-atom—shows that current hardware operates five to eleven orders of magnitude above the Landauer limit, with control and readout hardware, not syndrome extraction, as the dominant source of dissipation.

•Mar 9, 2026•0 citations

Quantum Error Source and Channel Coding

Dennis G. Lucarelli

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.

arXiv:2004.09479•Apr 20, 2020•0 citations

Hierarchy of Rényi Coherent Information in Stabilizer Codes

Akash Vijay, Luis Colmenarez, Jong Yeon Lee

Rényi coherent information, a computable proxy for the von Neumann coherent information, is widely used to study mixed-state phases of matter and decodability transitions in noisy quantum error-correcting codes. However, being a difference of two Rényi entropies, it need not be monotonic in the Rényi index, and lacks the operational meaning of its von Neumann counterpart. Here we address both issues for stabilizer codes. First, for Pauli noise generated by independent Bernoulli events, we prove that the Rényi-$n$ coherent information is nondecreasing in $n \in \mathbb{Z}^+$. This follows from a general theorem: if independent random bits are mapped linearly to a fine label $T$ and a coarse label $C$, then the Rényi entropy difference $H_n(C)-H_n(T)$ is nondecreasing in $n$. For stabilizer codes, $T$ is the joint syndrome--logical class and $C$ is the syndrome, and the difference is the Rényi-$n$ coherent information up to a constant. The same theorem covers classical linear codes and independent detector error models. Second, for arbitrary stochastic Pauli noise, we give the Rényi-$n$ coherent information an operational meaning via postselection on matching syndromes between one data block and $n-1$ auxiliary blocks. We determine when this defines a quantum channel and show that saturation of the Rényi-$n$ coherent information is equivalent to asymptotically perfect recovery of the postselected channel. Moreover, the Rényi-$n$ coherent information also upper-bounds the ordinary coherent information achievable after any syndrome-conditioned recovery.

quant-pharXiv:2609.11930•Sep 11, 2026•6 citations

Conservation laws for coding

Cyril Méasson

This work deals with coding systems based on sparse graph codes. The key issue we address is the relationship between iterative (in particular belief propagation) and maximum a posteriori decoding. We show that between the two there is a fundamental connection, which is reminiscent of the Maxwell construction in thermodynamics. The main objects we consider are EXIT-like functions. EXIT functions were originally introduced as handy tools for the design of iterative coding systems. It gradually became clear that EXIT functions possess several fundamental properties. Many of these properties, however, apply only to the erasure case. This motivates us to introduce GEXIT functions that coincide with EXIT functions over the erasure channel. In many aspects, GEXIT functions over general memoryless output-symmetric channels play the same role as EXIT functions do over the erasure channel. In particular, GEXIT functions are characterized by the general area theorem. As a first consequence, we demonstrate that in order for the rate of an ensemble of codes to approach the capacity under belief propagation decoding, the GEXIT functions of the component codes have to be matched perfectly. This statement was previously known as the matching condition for the erasure case. We then use these GEXIT functions to show that in the limit of large blocklengths a fundamental connection appears between belief propagation and maximum a posteriori decoding. A decoding algorithm, which we call Maxwell decoder, provides an operational interpretation of this relationship for the erasure case. Both the algorithm and the analysis of the decoder are the translation of the Maxwell construction from statistical mechanics to the context of probabilistic decoding. We take the first steps to extend this construction to general memoryless output-symmetric channels. More exactly, a general upper bound on the maximum a posteriori threshold for sparse graph codes is given. It is conjectured that the fundamental connection between belief propagation and maximum a posteriori decoding carries over to the general case.

•Jan 1, 2006•29 citations

Tapestry of dualities in decohered quantum error correction codes

Kaixiang Su, Zhou Yang, Chao‐Ming Jian

Quantum error correction (QEC) codes protect quantum information from errors due to decoherence. Many of them also serve as prototypical models for exotic topological quantum matters. Investigating the behavior of the QEC codes under decoherence sheds light on not only the codes' robustness against errors but also new out-of-equilibrium quantum phases driven by decoherence. The phase transitions, including the error threshold, of the decohered QEC codes can be probed by the systems' R\'enyi entropies ${S}_{R}$ with different R\'enyi indices $R$. In this paper, we study the general construction of the statistical models that characterize the R\'enyi entropies of QEC codes decohered by Pauli noise. We show that these statistical models can be organized into a ``tapestry'' woven by rich duality relations among them. For Calderbank-Shor-Steane (CSS) codes with bit-flip and phase-flip errors, we show that each R\'enyi entropy is captured by a pair of dual statistical models with randomness. For $R=2,3,\ensuremath{\infty}$, there are additional dualities that map between the two error types, relating the critical bit-flip and phase-flip error rates of the decoherence-induced phase transitions in the CSS codes. For CSS codes with an ``$em$ symmetry'' between the $X$-type and the $Z$-type stabilizers, the dualities with $R=2,3,\ensuremath{\infty}$ become self-dualities with super-universal self-dual error rates. These self-dualities strongly constrain the phase transitions of the code signaled by ${S}_{R=2,3,\ensuremath{\infty}}$. For general stabilizer codes decohered by generic Pauli noise, we also construct the statistical models that characterize the systems' entropies and obtain general duality relations between Pauli noise with different error rates.

arXiv:2401.17359•Physical review. B./Physical review. B•Aug 28, 2024•40 citations

The Generalized Area Theorem and Some of its Consequences

Cyril Méasson, Andrea Montanari A, Thomas J. Richardson +1 more

There is a fundamental relationship between belief propagation (BP) and maximuma posterioridecoding. The case of transmission over the binary erasure channel was investigated in detail in a companion paper (C. MEacuteasson, A. Montanari, and R. Urbanke, "Maxwell's construction: The hidden bridge between iterative and maximum a posteriori decoding,"IEEE Transactions on Information Theory, submitted for publication). This paper investigates the extension to general memoryless channels (paying special attention to the binary case). An area theorem for transmission over general memoryless channels is introduced and some of its many consequences are discussed. We show that this area theorem gives rise to an upper bound on the maximuma posteriorithreshold for sparse graph codes. In situations where this bound is tight, the extrinsic soft bit estimates delivered by the BP decoder coincide with the correcta posterioriprobabilities above the maximuma posteriorithreshold. More generally, it is conjectured that the fundamental relationship between the maximuma posterioriprobability (MAP) and the BP decoder which was observed for transmission over the binary erasure channel carries over to the general case. We finally demonstrate that in order for the design rate of an ensemble to approach the capacity under BP decoding the component codes have to be perfectly matched, a statement which is well known for the special case of transmission over the binary erasure channel.

arXiv:cs/0511039•IEEE Transactions on Information Theory•Oct 27, 2009•144 citations
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.
The paper asks whether classical EXIT/GEXIT area laws have counterparts for quantum stabilizer decoding that account for degeneracy. It develops a coset-entropy formalism for nested classical codes and identifies stabilizer logical-correction uncertainty H(M∣S)H(M\mid S)H(M∣S) with classical coset-decoding entropy for S⊆S⊥\mathcal S\subseteq\mathcal S^\perpS⊆S⊥.
For every [[n,k]][[n,k]][[n,k]] stabilizer code, the normalized entropy derivative defines an EXIT/GEXIT function lying in [0,1][0,1][0,1] with integral k/nk/nk/n. This holds for quantum erasures and depolarizing noise; the latter uses the full correlated Pauli distribution and parameter a=h4(p)/2a=h_4(p)/2a=h4​(p)/2, where h4(p)=h2(p)+plog⁡23h_4(p)=h_2(p)+p\log_2 3h4​(p)=h2​(p)+plog2​3. CSS correction entropy separates into two binary coset entropies for erasures and independent bit/phase flips.
For erasures, symplectic shortening/puncturing duality gives A(ϵ)+A(1−ϵ)=2kA(\epsilon)+A(1-\epsilon)=2kA(ϵ)+A(1−ϵ)=2k. Together with the slope bound and Fano’s inequality, this recovers the capacity-matching converse R≤1−2ϵR\leq1-2\epsilonR≤1−2ϵ. For depolarizing noise, relating correction entropy to coherent information and extracting another depolarizing channel from the complementary output yields R≤[(h4(f(p))−h4(p))/2]+R\leq[(h_4(f(p))-h_4(p))/2]^+R≤[(h4​(f(p))−h4​(p))/2]+, with f(p)=(3−2p−23p(1−p))/4f(p)=(3-2p-2\sqrt{3p(1-p)})/4f(p)=(3−2p−23p(1−p)​)/4. This bound vanishes at the antidegradability point p=1/4p=1/4p=1/4.
Numerical checks use large surface and bivariate-bicycle codes for erasures and exhaustive small-code calculations for depolarizing noise. Results assume code-capacity noise and perfect syndrome measurements. The depolarizing converse is not competitive with the best known capacity upper bounds; practical-decoder design and circuit-level extensions remain prospective.
Quantum error correction protects logical qubits from decoherence but requires repeated syndrome extraction whose fundamental thermodynamic cost has not been characterized exactly. We prove five theorems and two corollaries that supply this characterization for stabilizer codes. First, a no-go result establishes that every error-correction cycle requires strictly positive work, ruling out passive error correction. Second, a duality identity shows that the combined measurement and erasure cost per syndrome-extraction round is determined solely by the number of stabilizer generators; only the split between measurement and erasure depends on the error rate. Third, a coherence dissipation theorem quantifies the additional irreversible work generated when projective stabilizer measurements destroy quantum coherence in the data register. CSS codes eliminate this cost for generators aligned with the noise channel’s eigenbasis, yielding a thermodynamic criterion for code selection under non-Pauli noise. Fourth, a Crooks fluctuation theorem for the full syndrome cycle yields a Jarzynski equality and exponential tail bounds on rare work fluctuations. Fifth, a variance formula captures the effect of syndrome correlations among stabilizers that share physical qubits. We evaluate all results across eleven codes, from a three-qubit repetition code to a 144-qubit quantum low-density parity-check code, establishing a Pareto trade-off between thermodynamic cost and error-suppression capability. Comparison with four experimental platforms—two superconducting, one trapped-ion, and one neutral-atom—shows that current hardware operates five to eleven orders of magnitude above the Landauer limit, with control and readout hardware, not syndrome extraction, as the dominant source of dissipation.
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.
Rényi coherent information, a computable proxy for the von Neumann coherent information, is widely used to study mixed-state phases of matter and decodability transitions in noisy quantum error-correcting codes. However, being a difference of two Rényi entropies, it need not be monotonic in the Rényi index, and lacks the operational meaning of its von Neumann counterpart. Here we address both issues for stabilizer codes. First, for Pauli noise generated by independent Bernoulli events, we prove that the Rényi-nnn coherent information is nondecreasing in n∈Z+n \in \mathbb{Z}^+n∈Z+. This follows from a general theorem: if independent random bits are mapped linearly to a fine label TTT and a coarse label CCC, then the Rényi entropy difference Hn(C)−Hn(T)H_n(C)-H_n(T)Hn​(C)−Hn​(T) is nondecreasing in nnn. For stabilizer codes, TTT is the joint syndrome--logical class and CCC is the syndrome, and the difference is the Rényi-nnn coherent information up to a constant. The same theorem covers classical linear codes and independent detector error models. Second, for arbitrary stochastic Pauli noise, we give the Rényi-nnn coherent information an operational meaning via postselection on matching syndromes between one data block and n−1n-1n−1 auxiliary blocks. We determine when this defines a quantum channel and show that saturation of the Rényi-nnn coherent information is equivalent to asymptotically perfect recovery of the postselected channel. Moreover, the Rényi-nnn coherent information also upper-bounds the ordinary coherent information achievable after any syndrome-conditioned recovery.
This work deals with coding systems based on sparse graph codes. The key issue we address is the relationship between iterative (in particular belief propagation) and maximum a posteriori decoding. We show that between the two there is a fundamental connection, which is reminiscent of the Maxwell construction in thermodynamics. The main objects we consider are EXIT-like functions. EXIT functions were originally introduced as handy tools for the design of iterative coding systems. It gradually became clear that EXIT functions possess several fundamental properties. Many of these properties, however, apply only to the erasure case. This motivates us to introduce GEXIT functions that coincide with EXIT functions over the erasure channel. In many aspects, GEXIT functions over general memoryless output-symmetric channels play the same role as EXIT functions do over the erasure channel. In particular, GEXIT functions are characterized by the general area theorem. As a first consequence, we demonstrate that in order for the rate of an ensemble of codes to approach the capacity under belief propagation decoding, the GEXIT functions of the component codes have to be matched perfectly. This statement was previously known as the matching condition for the erasure case. We then use these GEXIT functions to show that in the limit of large blocklengths a fundamental connection appears between belief propagation and maximum a posteriori decoding. A decoding algorithm, which we call Maxwell decoder, provides an operational interpretation of this relationship for the erasure case. Both the algorithm and the analysis of the decoder are the translation of the Maxwell construction from statistical mechanics to the context of probabilistic decoding. We take the first steps to extend this construction to general memoryless output-symmetric channels. More exactly, a general upper bound on the maximum a posteriori threshold for sparse graph codes is given. It is conjectured that the fundamental connection between belief propagation and maximum a posteriori decoding carries over to the general case.
Quantum error correction (QEC) codes protect quantum information from errors due to decoherence. Many of them also serve as prototypical models for exotic topological quantum matters. Investigating the behavior of the QEC codes under decoherence sheds light on not only the codes' robustness against errors but also new out-of-equilibrium quantum phases driven by decoherence. The phase transitions, including the error threshold, of the decohered QEC codes can be probed by the systems' R\'enyi entropies SR{S}_{R}SR​ with different R\'enyi indices RRR. In this paper, we study the general construction of the statistical models that characterize the R\'enyi entropies of QEC codes decohered by Pauli noise. We show that these statistical models can be organized into a ``tapestry'' woven by rich duality relations among them. For Calderbank-Shor-Steane (CSS) codes with bit-flip and phase-flip errors, we show that each R\'enyi entropy is captured by a pair of dual statistical models with randomness. For $R=2,3,\ensuremath{\infty}$, there are additional dualities that map between the two error types, relating the critical bit-flip and phase-flip error rates of the decoherence-induced phase transitions in the CSS codes. For CSS codes with an ``ememem symmetry'' between the XXX-type and the ZZZ-type stabilizers, the dualities with $R=2,3,\ensuremath{\infty}$ become self-dualities with super-universal self-dual error rates. These self-dualities strongly constrain the phase transitions of the code signaled by ${S}_{R=2,3,\ensuremath{\infty}}$. For general stabilizer codes decohered by generic Pauli noise, we also construct the statistical models that characterize the systems' entropies and obtain general duality relations between Pauli noise with different error rates.
There is a fundamental relationship between belief propagation (BP) and maximuma posterioridecoding. The case of transmission over the binary erasure channel was investigated in detail in a companion paper (C. MEacuteasson, A. Montanari, and R. Urbanke, "Maxwell's construction: The hidden bridge between iterative and maximum a posteriori decoding,"IEEE Transactions on Information Theory, submitted for publication). This paper investigates the extension to general memoryless channels (paying special attention to the binary case). An area theorem for transmission over general memoryless channels is introduced and some of its many consequences are discussed. We show that this area theorem gives rise to an upper bound on the maximuma posteriorithreshold for sparse graph codes. In situations where this bound is tight, the extrinsic soft bit estimates delivered by the BP decoder coincide with the correcta posterioriprobabilities above the maximuma posteriorithreshold. More generally, it is conjectured that the fundamental relationship between the maximuma posterioriprobability (MAP) and the BP decoder which was observed for transmission over the binary erasure channel carries over to the general case. We finally demonstrate that in order for the design rate of an ensemble to approach the capacity under BP decoding the component codes have to be perfectly matched, a statement which is well known for the special case of transmission over the binary erasure channel.