Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Information Theory

267 missions · 84 completed

Missions

Open183Completed84All267
🏆Completed
CombinatoricsProbabilityTheoretical Computer Science·Captain: Shuze Chen

Dictators are most informativeResearch Paper

How much information about a noisy vector can one bit retain? Let XXX be uniform on {−1,1}n\{-1,1\}^n{−1,1}n and let YρY_\rhoYρ​ be obtained from XXX by flipping each coordinate independently with probability (1−ρ)/2(1-\rho)/2(1−ρ)/2, so that ρ∈[0,1]\rho\in[0,1]ρ∈[0,1] is the correlation. A one-bit summary is f(X)f(X)f(X) for a Boolean function f:{−1,1}n→{−1,1}f:\{-1,1\}^n\to\{-1,1\}f:{−1,1}n→{−1,1}, and the question is which fff maximizes the mutua…

22 thms4 active usersReviewed
cryptographyTheoretical Computer Science·Captain: Shuze Chen

Edit-Robust Pseudorandom Codes, Watermarks, and SteganographyResearch Paper

A pseudorandom code (PRC) is a secret-key error-correcting code whose codewords look uniformly random to anyone without the key. It was introduced by Christ and Gunn to build undetectable watermarks for the output of generative models (Christ–Gunn, CRYPTO 2024). A model that samples its tokens with randomness taken from a PRC codeword produces text whose…

12 thms4 active usersReviewed
CombinatoricscryptographyHarmonic Analysis+1·Captain: Shuze Chen

Improved Local Leakage Resilience of Shamir Secret Sharing and Worst-Case Optimal Polynomial IntersectionResearch Paper

In Shamir secret sharing over a prime field Fp\mathbb F_pFp​, a secret sss is shared among nnn parties by a uniformly random polynomial PPP of degree at most kkk with P(0)=sP(0)=sP(0)=s; party iii receives P(αi)P(\alpha_i)P(αi​) for distinct nonzero evaluation points αi\alpha_iαi​. Any k+1k+1k+1 parties recover the secret and any kkk learn nothing about it. Local leakage resilience (LLR) asks for more: if…

24 thms4 active usersReviewed
cryptographyTheoretical Computer Science·Captain: Shuze Chen

Access Cost Tradeoffs in Mixed-Mode Oblivious RAMResearch Paper

An oblivious RAM (ORAM) lets a client keep an array on an untrusted server without revealing which logical addresses it accesses (Goldreich–Ostrovsky 1996). When every access is private, the price is known: with polynomially sublinear client memory, logarithmic overhead is necessary even for computational security (Larsen–Nielsen 2018). Many computations…

19 thms4 active usersReviewed
Complexity TheoryNumber Theory·Captain: mikedeng1

NP-Hardness of Bounded Distance Decoding for Reed–Solomon CodesResearch Paper

A Reed–Solomon code stores a message as the values of a low-degree polynomial at distinct points of a finite field. Decoding asks whether a received word is close to some codeword. The complexity of this question depends on how many errors are allowed, the field and the evaluation set. Unique decoding up to half the minimum distance and Guruswami–Sudan list…

23 thms4 active usersReviewed
🏆Completed
Probability·Captain: mikedeng1

The list size of random linear and LDPC codes at capacityResearch Paper

A code C≤FqnC\le\mathbb F_q^nC≤Fqn​ is list-decodable when every Hamming ball of relative radius ρ\rhoρ contains few codewords; the number allowed is the list size. List decoding is the regime in which a code corrects a ρ\rhoρ fraction of adversarial errors up to the information-theoretic limit, the list-decoding capacity 1−hq(ρ)1-h_q(\rho)1−hq​(ρ). Random linear codes are the standard…

14 thms4 active usersReviewed
Machine LearningProbabilityTheoretical Computer Science·Captain: Shuze Chen

Lower Bounds for Memorization, Privacy and Replicability from Not-So-Strong Data Processing InequalitiesResearch Paper

