Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section VI.C: cq quantum reverse Shannon application

Open
QAlgorithms.Papers.Independent.Intakenext100.P54.cq_reverse_shannon_application

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

prove2quantum

For a fixed finite ensemble {pi,∣ϕi⟩AB}\{p_i,|\phi_i\rangle^{AB}\}{pi​,∣ϕi​⟩AB} of normalized pure bipartite states, let ρiB\rho_i^BρiB​ be the receiver marginals and ρˉB=∑ipiρiB\bar\rho^B=\sum_i p_i\rho_i^Bρˉ​B=∑i​pi​ρiB​. For every positive error and rate slack, all sufficiently large blocklengths admit one code simultaneously approximating the chosen product purifications in global average overlap and their receiver marginals in average squared Uhlmann fidelity, with

R=χ({pi,ρiB}),E=S(ρˉB).R=\chi(\{p_i,\rho_i^B\}),\qquad E=S(\bar\rho^B).R=χ({pi​,ρiB​}),E=S(ρˉ​B).

Both average fidelities are at least one minus the requested error, and both support rates are bounded by the displayed rates plus the requested slack. Alice's share is discarded only when evaluating the second fidelity. This gives the stated cq reverse Shannon application for the fixed ensemble law, without a channel diamond-norm assertion.

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)

/-- Section VI.C, PDF p.13: the preparation scheme simultaneously approximates the chosen
purifications and the receiver's mixed-state ensemble at Holevo cbit rate. This is a fixed-law
average-fidelity assertion, not a diamond-norm simulation claim. -/
theorem cq_reverse_shannon_application {m a b : ℕ} (ha : 0 < a) (hb : 0 < b)
    (E : BipartiteEnsemble m a b) :
    ∀ eps : ℝ, 0 < eps → ∀ delta : ℝ, 0 < delta →
      ∃ nzero : ℕ, 0 < nzero ∧ ∀ n ≥ nzero,
        ∃ P : BipartiteCode (Fin n → Fin m) (Fin n → Fin a) (Fin n → Fin b),
          1 - eps ≤ bipAverage E n P ∧ 1 - eps ≤ marginalAverageFidelity E n P ∧
          Real.logb 2 P.K / n ≤ bobHolevo E + delta ∧
          Real.logb 2 P.S / n ≤ bobAverageEntropy E + delta := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P54

end
Source
Remote preparation of quantum states, arXiv:quant-ph/0307100v3, PDF p. 13, Section VI.C: cq quantum reverse Shannon application
Read-back

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

For every natural number mmm, positive natural numbers a,ba,ba,b, and ensemble of unit vectors ψi∈Ca⊗Cb\psi_i\in\mathbb C^a\otimes\mathbb C^bψi​∈Ca⊗Cb with probabilities pi≥0p_i\ge0pi​≥0 summing to 111, put ρiB=Tr⁡A∣ψi⟩⟨ψi∣\rho_i^B=\operatorname{Tr}_A|\psi_i\rangle\langle\psi_i|ρiB​=TrA​∣ψi​⟩⟨ψi​∣, ρˉB=∑ipiρiB\bar\rho^B=\sum_i p_i\rho_i^Bρˉ​B=∑i​pi​ρiB​, HB=S(ρˉB)H_B=S(\bar\rho^B)HB​=S(ρˉ​B), and χB=S(ρˉB)−∑ipiS(ρiB)\chi_B=S(\bar\rho^B)-\sum_i p_iS(\rho_i^B)χB​=S(ρˉ​B)−∑i​pi​S(ρiB​), where S(X)=−Re⁡tr⁡f(X)S(X)=-\operatorname{Re}\operatorname{tr}f(X)S(X)=−Retrf(X) for f(t)=tlog⁡2tf(t)=t\log_2tf(t)=tlog2​t, evaluated by continuous functional calculus. For every ε>0\varepsilon>0ε>0 and δ>0\delta>0δ>0, there exists a positive natural number n0n_0n0​ such that every natural number n≥n0n\ge n_0n≥n0​ admits a code with positive integers S,KS,KS,K, a natural number LLL, matrices Aw,j,ℓ:CS→(Ca)⊗nA_{w,j,\ell}:\mathbb C^S\to(\mathbb C^a)^{\otimes n}Aw,j,ℓ​:CS→(Ca)⊗n satisfying ∑j,ℓAw,j,ℓ†Aw,j,ℓ=IS\sum_{j,\ell}A_{w,j,\ell}^\dagger A_{w,j,\ell}=I_S∑j,ℓ​Aw,j,ℓ†​Aw,j,ℓ​=IS​ for each word www, and channels Dj\mathcal D_jDj​ to (Cb)⊗n(\mathbb C^b)^{\otimes n}(Cb)⊗n. Each channel has a finite Kraus representation with the sum of the Kraus adjoint-products equal to the identity. With pw=∏tpwtp_w=\prod_t p_{w_t}pw​=∏t​pwt​​, Ψw=⨂tψwt\Psi_w=\bigotimes_t\psi_{w_t}Ψw​=⨂t​ψwt​​, and output

(Ωw)(α,β),(α′,β′)=1S∑j,ℓ,s,t(Aw,j,ℓ)α,s (Aw,j,ℓ)α′,t‾ [Dj(∣s⟩⟨t∣)]β,β′,(\Omega_w)_{(\alpha,\beta),(\alpha',\beta')} =\frac1S\sum_{j,\ell,s,t} (A_{w,j,\ell})_{\alpha,s}\, \overline{(A_{w,j,\ell})_{\alpha',t}}\, \bigl[\mathcal D_j(|s\rangle\langle t|)\bigr]_{\beta,\beta'},(Ωw​)(α,β),(α′,β′)​=S1​j,ℓ,s,t∑​(Aw,j,ℓ​)α,s​(Aw,j,ℓ​)α′,t​​[Dj​(∣s⟩⟨t∣)]β,β′​,

this code satisfies all four bounds

∑wpw Re⁡tr⁡(∣Ψw⟩⟨Ψw∣Ωw)≥1−ε,∑wpw F ⁣(Tr⁡A∣Ψw⟩⟨Ψw∣,Tr⁡AΩw)≥1−ε,log⁡2Kn≤χB+δ,log⁡2Sn≤HB+δ,\sum_w p_w\,\operatorname{Re}\operatorname{tr} (|\Psi_w\rangle\langle\Psi_w|\Omega_w)\ge1-\varepsilon, \qquad \sum_w p_w\,F\!\left(\operatorname{Tr}_A|\Psi_w\rangle\langle\Psi_w|, \operatorname{Tr}_A\Omega_w\right)\ge1-\varepsilon, \qquad \frac{\log_2K}{n}\le\chi_B+\delta, \qquad \frac{\log_2S}{n}\le H_B+\delta,w∑​pw​Retr(∣Ψw​⟩⟨Ψw​∣Ωw​)≥1−ε,w∑​pw​F(TrA​∣Ψw​⟩⟨Ψw​∣,TrA​Ωw​)≥1−ε,nlog2​K​≤χB​+δ,nlog2​S​≤HB​+δ,

where F(X,Y)=(Re⁡tr⁡X Y X)2F(X,Y)=(\operatorname{Re}\operatorname{tr}\sqrt{\sqrt X\,Y\,\sqrt X})^2F(X,Y)=(RetrX​YX​​)2. There is no upper restriction on ε\varepsilonε or δ\deltaδ; the ensemble conditions exclude m=0m=0m=0.

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