Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 11: pure-ensemble RSP trade-off

Open
QAlgorithms.Papers.Independent.Intakenext100.P54.pure_ensemble_tradeoff

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

prove2quantum

Let E={pi,∣ψi⟩}i=1m\mathcal E=\{p_i,|\psi_i\rangle\}_{i=1}^mE={pi​,∣ψi​⟩}i=1m​ be a finite ensemble on a fixed space Cd\mathbb C^dCd, d≥1d\ge1d≥1, with nonnegative probabilities summing to one and normalized vectors. Repeated targets and zero probabilities are allowed. On length-nnn blocks the source states and probabilities are products. Let E∗(R)E^*(R)E∗(R) be the infimum of nonnegative ebit rates achievable at cbit rate R≥0R\ge0R≥0, where every positive error and rate slack precede a blocklength threshold, every larger blocklength admits one one-way code, and fidelity is the global ensemble average. Then

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

The auxiliary alphabet is finite but arbitrary. For these pure targets I(A;B∣C)=S(B∣C)I(A;B\mid C)=S(B\mid C)I(A;B∣C)=S(B∣C). At every feasible rate the information minimum is attained and the resulting operational rate pair is achievable; infeasible rates have value +∞+\infty+∞. All entropies are in bits. This identifies the complete one-way pure-ensemble trade-off.

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 11, PDF pp.6–7. The operational curve equals the minimum over equation (5),
including the attainment assertion at feasible rates. Repeated targets are allowed. -/
theorem pure_ensemble_tradeoff {d : ℕ} (hd : 0 < d) (E : PureEnsemble (Fin d))
    (R : ℝ) (hR : 0 ≤ R) :
    pureOperational E R = rspSingleLetter E.weight (fun i => pureDensity (E.vector i)) R ∧
    rspMinimumAttained E.weight (fun i => pureDensity (E.vector i)) R ∧
    (pureOperational E R ≠ ⊤ → RSPPureAchievable E R (pureOperational E R).toReal) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P54

end
Source
Remote preparation of quantum states, arXiv:quant-ph/0307100v3, PDF p. 6, Theorem 11: pure-ensemble RSP trade-off
Read-back

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

For every positive natural number ddd, every finite ensemble E=((pi,ψi))i<ME=((p_i,\psi_i))_{i<M}E=((pi​,ψi​))i<M​ with pi≥0p_i\ge0pi​≥0, ∑ipi=1\sum_i p_i=1∑i​pi​=1, and unit vectors ψi∈Cd\psi_i\in\mathbb C^dψi​∈Cd, and every real R≥0R\ge0R≥0, the theorem makes the following assertions. Here ∣v⟩⟨v∣|v\rangle\langle v|∣v⟩⟨v∣ denotes the matrix with entries vavb‾v_a\overline{v_b}va​vb​​, and H(X)=−Re⁡tr⁡[f(X)]H(X)=-\operatorname{Re}\operatorname{tr}[f(X)]H(X)=−Retr[f(X)], using continuous functional calculus for f(x)=xlog⁡2xf(x)=x\log_2xf(x)=xlog2​x; write Hdiag(v)=H(diag⁡(v))H_{\mathrm{diag}}(v)=H(\operatorname{diag}(v))Hdiag​(v)=H(diag(v)). For a finite array cij≥0c_{ij}\ge0cij​≥0 with ∑j<kcij=1\sum_{j<k}c_{ij}=1∑j<k​cij​=1, set qj=∑ipicijq_j=\sum_i p_i c_{ij}qj​=∑i​pi​cij​, vi(j)=picij/qjv^{(j)}_i=p_i c_{ij}/q_jvi(j)​=pi​cij​/qj​, and σj=d−1Id\sigma_j=d^{-1}I_dσj​=d−1Id​ when qj=0q_j=0qj​=0, otherwise σj=∑ivi(j)∣ψi⟩⟨ψi∣\sigma_j=\sum_i v^{(j)}_i|\psi_i\rangle\langle\psi_i|σj​=∑i​vi(j)​∣ψi​⟩⟨ψi​∣. Define

