Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 18: entangled ensemble trade-off

Open
QAlgorithms.Papers.Independent.Intakenext100.P54.entangled_ensemble_tradeoff

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

prove2quantum

Let E={pi,∣ϕi⟩AB}\mathcal E=\{p_i,|\phi_i\rangle^{AB}\}E={pi​,∣ϕi​⟩AB} be a finite normalized pure bipartite ensemble in fixed positive dimensions, and let R≥0R\ge0R≥0. Define its operational ebit curve using one-way input-dependent Alice CP instruments, message-dependent arbitrary CPTP Bob decoders, iid product blocks, global average fidelity, and both positive rate slacks and errors before every sufficiently large blocklength. Then

E∗(R)=min⁡p(j∣i){S(B∣C)ω:I(X;BC)ω≤R},ω=∑i,jpip(j∣i)∣i⟩⟨i∣X⊗ϕiAB⊗∣j⟩⟨j∣C.E^*(R)=\min_{p(j|i)}\{S(B\mid C)_\omega:I(X;BC)_\omega\le R\},\qquad \omega=\sum_{i,j}p_i p(j|i)|i\rangle\langle i|^X\otimes\phi_i^{AB}\otimes|j\rangle\langle j|^C.E∗(R)=p(j∣i)min​{S(B∣C)ω​:I(X;BC)ω​≤R},ω=i,j∑​pi​p(j∣i)∣i⟩⟨i∣X⊗ϕiAB​⊗∣j⟩⟨j∣C.

The classical auxiliary is finite but arbitrary. At feasible rates the minimum is attained and its rate pair is achievable; an infeasible rate has value +∞+\infty+∞. The cost S(B∣C)S(B\mid C)S(B∣C) averages receiver conditional entropies. In particular it is not replaced by I(X;B∣C)I(X;B\mid C)I(X;B∣C). Although the operational target preserves Alice's purification, the information curve depends only on the receiver marginal ensemble.

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)

/-- Theorem 18, PDF pp.10–11: minimise S(B|C), not I(X;B|C), over all finite stochastic
auxiliaries subject to I(X;BC) ≤ R. The operational target includes Alice's purification. -/
theorem entangled_ensemble_tradeoff {m a b : ℕ} (ha : 0 < a) (hb : 0 < b)
    (E : BipartiteEnsemble m a b) (R : ℝ) (hR : 0 ≤ R) :
    bipOperational E R = rspSingleLetter E.prob (bobStates E) R ∧
    rspMinimumAttained E.prob (bobStates E) R ∧
    (bipOperational E R ≠ ⊤ → BipartiteAchievable E R (bipOperational E R).toReal) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P54

end
Source
Remote preparation of quantum states, arXiv:quant-ph/0307100v3, PDF p. 10, Theorem 18: entangled ensemble trade-off
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, ensemble of probabilities pi≥0p_i\ge0pi​≥0 summing to 111 and unit vectors ψi∈Ca⊗Cb\psi_i\in\mathbb C^a\otimes\mathbb C^bψi​∈Ca⊗Cb, and real R≥0R\ge0R≥0, put σi(y,y′)=∑x<aψi(x,y)ψi(x,y′)‾\sigma_i(y,y')=\sum_{x<a}\psi_i(x,y)\overline{\psi_i(x,y')}σi​(y,y′)=∑x<a​ψi​(x,y)ψi​(x,y′)​ and let H(M)=−Re⁡Tr⁡((t↦tlog⁡2t)(M))H(M)=-\operatorname{Re}\operatorname{Tr}((t\mapsto t\log_2t)(M))H(M)=−ReTr((t↦tlog2​t)(M)) denote the specified continuous-functional-calculus entropy. Define an operationally feasible number eee to mean e≥0e\ge0e≥0 and that, for every ε,δ>0\varepsilon,\delta>0ε,δ>0, every sufficiently large positive integer nnn admits positive integers S,KS,KS,K, a natural number LLL, matrices Aw,j,ℓ:CS→CanA_{w,j,\ell}:\mathbb C^S\to\mathbb C^{a^n}Aw,j,ℓ​:CS→Can with ∑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​, and finite Kraus maps Bj(X)=∑hBj,hXBj,h†\mathcal B_j(X)=\sum_hB_{j,h}XB_{j,h}^{\dagger}Bj​(X)=∑h​Bj,h​XBj,h†​ with ∑hBj,h†Bj,h=IS\sum_hB_{j,h}^{\dagger}B_{j,h}=I_S∑h​Bj,h†​Bj,h​=IS​, whose outputs

