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
CombinatoricsComplexity Theory·Captain: Shuze Chen

Binary Huffman Coding with Unequal Letter Costs Is NP-CompleteResearch Paper

A binary prefix code assigns to each of NNN source symbols a word over {0,1}\{0,1\}{0,1} so that no codeword is a prefix of another, which makes concatenated codewords decodable without separators. For symbol frequencies w1,…,wNw_1,\dots,w_Nw1​,…,wN​, Huffman's 1952 greedy algorithm minimizes the weighted length ∑iwi∣Ci∣\sum_i w_i |C_i|∑i​wi​∣Ci​∣ in polynomial time (Huffman 1952). When the two letters…

25 thms6 active usersReviewed
Complexity TheoryProbability·Captain: mikedeng1

Lower Bounds for Adaptive Relaxed Locally Decodable Codes via the Capped Horvitz–Thompson EstimatorResearch Paper

A stored binary message can be protected by an encoding that expands it into a longer word. A locally decodable code aims to recover one requested message bit after reading only a few coordinates, even when part of the stored word has been corrupted. Its relaxed version permits the decoder to abort on corrupted words. On a valid codeword it must still…

31 thms6 active usersReviewed
Complexity Theory·Captain: mikedeng1

Metric Self-Dual Completion and Optimal Additive Hardness for Quantum and Graph-State DistanceResearch Paper

Many distance problems for codes are known to be NP-hard to approximate, but the hard instances produced by the classical reductions are not self-dual, and self-duality is exactly what quantum and graph-state constructions need: a CSS quantum code with identical X- and Z-checks, or a graph whose adjacency matrix is an involution, comes from a self-dual or…

25 thms6 active usersReviewed
ProbabilityStatisticsTheoretical Computer Science·Captain: iris

Optimal Error Exponents for Private Bayesian Hypothesis TestingResearch Paper

Hypothesis testing asks an analyst to decide, from a dataset X=(X1,…,Xn)X = (X_1, \dots, X_n)X=(X1​,…,Xn​) drawn i.i.d. from one of two known distributions PPP or QQQ, which one generated it. In the Bayesian version a prior (π0,π1)(\pi_0, \pi_1)(π0​,π1​) with π0,π1>0\pi_0, \pi_1 > 0π0​,π1​>0 weighs the two hypotheses, and the quality of a test is its Bayes risk, the overall probability of error. Without any…

32 thms6 active usersReviewed
Quantum Information·Captain: iris

Classical Information Capacity of the Bosonic Broadcast Channel: for transmissivity above 1/2 the coherent-state rate region is the capacity region, with no minimum output entropy conjecture assumedResearch Paper

Optical communication sends classical information on modes of the electromagnetic field, and a fundamental limit on its rates is a statement about bosonic channels: quantum channels acting on harmonic-oscillator modes under a photon-number budget. For one sender and one receiver over a pure-loss channel the classical capacity is known and coherent states…

30 thms6 active usersReviewed
Computational ComplexitycryptographyMachine Learning+1·Captain: iris

How Does Machine Learning Manage Complexity?Research Paper

A trained language model is, abstractly, a probability distribution μ\muμ on strings that can be evaluated quickly, and training chooses μ\muμ to minimise the cross-entropy Ex∼D[log⁡(1/μ(x))]\mathbb E_{x\sim D}[\log(1/\mu(x))]Ex∼D​[log(1/μ(x))] against a data distribution DDD, equivalently the Kullback–Leibler divergence KL(D∥μ)\mathrm{KL}(D\|\mu)KL(D∥μ). Real data are produced by processes far more complex than…

21 thms5 active usersReviewed
Complexity TheoryTheoretical Computer Science·Captain: mikedeng1

The Exact Communication Threshold for Parallel RepetitionResearch Paper

A two-player game gives Alice and Bob related questions and asks them to produce a valid pair of answers. Each player initially sees only their own question. Such games model the separated verifiers and answer constraints used in complexity theory. Repeating a game independently is useful when simultaneous success becomes unlikely. The question addressed…

22 thms5 active usersReviewed
Quantum Information·Captain: iris

Isotropic quantum spin channels and additivity questions: the spin-1/2 isotropic channel has minimal entropy output log⁡3−23log⁡2\log 3 - \frac{2}{3}\log 2log3−32​log2 and the spin-1 channel log⁡2\log 2log2Research Paper

A quantum channel is a completely positive, trace-preserving linear map Λ\LambdaΛ on matrices; it models how a quantum system is changed by noise. Its minimal entropy output S[Λ]S[\Lambda]S[Λ] measures how close the channel can come to preserving purity: the smallest von Neumann entropy of any output state. The additivity question asks whether …

23 thms5 active usersReviewed
Quantum Information·Captain: iris

Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels: every two-qubit state M with singlet fidelity ⟨Ψ⁻|M|Ψ⁻⟩ > 1/2 has positive distillable entanglement D(M) > 0Research Paper

Quantum teleportation moves an unknown qubit from Alice to Bob using one shared, perfectly entangled pair and two classical bits (Bennett et al. 1993). In practice the pairs are distributed through a noisy channel and arrive as a mixed state MMM, and teleporting through an impure pair degrades the transmitted state. Bennett, Brassard, Popescu, Schumacher,…

39 thms5 active usersReviewed
Mathematical PhysicsQuantum Information·Captain: mikedeng1

Capacities of Quantum Channels for Massive Bosons and Fermions: Under Average Energy and Particle-Number Constraints the Capacity Is the Grand-Canonical Entropy, Attained by Fock StatesResearch Paper

Classical information can be sent by choosing a quantum state, transmitting it, and asking a receiver to measure it. An ideal noiseless channel seems to have no finite information limit if its carrier can occupy arbitrarily many quantum states. A physical carrier, however, has a limited average energy, and a channel carrying massive particles also has a…

22 thms5 active usersReviewed
AlgebraCombinatoricsTheoretical Computer Science·Captain: mikedeng1

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data 2: The Improved Juels–Sudan Sketch Is an Average-Case Secure Sketch for s-Element Sets with Entropy Loss t log nResearch Paper

Many security-relevant inputs are noisy and do not repeat exactly: fingerprint minutiae, iris codes, lists of personal preferences, the set of features extracted from a document. A cryptographic key derived from such an input must be reproducible from a later, slightly different reading, without storing the input itself. Dodis, Ostrovsky, Reyzin and Smith (S…

11 thms5 active users
StatisticsTheoretical Computer Science·Captain: iris

Testing Fairness of Evolving Software under UncertaintyResearch Paper

Fairness testing checks that a program treats comparable inputs comparably, for instance that two inputs differing only in a protected attribute receive the same favourable outcome with nearly the same probability (Galhotra, Brun, Meliou 2017). Deployed software changes: a program P0P_0P0​ that has already been certified is replaced by a patched program P1P_1P1​, and…

42 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
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
PreviousPage 1 of 8Next

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