B(c)=∑jqjH(σj),C(c)=Hdiag(p)−∑jqjHdiag(v(j))+B(c)−∑ipiH(∣ψi⟩⟨ψi∣),VR=inf⁡k,cC(c)≤Rmax⁡(B(c),0),B(c)=\sum_jq_jH(\sigma_j),\qquad C(c)=H_{\mathrm{diag}}(p)-\sum_jq_jH_{\mathrm{diag}}(v^{(j)}) +B(c)-\sum_ip_iH(|\psi_i\rangle\langle\psi_i|), \qquad V_R=\inf_{\substack{k,c\\C(c)\le R}}\max(B(c),0),B(c)=j∑​qj​H(σj​),C(c)=Hdiag​(p)−j∑​qj​Hdiag​(v(j))+B(c)−i∑​pi​H(∣ψi​⟩⟨ψi​∣),VR​=k,cC(c)≤R​inf​max(B(c),0),

where the infimum is in [0,∞][0,\infty][0,∞]. Define a pair (R,e)(R,e)(R,e) to be achievable precisely as follows: R,e≥0R,e\ge0R,e≥0, and for every ϵ,δ>0\epsilon,\delta>0ϵ,δ>0, there is a positive integer n0n_0n0​ such that for every n≥n0n\ge n_0n≥n0​, there exist positive integers S,KS,KS,K, a KKK-outcome POVM (Fw,j)j<K(F_{w,j})_{j<K}(Fw,j​)j<K​ on CS\mathbb C^SCS for each word w∈{0,…,M−1}nw\in\{0,\ldots,M-1\}^nw∈{0,…,M−1}n, and maps Dj\mathcal D_jDj​ from S×SS\times SS×S to dn×dnd^n\times d^ndn×dn matrices, each admitting a finite representation Dj(X)=∑ℓAj,ℓXAj,ℓ†\mathcal D_j(X)=\sum_\ell A_{j,\ell}XA_{j,\ell}^{\dagger}Dj​(X)=∑ℓ​Aj,ℓ​XAj,ℓ†​ with ∑ℓAj,ℓ†Aj,ℓ=IS\sum_\ell A_{j,\ell}^{\dagger}A_{j,\ell}=I_S∑ℓ​Aj,ℓ†​Aj,ℓ​=IS​, such that, on writing

Ψw(x)=∏t<nψwt(xt),Ωw=∑j<KDj(S−1Fw,jT),\Psi_w(x)=\prod_{t<n}\psi_{w_t}(x_t), \qquad \Omega_w=\sum_{j<K}\mathcal D_j(S^{-1}F_{w,j}^{\mathsf T}),Ψw​(x)=t<n∏​ψwt​​(xt​),Ωw​=j<K∑​Dj​(S−1Fw,jT​),

one has

1−ϵ≤∑w(∏t<npwt)Re⁡tr⁡(∣Ψw⟩⟨Ψw∣Ωw),log⁡2Kn≤R+δ,log⁡2Sn≤e+δ.1-\epsilon\le \sum_w\left(\prod_{t<n}p_{w_t}\right) \operatorname{Re}\operatorname{tr}\bigl(|\Psi_w\rangle\langle\Psi_w|\Omega_w\bigr), \qquad \frac{\log_2K}{n}\le R+\delta,\qquad \frac{\log_2S}{n}\le e+\delta.1−ϵ≤w∑​(t<n∏​pwt​​)Retr(∣Ψw​⟩⟨Ψw​∣Ωw​),nlog2​K​≤R+δ,nlog2​S​≤e+δ.

A POVM here means that all its matrices are positive semidefinite and their sum is the identity. Let ORO_ROR​ be the infimum in [0,∞][0,\infty][0,∞] of all achievable eee. The theorem asserts jointly that OR=VRO_R=V_ROR​=VR​; that if VRV_RVR​ is finite, some finite array ccc attains it while satisfying C(c)≤RC(c)\le RC(c)≤R; and that if ORO_ROR​ is finite, the pair (R,OR)(R,O_R)(R,OR​), with ORO_ROR​ viewed as a real number, is itself achievable. Empty feasible sets have infimum +∞+\infty+∞, zero ensemble weights are allowed, and division by zero in the auxiliary formulas is zero. Ensemble normalization forces M>0M>0M>0, so an auxiliary array cannot have k=0k=0k=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