Ωw((x,y),(x′,y′))=1S∑j,ℓ,u,vAw,j,ℓ(x,u)Aw,j,ℓ(x′,v)‾ Bj(∣u⟩⟨v∣)(y,y′)\Omega_w((x,y),(x',y'))= \frac1S\sum_{j,\ell,u,v} A_{w,j,\ell}(x,u)\overline{A_{w,j,\ell}(x',v)} \,\mathcal B_j(|u\rangle\langle v|)(y,y')Ωw​((x,y),(x′,y′))=S1​j,ℓ,u,v∑​Aw,j,ℓ​(x,u)Aw,j,ℓ​(x′,v)​Bj​(∣u⟩⟨v∣)(y,y′)

satisfy ∑w(∏t<npwt)Re⁡Tr⁡(∣Ψw⟩⟨Ψw∣Ωw)≥1−ε\sum_w(\prod_{t<n}p_{w_t})\operatorname{Re}\operatorname{Tr}(|\Psi_w\rangle\langle\Psi_w|\Omega_w)\ge1-\varepsilon∑w​(∏t<n​pwt​​)ReTr(∣Ψw​⟩⟨Ψw​∣Ωw​)≥1−ε, log⁡2K/n≤R+δ\log_2K/n\le R+\deltalog2​K/n≤R+δ, and log⁡2S/n≤e+δ\log_2S/n\le e+\deltalog2​S/n≤e+δ, where Ψw(x,y)=∏t<nψwt(xt,yt)\Psi_w(x,y)=\prod_{t<n}\psi_{w_t}(x_t,y_t)Ψw​(x,y)=∏t<n​ψwt​​(xt​,yt​). Let O\mathcal OO be the infimum in [0,∞][0,\infty][0,∞] of these feasible eee. For an auxiliary natural number kkk and numbers cij≥0c_{ij}\ge0cij​≥0 with ∑j<kcij=1\sum_{j<k}c_{ij}=1∑j<k​cij​=1 for every i<mi<mi<m, set qj=∑ipicijq_j=\sum_i p_ic_{ij}qj​=∑i​pi​cij​ and

τj={Ib/b,qj=0,∑i(picij/qj)σi,qj≠0,B(c)=∑jqjH(τj),\tau_j= \begin{cases} I_b/b,&q_j=0,\\ \sum_i(p_ic_{ij}/q_j)\sigma_i,&q_j\ne0, \end{cases} \qquad B(c)=\sum_jq_jH(\tau_j),τj​={Ib​/b,∑i​(pi​cij​/qj​)σi​,​qj​=0,qj​=0,​B(c)=j∑​qj​H(τj​), I(c)=h(p)−∑jqjh((picij/qj)i)+B(c)−∑ipiH(σi),h(v)=−∑ivilog⁡2vi.I(c)=h(p)-\sum_jq_jh\bigl((p_ic_{ij}/q_j)_i\bigr) +B(c)-\sum_i p_iH(\sigma_i), \qquad h(v)=-\sum_i v_i\log_2v_i.I(c)=h(p)−j∑​qj​h((pi​cij​/qj​)i​)+B(c)−i∑​pi​H(σi​),h(v)=−i∑​vi​log2​vi​.

Scalar division by zero is 000, so the vector inside hhh is zero when qj=0q_j=0qj​=0. Let F=inf⁡{max⁡(B(c),0):I(c)≤R}\mathcal F=\inf\{\max(B(c),0):I(c)\le R\}F=inf{max(B(c),0):I(c)≤R} in [0,∞][0,\infty][0,∞], over all such k,ck,ck,c. The theorem asserts O=F\mathcal O=\mathcal FO=F; if F<+∞\mathcal F<+\inftyF<+∞, some auxiliary k,ck,ck,c satisfies I(c)≤RI(c)\le RI(c)≤R and max⁡(B(c),0)=F\max(B(c),0)=\mathcal Fmax(B(c),0)=F; and if O<+∞\mathcal O<+\inftyO<+∞, the real value of O\mathcal OO is operationally feasible. Empty feasible sets have infimum +∞+\infty+∞, and the ensemble requirements 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