Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Conditional high-photon privacy and coherent-information limits

Open
QAlgorithms.Papers.Independent.Support50.P06.highPhoton_capacityLimit

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Assume global minimum output entropy conjecture 2 and the same full-oscillator, vacuum-dilation operational privacy convention and mean-photon budget as in the wiretap theorem. For 0<η<10<\eta<10<η<1, let Q(1)(η,N)Q^{(1)}(\eta,N)Q(1)(η,N) denote the coherent-information supremum over all normalized inputs with mean photons at most NNN. In nats,

lim⁡N→∞Cp(η,N)=lim⁡N→∞Q(1)(η,N)=max⁡{0,ln⁡η−ln⁡(1−η)}.\lim_{N\to\infty} C_p(\eta,N)=\lim_{N\to\infty}Q^{(1)}(\eta,N)=\max\{0,\ln\eta-\ln(1-\eta)\}.N→∞lim​Cp​(η,N)=N→∞lim​Q(1)(η,N)=max{0,lnη−ln(1−η)}.

At η=1\eta=1η=1 both limits are +∞+\infty+∞. This retains the conjectural premise of the present paper's derivation. The separately cited unconditional quantum-capacity result is inventoried as a deferral.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P06
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P06

open MeasureTheory Filter

open scoped ENNReal BigOperators Topology

open QAlgorithms.RealRegisters (Hilbert)

open QAlgorithms.Papers.Independent.Dependency50.P33 (State IsDensity rankOne)

open QAlgorithms.Papers.Independent.Next46.P32
  (NumberString FockKernel identicalThermalKernel vacuum productCoherentKernel
   jointMix bobMarginal charlieMarginal pureLoss broadcast mixedOutput
   spectralEntropyNats FockPOVM realFockTracePair modeEnergy complexNormal
   StrongConjecture2)

open QAlgorithms.Papers.Independent.Claimed50.P39 (g)

open QAlgorithms.Papers.Independent.Claimed50.P11 (thermalEntropyInverse)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF p.3, paragraph after (12): conditional high-photon limit in nats for
both operational privacy capacity and constrained Q^(1). The finite logarithm
formula is restricted to 0<eta<1. The eta=1 limit is infinity, not log(0).
The independently cited unconditional result [10] is inventoried separately. -/
theorem highPhoton_capacityLimit (hmoe : StrongConjecture2) :
    (∀ eta : ℝ, 0 < eta → eta < 1 →
      Tendsto (fun N : ℝ => holevoMessagePrivacyCapacityNats 1 eta N) atTop
        (nhds (ENNReal.ofReal (max 0 (Real.log eta - Real.log (1 - eta))))) ∧
      Tendsto (fun N : ℝ => coherentInformationMaximum 1 eta N) atTop
        (nhds ((max 0 (Real.log eta - Real.log (1 - eta)) : ℝ) : EReal))) ∧
    Tendsto (fun N : ℝ => holevoMessagePrivacyCapacityNats 1 1 N) atTop (nhds ⊤) ∧
    Tendsto (fun N : ℝ => coherentInformationMaximum 1 1 N) atTop (nhds ⊤) := by sorry

end QAlgorithms.Papers.Independent.Support50.P06

end
Source
Capacity of the Bosonic Wiretap Channel and the Entropy Photon-Number Inequality, arXiv:0801.0841v1, PDF p. 3, §III, unnumbered high-input-photon-number limit
Read-back

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

Assume the global assertion that, for every positive integer rrr, 0≤t≤10\le t\le10≤t≤1, and K≥0K\ge0K≥0, the diagonal kernel

Tr(K)ab=1a=b∏i=0r−1(K/(K+1))aiK+1T_r(K)_{ab}=\mathbf1_{a=b}\prod_{i=0}^{r-1}\frac{(K/(K+1))^{a_i}}{K+1}Tr​(K)ab​=1a=b​i=0∏r−1​K+1(K/(K+1))ai​​

