Theory & Algorithms · Computer Science & AI
Information Theory
The newest papers in Information Theory that ReadSearch has read, newest first. Each links to its own page, with its authors, date, where it was published and the original.
474 papers, from 4 September 2026 to 5 November 2026: 474 arXiv preprints.
Get the few papers worth your time in Information Theory every morning.
Follow Information Theory and ReadSearch reads its new papers each day, then brings you the few worth reading, each with its key finding in a sentence.
Newest papers, page 15
Minimal Scenarios Witnessing Genuine Multipartite Nonlocality Possibilistically
We study a strong form of genuine multipartite nonlocality (GMNL), where an $n$-partite scenario admits a quantum strategy generating outcomes belonging to a restricted set with certainty, whereas…Recovery Guarantees for Posterior Sampling of One-Bit Compressed Sensing
We study the sample complexity of noisy one-bit compressed sensing for signals drawn from a prior distribution.Verification with Transfer: Exact Information Frontiers and Their Price in Calls
A verifier that accepts or rejects whole answers reveals little: under a flat prior over $k$-bit answers, zero error needs $2^k-1$ verifications.Improved Local Leakage Resilience of Shamir Secret Sharing and Worst-Case Optimal Polynomial Intersection
We study two problems: Local Leakage Resilience (LLR) for Shamir secret sharing, and worst-case Optimal Polynomial Intersection (OPI).Subspace Uncertainty and Sharp Sampling Thresholds on the Boolean Cube
We study Gaussian regression under squared population $L_2$ loss in a known $m$-dimensional subspace of degree-at-most-$k$ functions on the $d$-dimensional Boolean cube.Transformer-Based Masked Diffusion Models Provably Learn Distributions with Latent Structure
Masked diffusion models (MDMs) generate discrete data by iteratively unmasking multiple tokens in parallel using a learned mask predictor.Coset Lifted Product Codes: Constructing Quantum LDPC Codes from Non-Normal Subgroup Actions
We introduce coset lifted product (CLP) codes, a family of quantum LDPC codes that combine the protograph structure of lifted product codes with the coset action of Aydin, Tamo, and Barg…Building codes with transversal CCZ using projective geometry and SAT solvers
We construct CSS codes with three logical qubits whose logical CCZ gate is implemented by transversal physical $T/T^{\dagger}$ gates and whose distance is at least $3$.The Silhouette Operator: Identifiability of Low-Rank Measures from One-Dimensional Projections
Structured recovery phenomena, such as restricted isometry properties in compressed sensing, have shown that high-dimensional objects can often be reconstructed from remarkably low-dimensional…The Multiple Unicast Conjecture is False
The undirected multiple-unicast conjecture [LL04] asserts that network coding offers no throughput advantage over multicommodity flow.Beyond LLM-GA: Secure Fluid Antenna Systems with ReEvo-Designed Memetic Algorithm
Fluid antenna systems (FASs) offer significant spatial flexibility, yet securing them against eavesdropping is critical for practical FAS deployment in military, satellite, and internet-of-things…Pathwise Information Certificates for Decentralized Adaptive Sensing
We study decentralized adaptive sensing, where multiple agents choose measurements from evolving local beliefs while exchanging information over a communication graph.Settling the Sample Complexity of Rényi Entropy Estimation
Rényi entropy estimation has been comprehensively investigated by Acharya, Orlitsky, Suresh and Tyagi (SODA 2015; IEEE Trans.Why Forget-Only Unlearning Needs Memorization
Machine unlearning asks for a deletion algorithm whose output is close to retraining from scratch without the selected forget examples.How Many Repeated Pairwise Comparisons Are Needed for Ranking under Heterogeneity?
We study ranking models by population-average utility from pairwise comparisons when preferences vary across users and tasks.Cyclic triorthogonal codes in prime dimension
We study cyclic triorthogonal codes in prime dimension $p$, on which a transversal third-level diagonal gate acts as a logical non-Clifford gate.OSFP4: Joint Optimization of Diagonal Smoothing and Block Scales for NVFP4 Quantization
NVFP4 is an attractive datatype for large language model (LLM) inference, offering compact storage and native tensor-core acceleration.Slow Beats Fast at the Kesten-Stigum Threshold: Minimax, Fisher-Information and Belief-Propagation Characterizations of the Information-Computation Gap in Sparse Stochastic Block Models
We study community recovery in the sparse symmetric stochastic block model with $q$ communities, average degree $d$ and signal strength $λ$ through statistical decision theory and Fisher…Task-Sufficient Contraction: Source Selection for Machine Information Interfaces
A declared task can sometimes certify a reduced source before a downstream encoder, codebook, rate, distortion target, or optimizer is chosen.Efficiently computable bounds on the energy-constrained quantum reading capacity
In quantum reading, classical messages are encoded in sequences of quantum channels and recovered by probing the channels and processing their outputs.