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 18
Coding Agents for Coding Theory
We spent five weeks using an LLM coding agent on open problems in coding theory: finding large sets of four-letter words, such as DNA barcodes, that stay far apart in edit distance.Metachecks in Bivariate Bicycle Codes: Syndrome Distance, Measurement Faults, and Repair Limits
Faulty syndrome measurements can corrupt an otherwise correct quantum-error correction step.Constant-Overhead Injection into Quantum Codes
We construct the first known fault-tolerant scheme for injecting states into quantum error-correcting codes with constant space and time overhead.Logical Operator Decomposition for Distance Analysis of Bivariate Bicycle Codes
Bivariate bicycle (BB) quantum codes are a prominent finite-length family of quantum low-density parity-check codes, but their minimum distance is usually established numerically rather than read…The Intrinsic Cost of Quantum Syndrome Extraction
How much time is fundamentally required to extract the syndrome of a stabilizer code on hardware with a given connectivity graph?A depolarizing choir sings in Gaussian harmony
We study the noise threshold for positive quantum capacity for the qubit depolarizing channel.Quantum State Routing and Perfect State Transfer on Signed Graphs under Environmental Noise
Routing unknown quantum information across distributed communication networks requires autonomous, measurement-free mechanisms to prevent wave-function collapse.Equality in the Bosonic Quantum Entropy Power Inequality
The bosonic quantum entropy power inequality bounds the entropy of a beam-splitter output in terms of the input entropies.Universal Entanglement Distillation
We present a universal entanglement distillation protocol that asymptotically achieves the distillable entanglement of any unknown bipartite state in a fixed finite dimension.A mixing time method for estimating the sample complexity of quantum state discrimination
We develop a mixing time method for estimating the sample complexity of quantum state discrimination.Submodularity of entropy under quantum convolution
We develop a submodular framework for the von Neumann entropy of discrete quantum convolutions, providing a noncommutative counterpart to the direct side of entropic additive combinatorics.From Random Quantum Codes to Explicit qLDPC Codes via Local Properties
Constructing explicit codes matching the parameters of random codes has been a central and largely elusive question in coding theory.Quantum List Recovery and Decoding: Achievability and Limitations
Quantum list recovery (QLR) and quantum list decoding (QLD) seek short lists of logically distinct Pauli corrections consistent with a syndrome and prescribed error constraints.Refined sample complexities from the tomographic rate function
Protocols for quantum state tomography can be characterized either by their sample complexity or by the tomographic rate function that governs the large deviation behaviour of error estimates.CAS II: Orbits as Models: Kolmogorov's Structure Function under Symmetry
In algorithmic statistics a string x is explained by a finite set containing it, and Kolmogorov's structure function records the smallest such model at each level of complexity.Explicit Capacity-Achieving Quantum LDPC Codes List Decodable in Near-linear Time
In classical coding theory, the quest for explicit codes achieving list decoding capacity has been an important driving force.Local Automorphism-Aware Syndrome Compilation for General Quantum LDPC Codes
Low-depth syndrome extraction for Calderbank-Shor-Steane (CSS) quantum low-density parity-check codes can be formulated as a proper ordered edge-coloring problem subject to quantum parity constraints.On the Relationship between Model Quantization and Model Inversion Attacks
Model quantization reduces the numerical precision of neural network weights and activations to lower storage and computational costs.Finite-blocklength classical communication over the quantum erasure channel with and without classical feedback
We determine the optimal success probability for transmitting a fixed number of classical messages through a finite number of uses of the quantum erasure channel, assisted by noiseless classical…Exact information accounting for SGD methods
As an alternative to the standard geometric analyses, we give an exact, information-theoretic analysis of stochastic gradient descent (SGD) and its variants.