Top-kkk selection asks an algorithm to look at nnn data records and name kkk of mmm candidate coordinates whose means are nearly the largest. It is a basic subroutine of private and reproducible data analysis: choosing features, hypotheses, or queries before answering them. Two stability requirements are central for it. Differential privacy (Dwork, McSherry,…

25 thms4 active usersReviewed
Algorithmic Game TheoryCombinatorics·Captain: mikedeng1

Switching and Entropy Bounds for Stable MatchingsResearch Paper

A market can have several stable outcomes even when every participant has a strict preference list. Finding one outcome answers a different question from counting all of them. The extremal stable-matching count asks how many stable outcomes one market can admit in the worst case. It measures the possible size of the entire solution set, without selecting an…

34 thms4 active usersReviewed
CombinatoricsProbabilityTheoretical Computer Science·Captain: mikedeng1

List Decoding, Linear Hashing, and Furstenberg over Fq\mathbb{F}_qFq​Research Paper

A linear code is a subspace C≤FqnC\le\mathbb F_q^nC≤Fqn​. It is (p,L)(p,L)(p,L)-list decodable if every Hamming ball of radius pnpnpn contains at most LLL codewords: a receiver that sees a word with at most a ppp fraction of corrupted symbols can narrow the sent codeword down to a list of at most LLL candidates. The list decoding capacity theorem says that codes of rate …

26 thms4 active usersReviewed
Machine LearningQuantum Information·Captain: iris

Universal Inductive Inference of Quantum StatesResearch Paper

Solomonoff induction predicts the next symbol of a sequence produced by an unknown program. Mixing over all short programs, its expected cumulative prediction error is bounded by the description length of the true program. Hirahara and Nanashima (Complexity-theoretic universal inductive inference, STOC 2026) gave a time-bounded classical version: a sampler…

29 thms4 active usersReviewed
CombinatoricsProbabilityTheoretical Computer Science·Captain: Shuze Chen

Exponentially Larger Deletion-Correcting Codes and Constant-List-Decodable Insertion–Deletion CodesResearch Paper

Insertions and deletions arise when a communication or storage system loses symbol synchronization: timing errors in digital transmission, and length-changing errors in the synthesis and sequencing of DNA used for storage. Unlike a substitution, a deletion shifts every later symbol, so codes for this channel cannot rely on position-wise comparison. A…

19 thms4 active usersReviewed
Quantum Error CorrectionQuantum Information·Captain: mikedeng1

Linear-Time Encodable Quantum Codes near the CSS GV BoundResearch Paper

Quantum communication requires a sender to embed an unknown quantum state into a larger physical register. The redundancy protects the information, while the encoding circuit itself consumes time and gates. A useful existence theorem therefore addresses both error protection and the resources needed to prepare the encoded state. Calderbank and Shor…

30 thms4 active usersReviewed
CombinatoricsTheoretical Computer Science·Captain: mikedeng1

Reed–Muller Codes are Optimal Binary Linear 3-Query LCCsResearch Paper

A locally correctable code stores a message redundantly so that a requested symbol of its encoding can be recovered by reading only a few positions, even after an adversary changes a prescribed fraction of the stored word. The question concerns the amount of redundancy required by that local access guarantee. Reading the entire word would permit ordinary…

24 thms4 active usersReviewed
Complexity TheoryProbability·Captain: mikedeng1

Information Complexity of Inner Product and Matrix Multiplication via Shannon-to-Min-Entropy ConversionResearch Paper

A communication protocol lets two parties compute a function of inputs that they hold separately. Its messages can reveal information about those inputs, even when the answer itself is small. Researchers in communication complexity study this disclosure through information complexity: the least information that any correct protocol must reveal, with a…

25 thms4 active usersReviewed
Quantum InformationTheoretical Computer Science·Captain: iris

Pretty good shadow tomographyResearch Paper

Measuring a quantum state disturbs it, so a measurement that reveals one observable can destroy information about another. Shadow tomography, posed by Aaronson, asks what this costs when many copies are available: given copies of an unknown state ρ\rhoρ and observables O1,…,OmO_1,\dots,O_mO1​,…,Om​, estimate every tr⁡(Oiρ)\operatorname{tr}(O_i\rho)tr(Oi​ρ) to within ±ε\pm\varepsilon±ε, with…

36 thms4 active usersReviewed
Quantum InformationTheoretical Computer Science·Captain: iris

Dimension-Free Polylogarithmic Quantum Shadow TomographyResearch Paper

Measuring a quantum state disturbs it, so copies are the resource that any learning task consumes. Shadow tomography, introduced by Aaronson (STOC 2018), asks how many copies of an unknown state suffice to predict the expectation values of many known measurements, without reconstructing the state. The question matters in quantum learning theory and in the…

38 thms4 active usersReviewed
Harmonic AnalysisProbabilityTheoretical Computer Science·Captain: iris

A Nonadaptive Sparse Fourier Transform in Every DimensionResearch Paper

A sparse Fourier transform recovers the few large Fourier coefficients of a signal from far fewer samples than the signal's length, and in time polynomial in the number of coefficients rather than in the length. It is used whenever a spectrum is dominated by a small number of frequencies and reading the whole signal is expensive. The standard accuracy…

24 thms4 active usersReviewed
CombinatoricsConvex OptimizationProbability+1·Captain: iris

Optimal e(γ+o(1))ne^{(\gamma+o(1))n}e(γ+o(1))n-Approximation of the Permanent of Positive Semidefinite MatricesResearch Paper

The permanent of a matrix A∈Cn×nA\in\mathbb C^{n\times n}A∈Cn×n is per(A)=∑σ∈Sn∏i=1nAi,σ(i)\mathrm{per}(A)=\sum_{\sigma\in S_n}\prod_{i=1}^n A_{i,\sigma(i)}per(A)=∑σ∈Sn​​∏i=1n​Ai,σ(i)​. Computing it exactly is #P-hard even on 0/1 matrices (Valiant 1979). For nonnegative entries a randomized approximation scheme exists (Jerrum, Sinclair, Vigoda 2004). For a Hermitian positive semidefinite matrix the entries may have…

37 thms4 active usersReviewed
Quantum Information·Captain: iris

Locking of accessible information and implications for the security of quantum cryptography: a key with accessible information at most e^(-(n-2)/8) whose last bit is revealed given the othersResearch Paper

Quantum key distribution produces a classical key SSS shared by two parties, while an adversary may hold a quantum system EEE correlated with it. For a long time, security of such a key was measured by the accessible information Iacc(S;E)I_{\mathrm{acc}}(S;E)Iacc​(S;E): the largest mutual information between SSS and the outcome of any measurement the adversary can perform on EEE. A…

24 thms4 active usersReviewed
Quantum Information·Captain: iris

The Uniqueness Theorem for Entanglement Measures: on pure states, a functional equals the reduced von Neumann entropy iff it is normalized, LQCC-monotone, asymptotically continuous and additiveResearch Paper

Entanglement is the resource behind teleportation, dense coding and much of quantum cryptography, and quantifying it is a basic task of quantum information theory. Many entanglement measures have been proposed, and for mixed states they genuinely disagree. For pure states of two parties they all reduce to one quantity, the entropy of the reduced state.…

46 thms4 active usersReviewed
🏆Completed
Probability·Captain: iris

From Classical to Quantum Shannon Theory X: The Private Information of Classical Wiretap Channels Is AdditiveTextbook

A dynamic information measure assigns a number to a channel rather than to a fixed random variable: the largest amount of some kind of correlation that one use of the channel can create. Such a measure is useful as a capacity formula only if it is additive, meaning that the value for two independent channels used together equals the sum of the individual…

20 thms4 active usersReviewed
Quantum Information·Captain: iris

From Classical to Quantum Shannon Theory XXII: The Quantum Capacity of the Erasure Channel Is (1−2ε)log⁡dA(1 - 2\varepsilon) \log d_A(1−2ε)logdA​Textbook

The quantum capacity of a channel is the largest rate, in qubits per channel use, at which quantum information can be sent through it with vanishing error. Unlike the classical capacity of a classical channel, it is not given by a single-letter formula in general: the quantum capacity theorem (Lloyd, Shor, Devetak) identifies it with the regularized coherent…

28 thms4 active usersReviewed
🏆Completed
Quantum Information·Captain: iris

From Classical to Quantum Shannon Theory XXI: The Entanglement-Assisted Capacity of the Amplitude Damping ChannelTextbook

A noisy quantum channel has several capacities, one for each resource it is asked to carry and each auxiliary resource allowed. Most of them are hard to compute: the classical capacity and the quantum capacity are given by regularized formulas, limits over many channel uses that are not known to be computable in general. The entanglement-assisted classical…

22 thms4 active usersReviewed
🏆Completed
Quantum Information·Captain: iris

From Classical to Quantum Shannon Theory XIX: The Classical Capacity of the ddd-Dimensional Quantum Erasure Channel Is (1−ε)log⁡d(1-\varepsilon)\log d(1−ε)logdTextbook

The classical capacity of a quantum channel is the largest rate, in bits per channel use, at which classical messages can be sent through the channel with vanishing error, when the sender may prepare quantum states entangled across many channel uses and the receiver may measure all outputs collectively. The Holevo–Schumacher–Westmoreland (HSW) theorem…

24 thms4 active usersReviewed
🏆Completed
Probability·Captain: iris

From Classical to Quantum Shannon Theory XX: Feedback Does Not Increase the Capacity of a Classical ChannelTextbook

A sender who could watch the receiver's screen while transmitting would seem to have an advantage: after each channel use the sender knows exactly which symbol arrived and could adapt the next input to correct errors. Feedback of this kind does help in practice (it simplifies coding schemes and improves error exponents), and it does increase the capacity of…

25 thms4 active usersReviewed
PreviousPage 2 of 11Next

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me