Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 25: finite universal compression construction

Open
QAlgorithms.Papers.Independent.Intakenext100.P54.finite_universal_compression

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let D≥1D\ge1D≥1 and 0<ε≤10<\varepsilon\le10<ε≤1. There is a universal visible quantum-classical compression code whose quantum code space has exactly

S=⌈(1−ε/2)D⌉S=\left\lceil(1-\varepsilon/2)D\right\rceilS=⌈(1−ε/2)D⌉

dimensions and whose fixed classical message support has size KKK satisfying

log⁡2K≤⌈ε−1⌉,F(ψ,Dm(ψ)(ξ(ψ)))≥(1−ε)2for every pure ψ.\log_2K\le\lceil\varepsilon^{-1}\rceil,\qquad F\bigl(\psi,\mathcal D_{m(\psi)}(\xi(\psi))\bigr)\ge(1-\varepsilon)^2\quad\text{for every pure }\psi.log2​K≤⌈ε−1⌉,F(ψ,Dm(ψ)​(ξ(ψ)))≥(1−ε)2for every pure ψ.

Alice's quantum codeword is a normalized pure state in the SSS-dimensional space, and each message decoder is CPTP and fixed independently of the target. The cost bound is the printed number of cbits, rather than its logarithm. Padding gives the stated exact code dimension, with an identity code when S=DS=DS=D.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P54
Formal statement
noncomputable section

open scoped BigOperators Matrix ComplexConjugate ComplexOrder NNReal ENNReal

open MeasureTheory ProbabilityTheory

namespace QAlgorithms.Papers.Independent.Intakenext100.P54

open QAlgorithms.Papers.Independent.Information100.P03 (PureEnsemble)

open QAlgorithms.Papers.Independent.Information100.P53 (fidelity)

open QAlgorithms.Papers.Independent.Dependency50.P07 (wordProb)

open QAlgorithms.Papers.Independent.Claimed50.P08 (classicalEntropy)

open QAlgorithms.Papers.Independent.Claimed50.P38 (tensorSuperop)

/-- Remark 25, PDF pp.16–17: the source's ceil(1/eps) CBITS bound, not its logarithm.
Pad the code to exactly ceil((1-eps/2)D); when that equals D, use the identity code. -/
theorem finite_universal_compression (D : ℕ) (hD : 0 < D)
    (eps : ℝ) (heps : 0 < eps) (hepsOne : eps ≤ 1) :
    ∃ P : VisibleCode D, P.S = ⌈(1 - eps / 2) * D⌉₊ ∧
      Real.logb 2 P.K ≤ (⌈eps⁻¹⌉₊ : ℝ) ∧
      ∀ psi : RSPVector (Fin D), (1 - eps) ^ 2 ≤
        (pureDensity psi.val * P.output psi).trace.re := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P54

end
Source
Remote preparation of quantum states, arXiv:quant-ph/0307100v3, PDF p. 16, Remark 25: finite universal compression construction
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every natural number D>0D>0D>0 and every real number 0<ε≤10<\varepsilon\le 10<ε≤1, there exist positive natural numbers S,KS,KS,K, a function assigning to each unit vector ψ∈CD\psi\in\mathbb C^Dψ∈CD a unit vector qψ∈CSq_\psi\in\mathbb C^Sqψ​∈CS, a function assigning to each such ψ\psiψ a label mψ∈{0,…,K−1}m_\psi\in\{0,\ldots,K-1\}mψ​∈{0,…,K−1}, and maps Φj\Phi_jΦj​ from complex S×SS\times SS×S matrices to complex D×DD\times DD×D matrices, one for each label jjj, such that

S=⌈(1−ε2)D⌉,log⁡2K≤⌈ε−1⌉.S=\left\lceil\left(1-\frac{\varepsilon}{2}\right)D\right\rceil, \qquad \log_2 K\le \left\lceil\varepsilon^{-1}\right\rceil.S=⌈(1−2ε​)D⌉,log2​K≤⌈ε−1⌉.

Each Φj\Phi_jΦj​ has a finite Kraus representation: there are a natural number ℓj\ell_jℓj​ and complex D×SD\times SD×S matrices Ej,tE_{j,t}Ej,t​, indexed by 0≤t<ℓj0\le t<\ell_j0≤t<ℓj​, satisfying

∑t=0ℓj−1Ej,t†Ej,t=IS,Φj(X)=∑t=0ℓj−1Ej,tXEj,t†for every complex S×S matrix X.\sum_{t=0}^{\ell_j-1}E_{j,t}^{\dagger}E_{j,t}=I_S, \qquad \Phi_j(X)=\sum_{t=0}^{\ell_j-1}E_{j,t}XE_{j,t}^{\dagger} \quad\text{for every complex }S\times S\text{ matrix }X.t=0∑ℓj​−1​Ej,t†​Ej,t​=IS​,Φj​(X)=t=0∑ℓj​−1​Ej,t​XEj,t†​for every complex S×S matrix X.

For every unit vector ψ∈CD\psi\in\mathbb C^Dψ∈CD, the output obtained from its assigned vector and label satisfies

(1−ε)2≤Re⁡tr⁡(∣ψ⟩⟨ψ∣ Φmψ ⁣(∣qψ⟩⟨qψ∣)),(1-\varepsilon)^2 \le \operatorname{Re}\operatorname{tr} \left( |\psi\rangle\langle\psi|\, \Phi_{m_\psi}\!\left(|q_\psi\rangle\langle q_\psi|\right) \right),(1−ε)2≤Retr(∣ψ⟩⟨ψ∣Φmψ​​(∣qψ​⟩⟨qψ​∣)),

where ∣v⟩⟨v∣|v\rangle\langle v|∣v⟩⟨v∣ denotes the matrix with entries vavb‾v_a\overline{v_b}va​vb​​. The quantifiers include D=1D=1D=1 and ε=1\varepsilon=1ε=1; at ε=1\varepsilon=1ε=1, the asserted lower bound is 000.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

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