Skip to content
Preprint

Binary code rate bounds via classical--quantum channels

Aug 2026 · 4 citations · ⚡ 2 influential
Computer Science Mathematics Physics

Abstract

We derive the four principal asymptotic rate-distance tradeoffs for binary codes---Plotkin, Elias--Bassalygo, and the two McEliece--Rodemich--Rumsey--Welch (MRRW) bounds---from one theorem, the ``pretty good criterion.''If the bit error rate under the pretty good measurement (PGM)---the quantum analog of posterior sampling---of a binary-input output-symmetric classical--quantum (cq) channel lies below $\delta$, then every length-$n$ binary code, linear or nonlinear, of relative distance $\delta$ has rate at most the channel's capacity, up to an $O(n^{-1/2})$ correction. Rate--distance bounds thereby reduce to a channel design problem, wherein the task is to minimize channel capacity subject to the posterior bit error rate constraint. Via the pretty good criterion, the binary erasure channel (BEC) yields Plotkin, the binary symmetric channel (BSC) yields Elias--Bassalygo, the pure-state channel (PSC) yields the first MRRW bound, and a masked PSC yields the second MRRW bound exactly. This framework is then instantiated with new channels to improve upon the MRRW bounds. Specifically, the mixed-qubit channel (MQC), a mixed-state version of PSC, strictly improves the first MRRW bound at every $0<\delta<\frac{1}{2}$, while the masked mixed-qubit channel (2MQC) strictly improves the second MRRW bound throughout the same interval.

View source

Similar papers

Preprint Sep 2026

Execution-transcript privacy for fault-tolerant surface-code memories

A fault-tolerant quantum computer runs behind a telemetry stream logging syndromes, decoder actions, resets and timing separately from the answer. Can it reveal the logical input? For a distance-$d$ rotated surface-code memory on a fixed schedule of $T=\Theta(d)$ rounds, under three stated hypotheses (sector-scalar hon...

Jia-Chen Shen, Hui Zhong · 0 citations
#machine learning Preprint Oct 2026

Distance Prediction for Quantum Codes

The distance of a quantum code is a fundamental metric that dictates its error-correction capability. While quantum low-density parity-check (qLDPC) families such as Bivariate Bicycle (BB) codes offer a promising pathway to low-overhead fault-tolerant quantum computing, computing their distance is challenging. Current...

N. Schneider, Eliya Nachmani · 0 citations
Preprint Oct 2026

Random Quantum LDPC Codes Approaching the Gilbert-Varshamov Bound

We show that for any $R,\epsilon>0$ and any prime $p\geq 2$, there exists an infinite family of $p$-ary quantum low-density parity-check (QLDPC) codes, rate $R$, checks of weight $O_\epsilon(1)$, and normalized distance at least $\delta_{\mathrm{GV}}(p,R)-\epsilon$. Here, $\delta_{\mathrm{GV}}(p,R)$ denotes the quantum...

Tushant Mittal, Shashank Srivastava, Madhur Tulsiani et al. · 2 citations · ⚡1
Sep 2026

A Tight Second-Order Converse Bound for Variable-Length Feedback Codes

A converse is derived, establishing the second-order fundamental limit for every positive-capacity discrete memoryless channel with finite $C_1$, which covers the moderate-deviations and error-exponent regimes, including polynomially decaying error probabilities.

Recep Can Yavas · 0 citations
Preprint Oct 2026

MacKay-Neal Codes Achieve Capacity under MAP Decoding

Statistical-mechanical analyses predict that MacKay-Neal codes can achieve channel capacity at fixed degrees. We prove this prediction for the uncoupled $(\ell,3,3)$ MN socket ensemble for every fixed integer $\ell\ge4$. For each binary-input memoryless symmetric channel of capacity strictly greater than $3/\ell$, the...

Kenta Kasai · 1 citation
Preprint Aug 2026

Alphabet-Dependent Bounds for Pure Quantum $(r,\rho)$-Locally Recoverable Codes

A quantum $(r,\rho)$-locally recoverable code ($(r,\rho)$-qLRC) is a quantum code in which every qudit can be recovered from at most $r+\rho-1$ other qudits, even after $\rho-1$ additional erasures inside the recovery set. The bounds currently known for this class, namely the Singleton-like and the GG Singleton-like bo...

Vijay Kumar, Ramakrishna Bandi · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.