Binary code rate bounds via classical--quantum channels

• URL: http://arxiv.org/abs/2608.09347v1
• Date: Mon, 10 Aug 2026 09:25:40 GMT
• Title: Binary code rate bounds via classical--quantum channels
• Abstract summary: We derive the four principal rate-distance tradeoffs for binary codes.<n>Plotkin, Elias--Bassalygo, and the two McEliece--Rodemich--Rumsey--Welch (MRRW) bounds.
• Score: 19.998564169284055
• License: http://creativecommons.org/licenses/by/4.0/
• 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 $δ$, then every length-$n$ binary code, linear or nonlinear, of relative distance $δ$ 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 < δ< \frac{1}{2}$, while the masked mixed-qubit channel (2MQC) strictly improves the second MRRW bound throughout the same interval.

Related papers

• The Gain-Engineered Transmon [68.89136228609398]
  We introduce and experimentally realize a noise-biased qubit in a standard transmon-readout resonator circuit.<n>Our results open a path towards using this system as a simple building-block for hardware-efficient quantum error detection and correction schemes.
  arXiv  Detail & Related papers  (2026-08-26T17:00:42Z)
• Quantum Key Distribution Without Shared Reference Frame Under Unital Noise [42.7789646649633]
  We consider a general and practical scenario of quantum key distribution (QKD) over an unknown, stationary, unital qubit channel.<n>We propose two methods to overcome the physical qubit noise and the lack of shared reference frame.
  arXiv  Detail & Related papers  (2026-06-22T12:24:11Z)
• Scaling-optimal purification of noisy qubit unitary channels [12.189743655923008]
  We construct a superchannel that purifies the noisy unitary back to the original unknown unitary.<n>We first provide numerical evidence that sequential strategies can strictly outperform parallel strategies when the number of channel uses is finite.<n>We then provide a concrete $mathrmU(2)$-covariant parallel protocol based on a novel entanglement-assisted quantum error-correcting code that suppresses the first-order noise strength.
  arXiv  Detail & Related papers  (2026-06-10T17:55:25Z)
• LimiX-2M: Mitigating Low-Rank Collapse and Attention Bottlenecks in Tabular Foundation Models [56.999481798138625]
  LimiX-2M is a 2M- parameter model that outperforms larger TabPFN-v2 and TabICL baselines on widely used benchmarks.<n>We present a unified tokenize-and-route framework for strong Tabular foundation models (TFMs)<n>Results highlight value-aware tokenization and readout-aligned routing as key levers for improving the accuracy--efficiency trade-off in TFMs.
  arXiv  Detail & Related papers  (2026-06-03T06:07:33Z)
• OScaR: The Occam's Razor for Extreme KV Cache Quantization in LLMs and Beyond [50.440302567029654]
  Multi-modal intelligence has made the Key-Value cache a dominant memory bottleneck for efficient deployment.<n>In this work, we revisit the inherent limitations of the per-channel quantization paradigm.<n>We propose OScaR, an accurate and lightweight KV cache compression framework for X-LLMs.
  arXiv  Detail & Related papers  (2026-05-19T10:53:03Z)
• Truncated-Binary Encoding: Spectral Degree Reduction of Combinatorial Optimization Problems for Quantum Hardware [0.0]
  Exact-binary encoding compiles a discrete cost function network (CFN) into a higher-order unconstrained binary optimization (HUBO) problem.<n>We propose textittruncated-binary encoding (TBE): a modification of exact-binary encoding in which Ising-basis monomials exceeding a chosen cutoff $k_textmax$ are dropped from the encoded cost.
  arXiv  Detail & Related papers  (2026-05-16T20:27:06Z)
• Regularized Online RLHF with Generalized Bilinear Preferences [68.44113000390544]
  We consider the problem of contextual online RLHF with general preferences.<n>We adopt the Generalized Bilinear Preference Model to capture preferences via low-rank, skew-symmetric matrices.<n>We prove that the dual gap of the greedy policy is bounded by the square of the estimation error.
  arXiv  Detail & Related papers  (2026-02-26T15:27:53Z)
• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• ReQuestNet: A Foundational Learning model for Channel Estimation [10.657960540744286]
  We present a novel neural architecture for channel estimation (CE) in 5G and beyond, the Recurrent Equivariant UERS Estimation Network (ReQuestNet)<n>It incorporates several practical considerations in wireless communication systems, such as ability to handle variable number of resource block (RB), dynamic number of transmit layers, physical resource block groups (PRGs) bundling size (BS), demodulation reference signal (DMRS) patterns with a single unified model, thereby, drastically simplifying the CE pipeline.
  arXiv  Detail & Related papers  (2025-08-12T09:44:47Z)
• Rydberg Atomic Quantum MIMO Receivers for The Multi-User Uplink [77.32323151235285]
  We propose a flexible architecture for Rydberg atomic quantum multiple-input multiple-output (RAQ-MIMO) receivers in the multi-user uplink.<n>The corresponding signal model of the RAQ-MIMO system is constructed by paving the way from quantum physics to wireless communications.
  arXiv  Detail & Related papers  (2025-06-02T06:16:54Z)
• Reed-Muller Codes on CQ Channels via a New Correlation Bound for Quantum Observables [7.415361840837667]
  We analyze decoding functions using symmetry and the nested structure of Reed-Muller codes.<n>Our results show that any set of $2o(sqrtlog N)$ bits can be decoded with a high probability when the code rate is less than the Holevo capacity.
  arXiv  Detail & Related papers  (2025-02-06T05:19:24Z)
• On the Constant Depth Implementation of Pauli Exponentials [49.48516314472825]
  We decompose $Zotimes n$ exponentials of arbitrary length into circuits of constant depth using $mathcalO(n)$ ancillae and two-body XX and ZZ interactions.<n>We prove the correctness of our approach, after introducing novel rewrite rules for circuits which benefit from qubit recycling.
  arXiv  Detail & Related papers  (2024-08-15T17:09:08Z)
• Channel Simulation: Finite Blocklengths and Broadcast Channels [13.561997774592667]
  We study channel simulation under common randomness assistance in the finite-blocklength regime. We identify the smooth channel max-information as a linear program one-shot converse on the minimal simulation cost for fixed error tolerance.
  arXiv  Detail & Related papers  (2022-12-22T13:08:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.