has entropy S(Tr(K))=ofReal⁡(rg(K))S(T_r(K))=\operatorname{ofReal}(r g(K))S(Tr​(K))=ofReal(rg(K)), the kernel Mt(Vr,Tr(K))M_t(V_r,T_r(K))Mt​(Vr​,Tr​(K)) has entropy ofReal⁡(rg((1−t)K))\operatorname{ofReal}(r g((1-t)K))ofReal(rg((1−t)K)), and every density kernel XXX with entropy ofReal⁡(rg(K))\operatorname{ofReal}(r g(K))ofReal(rg(K)) satisfies ofReal⁡(rg((1−t)K))≤S(Mt(Vr,X))\operatorname{ofReal}(r g((1-t)K))\le S(M_t(V_r,X))ofReal(rg((1−t)K))≤S(Mt​(Vr​,X)), where g(x)=(x+1)log⁡(x+1)−xlog⁡xg(x)=(x+1)\log(x+1)-x\log xg(x)=(x+1)log(x+1)−xlogx. Then, for every 0<η<10<\eta<10<η<1, writing Lη=max⁡(0,log⁡η−log⁡(1−η))L_\eta=\max(0,\log\eta-\log(1-\eta))Lη​=max(0,logη−log(1−η)), the asserted limits as real N→+∞N\to+\inftyN→+∞ are

C1(η,N)⟶ofReal⁡(Lη),J1(η,N)⟶Lη,\mathcal C_1(\eta,N)\longrightarrow\operatorname{ofReal}(L_\eta), \qquad \mathcal J_1(\eta,N)\longrightarrow L_\eta,C1​(η,N)⟶ofReal(Lη​),J1​(η,N)⟶Lη​,

in the extended nonnegative reals and the extended reals, respectively; at η=1\eta=1η=1, both limits are +∞+\infty+∞. Here a density kernel XXX on Nr\mathbb N^rNr admits Xab=∑juj(a)vj(b)‾X_{ab}=\sum_j u_j(a)\overline{v_j(b)}Xab​=∑j​uj​(a)vj​(b)​, with uj,vj∈ℓ2(Nr;C)u_j,v_j\in\ell^2(\mathbb N^r;\mathbb C)uj​,vj​∈ℓ2(Nr;C) and ∑j∥uj∥∥vj∥<∞\sum_j\|u_j\|\|v_j\|<\infty∑j​∥uj​∥∥vj​∥<∞, has real nonnegative finite quadratic forms, and has summable real diagonal entries of sum 111. Its entropy S(X)S(X)S(X) is the infimum of ∑jofReal⁡(−pjlog⁡pj)\sum_j\operatorname{ofReal}(-p_j\log p_j)∑j​ofReal(−pj​logpj​) over countable representations Xab=∑jpjuj(a)uj(b)‾X_{ab}=\sum_jp_j u_j(a)\overline{u_j(b)}Xab​=∑j​pj​uj​(a)uj​(b)​, with nonnegative summable weights of sum 111, normalized positive-weight vectors, and orthogonality between distinct positive-weight vectors; zero-weight vectors are unrestricted, and the infimum over no representations is +∞+\infty+∞. The mixing maps are specified by

bt(m,l;p,q)=1m+l=p+qm! l!p! q!∑0≤u≤pu≤m, m−u≤q(pu)(qm−u)(t)u(1−t)p−u+(m−u)(−t)q−(m−u),Bt((a,e),(p,q))=∏ibt(ai,ei;pi,qi),Bt(X,Y)uv=∑a∑bBt(u,a)Xa1b1Ya2b2Bt(v,b)‾,Mt(X,Y)ab=∑eBt(X,Y)(a,e),(b,e),Vrab=1a=0, b=0,PtX=Mt(X,Vr),(EtX)ab=∑eBt(X,Vr)(e,a),(e,b).\begin{aligned} b_t(m,l;p,q) &=\mathbf1_{m+l=p+q}\sqrt{\frac{m!\,l!}{p!\,q!}} \sum_{\substack{0\le u\le p\\u\le m,\ m-u\le q}} \binom pu\binom q{m-u} (\sqrt t)^u(\sqrt{1-t})^{p-u+(m-u)} (-\sqrt t)^{q-(m-u)},\\ B_t((a,e),(p,q))&=\prod_i b_t(a_i,e_i;p_i,q_i),\\ \mathcal B_t(X,Y)_{uv} &=\sum_a\sum_b B_t(u,a)X_{a_1b_1}Y_{a_2b_2}\overline{B_t(v,b)},\\ M_t(X,Y)_{ab}&=\sum_e\mathcal B_t(X,Y)_{(a,e),(b,e)},\qquad V_r{}_{ab}=\mathbf1_{a=0,\ b=0},\\ P_tX&=M_t(X,V_r),\qquad (E_tX)_{ab}=\sum_e\mathcal B_t(X,V_r)_{(e,a),(e,b)}. \end{aligned}bt​(m,l;p,q)Bt​((a,e),(p,q))Bt​(X,Y)uv​Mt​(X,Y)ab​Pt​X​=1m+l=p+q​p!q!m!l!​​0≤u≤pu≤m, m−u≤q​∑​(up​)(m−uq​)(t​)u(1−t​)p−u+(m−u)(−t​)q−(m−u),=i∏​bt​(ai​,ei​;pi​,qi​),=a∑​b∑​Bt​(u,a)Xa1​b1​​Ya2​b2​​Bt​(v,b)​,=e∑​Bt​(X,Y)(a,e),(b,e)​,Vr​ab​=1a=0, b=0​,=Mt​(X,Vr​),(Et​X)ab​=e∑​Bt​(X,Vr​)(e,a),(e,b)​.​

