Classical Tensor Codes and Quantum Tanner Codes Achieve Capacity on Erasure Channels
Authors: Henry D. Pfister, Oscar Sprumont, Gilles Zémor
Abstract
We show that on the classical erasure channel, the tensor product of two capacity-achieving code families is itself capacity-achieving under mild conditions. We also prove that duals of tensor products of independent uniform random binary linear codes achieve erasure capacity. Using these local codes, for every erasure probability $ρ\in(0,1/2)$ and every rate gap $\varepsilon>0$, we obtain a family of binary quantum Tanner codes of rate at least $1-2ρ-\varepsilon$. For fixed $ρ$ and $\varepsilon$, these codes have bounded check weights, minimum distance growing linearly with the blocklength, and a linear-time erasure decoder whose decoding error decays exponentially with the blocklength.
The papers around it, by date and closeness
Higher is closer to this paper; left is older. Lines join papers close to each other: groups of lines are sub-topics. Select a point to see why it is there. Back to the summary of this paper
Papers around this one
Ranked by how close their title and abstract are to this paper’s. Select some to read them together.
Closest papers
-
Efficient Decoding up to a Constant Fraction of the Code Length for Asymptotically Good Quantum CodesAnthony Leverrier, Gilles Z'emor · 2022 · Electron. Colloquium Comput. Complex. · cited 51 times · Not summarized yet
The paper develops a linear-time decoder for adversarial errors in quantum Tanner codes, while the target uses local and adversarial decoding for erasures.
Abstract
We introduce and analyse an efficient decoder for quantum Tanner codes that can correct adversarial errors of linear weight. Previous decoders for quantum low-density parity-check codes could only handle adversarial errors of weight \(O(\sqrt{n\log n})\) . We also work on the link between quantum Tanner codes and the lifted product codes of Panteleev and Kalachev and show that our decoder can be adapted to the latter. The decoding algorithm alternates between sequential and parallel procedures and converges in linear time.
-
Decoding Quantum Tanner CodesAnthony Leverrier, Gilles Zémor · 2022 · IEEE Transactions on Information Theory · cited 49 times · Not summarized yet
The paper introduces sequential and parallel decoders for adversarial errors in quantum Tanner codes; the target studies linear-time erasure decoding for these codes.
Abstract
We introduce sequential and parallel decoders for quantum Tanner codes. When the Tanner code construction is applied to a sufficiently expanding square complex with robust local codes, we obtain a family of asymptotically good quantum low-density parity-check codes. In this case, our decoders provably correct arbitrary errors of weight linear in the code length, respectively in linear or logarithmic time. The same decoders are easily adapted to the expander lifted product codes of Panteleev and Kalachev. Along the way, we exploit recently established bounds on the robustness of random tensor codes to give a tighter bound on the minimum distance of quantum Tanner codes.
-
Polylog-LDPC Capacity Achieving Codes for the Noisy Quantum Erasure ChannelS. Lloyd, P. Shor, Kevin Thompson · 2017 · IEEE Transactions on Information Theory · cited 4 times · Not summarized yet
The paper constructs sparse quantum codes that approach erasure-channel capacity, while the target achieves near-capacity erasure rates with bounded check weights.
Abstract
We provide polylog sparse quantum codes for correcting the Erasure channel arbitrarily close to the capacity. Specifically, we provide the <inline-formula> <tex-math notation="LaTeX">$[[n, k, d]]$ </tex-math></inline-formula> quantum stabilizer codes that correct for the erasure channel arbitrarily close to the capacity if the erasure probability is at least 0.33 and with a generating set <inline-formula> <tex-math notation="LaTeX">$\langle S_{1}, S_{2}, \cdots {} S_{n-k} \rangle $ </tex-math></inline-formula> such that <inline-formula> <tex-math notation="LaTeX">$|S_{i}|\leq {\mathrm{ log}} ^{2+\zeta }(n)$ </tex-math></inline-formula> for all <inline-formula> <tex-math notation="LaTeX">$i$ …
-
Optimal Interleavers for Classical and Quantum Tensor Product CodesP. Nadkarni, S. Garani · 2021 · IEEE Communications Letters · cited 1 time · Not summarized yet
The paper optimizes interleavers for burst correction in classical and quantum tensor product codes, rather than studying erasure capacity.
Abstract
By exploiting the subblock structure of a tensor product code, we provide an upper bound on the maximum correctable burst length of tensor product codes used with interleavers designed based on only the minimum distance and the maximum correctable burst length of its component codes, without taking the specific code geometry and soft decoding into consideration. We provide necessary and sufficient conditions for an interleaver to achieve this upper bound. Further, for two cases of the tensor product codes, we design optimal intracodeword interleavers that satisfy the proposed conditions.
-
Capacities of Quantum Erasure ChannelsCharles H. Bennett, D. Divincenzo, J. Smolin · 1997 · Physical Review Letters · cited 362 times · Not summarized yet
The paper derives the quantum erasure channel’s capacity, providing the benchmark for the target’s capacity-achieving quantum codes.
Abstract
The quantum analog of the classical erasure channel provides a simple example of a channel whose asymptotic capacity for faithful transmission of intact quantum states, with and without the assistance of a two-way classical side channel, can be computed exactly. We derive the quantum and classical capacities for the quantum erasure channel and related channels, and compare them to the depolarizing channel, for which only upper and lower bounds on the capacities are known.
-
Upper bounds on the rate of low density stabilizer codes for the quantum erasure channelNicolas Delfosse, G. Zémor · 2012 · Quantum information & computation · cited 41 times · Not summarized yet
The paper bounds achievable rates for low-density stabilizer codes on the quantum erasure channel, addressing rate limits related to the target’s construction.
Abstract
Using combinatorial arguments, we determine an upper bound on achievable rates of stabilizer codes used over the quantum erasure channel. This allows us to recover the no-cloning bound on the capacity of the quantum erasure channel, R is below 1-2p, for stabilizer codes: we also derive an improved upper bound of the form : R is below 1-2p-D(p) with a function D(p) that stays positive for 0 < p < 1/2 and for any family of stabilizer codes whose generators have weights bounded from above by a constant - low density stabilizer codes. We obtain an application to percolation theory for a family of self-dual tilings of the hyperbolic plane. We associate a family of low density stabilizer codes wit…
-
Degenerate quantum codes and the quantum channel capacity problemGraeme Smith, J. Smolin · 2008 · 2008 IEEE Information Theory Workshop · Not summarized yet
The paper addresses degenerate quantum codes and channel capacity, a broader capacity topic than the target’s erasure-code construction.
-
Fidelity of Finite Length Quantum Codes in Qubit Erasure ChannelA. Ashikhmin · 2020 · International Symposium on Information Theory · cited 5 times · Not summarized yet
The paper analyzes decoding error for finite-length quantum codes on the qubit erasure channel, while the target establishes asymptotic erasure-decoding performance.
Abstract
We consider the probability of decoding error, equivalently the fidelity, of finite length quantum codes assuming quantum information transmission via qubit erasure channel. First, we obtain an analytical expression on this probability via combinatorial invariants of quantum codes. Next, we derive a generalization of the MacWilliams identities for those invariants and use them to formulate a linear programming optimization problem, which allows us to obtain lower bounds on the number of unrecoverable sets of i erasures and the probability of decoding error. Our example shows that the obtain bounds can be very tight. Next, we derive upper (achievability) bounds on the probability of decoding …
Prior work it builds on
-
Good Quantum LDPC Codes with Linear Time DecodersIrit Dinur, Min-Hsiu Hsieh, Ting Lin et al. · 2022 · Symposium on the Theory of Computing · cited 231 times · Not summarized yet
The paper constructs good quantum LDPC codes with linear-time decoders using random-code tensor-product robustness, a construction ingredient used by the target.
Abstract
We construct a new explicit family of good quantum low-density parity-check codes which additionally have linear time decoders. Our codes are based on a three-term chain (2m× m)V →δ0 (2m)E →δ1 2F where V (X-checks) are the vertices, E (qubits) are the edges, and F (Z-checks) are the squares of a left-right Cayley complex, and where the maps are defined based on a pair of constant-size random codes CA,CB:2m→2Δ where Δ is the regularity of the underlying Cayley graphs. One of the main ingredients in the analysis is a proof of an essentially-optimal robustness property for the tensor product of two random codes.
-
Explicit Capacity-Achieving Quantum LDPC Codes List Decodable in Near-linear TimeAdar Avsian, F. G. Jeronimo, Abhi Shukul · 2026 · arXiv.org · preprint, not peer reviewed · cited 1 time · Not summarized yet
The paper constructs explicit quantum LDPC codes for list decoding near capacity, whereas the target focuses on erasure decoding capacity.
Abstract
In classical coding theory, the quest for explicit codes achieving list decoding capacity has been an important driving force. While random codes are easily shown to achieve capacity, an explicit construction was only discovered decades later in the seminal work [Guruswami and Rudra, STOC 2006]. In quantum coding theory, it is highly desirable that a code family be LDPC. While good quantum codes were known for decades, obtaining the additional LDPC property was elusive. In fact, only very recently that good quantum LDPC codes were discovered in a breakthrough work [Panteleev and Kalachev, STOC 2022]. In this context, a natural question is to ask for an explicit family of quantum codes achiev…
-
Two-sided Robustly Testable CodesG. Kalachev, P. Panteleev · 2022 · arXiv.org · preprint, not peer reviewed · cited 17 times · Not summarized yet
The paper proves robustness for tensor products of random linear codes, a property relevant to the target’s tensor-code and quantum Tanner-code analysis.
Abstract
We show that the tensor product of two random linear codes is robustly testable with high probability. This implies that one can obtain pairs of linear codes such that their product and the product of their dual codes are simultaneously robustly testable. Such two-sided robustly testable codes (with a much weaker form of robustness) were the key ingredient in the recent constructions of asymptotically good quantum LDPC codes, which ensured their linear minimum distance. We hope that the existence of such codes with a stronger form of robustness, shown here, can be used to simplify the proofs and provide better distance bounds in these constructions. We also give new very simple examples of n…
-
Stabilizer-Assisted Inactivation Decoding of Quantum Error-Correcting Codes with ErasuresGiulio Pech, Mert Gökduman, Hanwen Yao et al. · 2026 · International Symposium on Information Theory · cited 5 times · Not summarized yet
The paper gives a maximum-likelihood erasure decoder for quantum LDPC codes using inactivation and dual peeling, unlike the target’s local decoding approach.
Abstract
We present a maximum-likelihood (ML) decoder with reduced complexity for quantum low-density parity-check (QLDPC) codes on the quantum erasure channel. Our decoder combines classical inactivation decoding, which integrates peeling with symbolic guessing, with a new dual peeling procedure. In the dual peeling stage, we perform row operations on the stabilizer matrix to efficiently reveal stabilizer generators and their linear combinations whose support lies entirely on the erased set. Each such stabilizer identified allows us to freely fix a bit in its support without affecting the logical state of the decoded result. This removes a degree of freedom that would otherwise require a symbolic gu…
-
Maximally Extendable Product Codes are Good Coboundary ExpandersG. Kalachev, P. Panteleev · 2025 · IEEE Annual Symposium on Foundations of Computer Science · cited 16 times · Not summarized yet
The paper studies expansion of tensor products of random codes, a property connected to quantum LDPC constructions but not specifically to erasure capacity.
Abstract
We investigate the coboundary expansion property of tensor product codes, known as product expansion, which plays an important role in recent constructions of good quantum LDPC codes and classical locally testable codes. Prior research has shown that this property is equivalent to agreement testability and robust testability for products of two codes with linear distance. However, for products of more than two codes, product expansion is a strictly stronger property. In this paper, we prove that a collection of an arbitrary number of random codes over a sufficiently large field has good product expansion. We believe that, in the case of four codes, the same ideas can be used to construct goo…
Go further
How are these papers found?
We compare the title and abstract of this paper with those of every paper summarized on this site, and with the papers Semantic Scholar recommends, those it cites and those citing it (for a much-cited paper, its most recent citations and, from OpenAlex, the most cited ones). Among the prior work and the follow-ups, the papers that use each other in depth, a method it uses and the much-cited follow-ups come a little higher. The levels (very close, close, related) come from the similarity of the texts, not from a judgment of quality; * marks a paper without an abstract, compared by its title. The sentence under a paper is written by an AI from the two abstracts: check it in the papers. A paper marked not relevant by three readers leaves the list.
Updated on 16 November 2026.