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 17
Quantum-State Oblivious Transfer over Quantum Erasure Channels
We study quantum-state oblivious transfer over the quantum erasure channel under information-theoretic security guarantees.Stabilizer codes over general phase spaces
We develop a theory of stabilizer codes whose stabilizer groups consist of commuting qudit Paulis, oscillator displacements, and/or planar-rotor displacements.Random Quantum LDPC Codes Approaching the Gilbert-Varshamov Bound
We show that for any $R,ε>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_ε(1)$, and normalized…Efficiently and Reliably Measuring Information Processing Capacity in Dynamical Systems via Kernels
Information Processing Capacity (IPC) is a powerful system-agnostic metric for quantifying a dynamical system's computational capability and is widely used in quantum reservoir computing.Information Limits of Low-Rank Approximation Certification
Low-rank approximation can require additional matrix--vector products to verify that its error meets a prescribed tolerance.From Symmetry to Secrecy: Covariant Classical--Quantum Wiretap Channels
For classical--quantum wiretap channels with a transitive covariant input action, both output ensembles admit a description as unitary group orbits of fixed seed states.Robustness of quantum spectrum estimation: weak Schur sampling under noisy inputs
We initiate the study of weak Schur sampling (WSS) under noisy inputs.Entanglement of purification for Werner states: canonical purification and nonadditivity
We prove that the von Neumann entanglement of purification is nonadditive.Efficient capacity-achieving entanglement generation with application to pure-loss Bosonic channels
While the ultimate limits on the rate of quantum communication over noisy channels are well-established, very few efficient coding schemes achieving these limits are known.Quantum estimation, channel orders, and private capacity
Recent examples have shown that zero private capacity need not imply antidegradability and that two channels with zero private capacity can nevertheless transmit private information together.Latent Score-Based Bayesian Cramér-Rao Bound Estimation for High-Dimensional Imaging Systems
We propose a data-driven framework for estimating the Bayesian Cramér-Rao bound (CRB) in high-dimensional imaging systems with complex, analytically intractable priors.Learned Parallel Bit-Flipping Sequential Belief Propagation Decoding of Quantum LDPC Codes
Quantum low-density parity-check (QLDPC) codes are promising candidates for low-overhead fault-tolerant quantum computation, but their practical use requires fast, low-complexity, and reliable…No Model Required: Text Entropy Rate Filtering Mitigates Iterative Fine-Tuning Collapse
Iterative fine-tuning on synthetic data causes \emph{model collapse}: output diversity narrows as rare patterns are progressively lost, a signature most visible as phrase-level repetition.Learnt Attacks on Quantum Key Distribution under Channel Noise and Device Drift
Quantum key distribution (QKD) links are provisioned from security analyses of stationary channels, whereas the devices that determine the channel drift between recalibrations.The Asymptotics of Language Model Alignment with Memory
Language model (LM) alignment broadly aims to perturb a given LM $Q$ into an aligned LM $q$ such that i) the outputs produced by $q$ and $Q$ are 'close' in probability, ii) $q$ has a higher expected…Universality Sacrifices Reliability in Classical-Quantum Channel Coding
Universal channel coding enables communication without a complete description of the channel.Quantum Advantage for Two-Party Differential Privacy
We introduce information-theoretically private quantum protocols for two-party Hamming distance when both parties must output the same estimate.Intent-Hiding Jailbreaks: An Information-Theoretic Framework for Compositional Attacks
Recent work has shown that large language models (LLMs) can be vulnerable to jailbreak attacks in which harmful intent is obscured through composition with benign tasks.Joint Movement and Compression Ratio Design for Mobile Embodied AI Networks (MEAN)
Mobile embodied AI networks (MEAN) enable embodied agents to perceive, reason, communicate, and act in wireless environments.Singer-Difference-Set Qudit Stabilizer Codes from Non-Degenerate Quadrics in PG(d,q)PG(d,q): Construction, Structural Theorems, and Monte-Carlo Performance
We propose Q(q,d), a family of q-ary non-CSS qudit stabilizer codes with prime power q and dimension d >= 2, constructed from Singer difference sets and non-degenerate quadrics in PG(d,q).