The sums over a,ba,ba,b in Bt\mathcal B_tBt​ range over pairs of number strings. Set E(X)=∑i∑aofReal⁡(aiRe⁡Xaa)\mathcal E(X)=\sum_i\sum_a\operatorname{ofReal}(a_i\operatorname{Re}X_{aa})E(X)=∑i​∑a​ofReal(ai​ReXaa​) and Jη(X)=S(PηX)real−S(EηX)realJ_\eta(X)=S(P_\eta X)^{\mathrm{real}}-S(E_\eta X)^{\mathrm{real}}Jη​(X)=S(Pη​X)real−S(Eη​X)real, where infinite entropy converts to real 000; then J1(η,N)\mathcal J_1(\eta,N)J1​(η,N) is the extended-real supremum of Jη(X)J_\eta(X)Jη​(X) over one-mode density kernels with E(X)≤ofReal⁡(N)\mathcal E(X)\le\operatorname{ofReal}(N)E(X)≤ofReal(N). For the capacity C1(η,N)\mathcal C_1(\eta,N)C1​(η,N), a length-rrr private code has M>0M>0M>0 messages, nonnegative summable weights wkw_kwk​ of sum 111, density kernels XmkX_{mk}Xmk​, and effects DmD_mDm​ with real nonnegative finite quadratic forms and ∑m(Dm)ab=1a=b\sum_m(D_m)_{ab}=\mathbf1_{a=b}∑m​(Dm​)ab​=1a=b​. Its budget is M−1∑m∑kofReal⁡(wk)E(Xmk)M^{-1}\sum_m\sum_k\operatorname{ofReal}(w_k)\mathcal E(X_{mk})M−1∑m​∑k​ofReal(wk​)E(Xmk​), and its leakage is

S ⁣(M−1∑mZm)\dotminusM−1∑mS(Zm),Zm=∑kwkEηXmk,S\!\left(M^{-1}\sum_mZ_m\right)\mathbin{\dotminus}M^{-1}\sum_mS(Z_m), \qquad Z_m=\sum_kw_kE_\eta X_{mk},S(M−1m∑​Zm​)\dotminusM−1m∑​S(Zm​),Zm​=k∑​wk​Eη​Xmk​,

using extended nonnegative subtraction, including +∞\dotminus+∞=0+\infty\mathbin{\dotminus}+\infty=0+∞\dotminus+∞=0. A rate R≥0R\ge0R≥0 is achievable if, for every 0<ϵ<10<\epsilon<10<ϵ<1 and δ>0\delta>0δ>0, all sufficiently large positive rrr admit such a code with budget at most ofReal⁡(rN)\operatorname{ofReal}(rN)ofReal(rN), leakage at most ofReal⁡(ϵ)\operatorname{ofReal}(\epsilon)ofReal(ϵ), log⁡M/r≥R−δ\log M/r\ge R-\deltalogM/r≥R−δ, and

Re⁡∑a∑b(PηXmk)ab(Dm)ba>1−ϵfor every m,k,\operatorname{Re}\sum_a\sum_b(P_\eta X_{mk})_{ab}(D_m)_{ba}>1-\epsilon \quad\text{for every }m,k,Rea∑​b∑​(Pη​Xmk​)ab​(Dm​)ba​>1−ϵfor every m,k,

even when wk=0w_k=0wk​=0; C1(η,N)\mathcal C_1(\eta,N)C1​(η,N) is the supremum of ofReal⁡(R)\operatorname{ofReal}(R)ofReal(R) over such rates. Here ofReal⁡(x)=max⁡(x,0)\operatorname{ofReal}(x)=\max(x,0)ofReal(x)=max(x,0) in the extended nonnegative reals. The first pair of limits includes η=12\eta=\tfrac12η=21​, where the displayed limiting value is 000; η=0\eta=0η=0 is not covered.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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