Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Conditional bosonic private capacity, additivity and Gaussian coherent achievability

Open
QAlgorithms.Papers.Independent.Support50.P06.wiretap_privateCapacity

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

prove2quantum

Consider the full single-mode noiseless bosonic wiretap channel with vacuum environment, Bob transmissivity 0≤η≤10\le\eta\le10≤η≤1, and complementary Eve output from the same lossless beam splitter. Let Nˉ≥0\bar N\ge0Nˉ≥0 be a finite photon budget. Use unassisted classical private codes with arbitrary normalized mixed, possibly entangled block inputs, uniform messages, independent private discrete encoder randomness, and a normalized POVM decoder. The unconditional total input photon number, averaged over messages and randomness, is at most nNˉn\bar NnNˉ in an nnn-use block. For every message and random branch, decoding success exceeds 1−ϵ1-\epsilon1−ϵ; Holevo leakage about the message, after averaging the private randomness, tends to zero. Rates are ln⁡M/n\ln M/nlnM/n nats/use.

Assume global minimum output entropy conjecture 2: for every positive number of modes and every entropy shell S(ρ)=ng(K)S(\rho)=ng(K)S(ρ)=ng(K), mixing ρ\rhoρ with vacuum has minimum output entropy ng((1−η)K)ng((1-\eta)K)ng((1−η)K), attained by identical thermal inputs. Then

Cp(η,Nˉ)={g(ηNˉ)−g((1−η)Nˉ),η>1/2,\0,η≤1/2,g(x)=(x+1)ln⁡(x+1)−xln⁡x.C_p(\eta,\bar N)=\begin{cases}g(\eta\bar N)-g((1-\eta)\bar N),&\eta>1/2,\0,&\eta\le1/2,\end{cases}\qquad g(x)=(x+1)\ln(x+1)-x\ln x.Cp​(η,Nˉ)={g(ηNˉ)−g((1−η)Nˉ),​η>1/2,\0,​η≤1/2,​g(x)=(x+1)ln(x+1)−xlnx.

This rate is asymptotically achievable with product coherent signal states and collective block decoding, and restricting the encoder to such states leaves the capacity unchanged. For every positive nnn, the unrestricted nnn-letter private-information supremum under total budget nNˉn\bar NnNˉ equals nCp(η,Nˉ)nC_p(\eta,\bar N)nCp​(η,Nˉ); grouping any positive number of parallel identical modes multiplies operational capacity by that number. On the η>1/2\eta>1/2η>1/2 branch, the single-use coherent ensemble with isotropic prior p(α)=e−∣α∣2/Nˉ/(πNˉ)p(\alpha)=e^{-|\alpha|^2/\bar N}/(\pi\bar N)p(α)=e−∣α∣2/Nˉ/(πNˉ) has private information g(ηNˉ)−g((1−η)Nˉ)g(\eta\bar N)-g((1-\eta)\bar N)g(ηNˉ)−g((1−η)Nˉ) and thermal average input of mean Nˉ\bar NNˉ. Individual coherent signals have pure outputs at both receivers. At Nˉ=0\bar N=0Nˉ=0 the prior is the point mass at vacuum.

This identifies the conditional operational capacity and its single-use signal ensemble, while allowing arbitrarily long codes.

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 pp.2–3, §III Theorem, (10): conditional operational privacy capacity,
additivity, and coherent-state achievability with the printed Gaussian prior.
Printed (5) uses j=(m,k); changed to Holevo secrecy of m after averaging k,
because (6) and the proof use secret MESSAGE information. Rates use ln(M)/n
instead of the printed bit-count notation 2^(nR). At Nbar=0 the Gaussian prior
is its vacuum point mass. The Gaussian assertion concerns eta>1/2; zero rate
is achievable below that threshold. No one-shot error-free claim is made. -/
theorem wiretap_privateCapacity (hmoe : StrongConjecture2)
    (eta Nbar : ℝ) (heta : 0 ≤ eta) (heta_one : eta ≤ 1) (hNbar : 0 ≤ Nbar) :
    holevoMessagePrivacyCapacityNats 1 eta Nbar =
      ENNReal.ofReal (if 1 / 2 < eta then g (eta * Nbar) - g ((1 - eta) * Nbar) else 0) ∧
    holevoMessagePrivacyCapacityNats 1 eta Nbar true = holevoMessagePrivacyCapacityNats 1 eta Nbar ∧
    privateAchievable 1 eta Nbar true
      (if 1 / 2 < eta then g (eta * Nbar) - g ((1 - eta) * Nbar) else 0) ∧
    (∀ n : ℕ, 0 < n → blockPrivateInformation n eta Nbar =
      (((n : ℝ) * (if 1 / 2 < eta then
        g (eta * Nbar) - g ((1 - eta) * Nbar) else 0) : ℝ) : EReal)) ∧
    (∀ width : ℕ, 0 < width → holevoMessagePrivacyCapacityNats width eta Nbar =
      (width : ℝ≥0∞) * holevoMessagePrivacyCapacityNats 1 eta Nbar) ∧
    (1 / 2 < eta →
      gaussianPrivateInformation eta Nbar = g (eta * Nbar) - g ((1 - eta) * Nbar) ∧
      coherentMixture Nbar = identicalThermalKernel 1 Nbar ∧
      ∀ alpha : ℂ,
        spectralEntropyNats (pureLoss 1 eta (productCoherentKernel 1 (fun _ => alpha))) = 0 ∧
        spectralEntropyNats ((charlieMarginal (broadcast 1 eta (productCoherentKernel 1 (fun _ => alpha))))) = 0) := 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 Theorem, (10): conditional bosonic wiretap privacy capacity, additivity and coherent-state achievability
Read-back

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

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

(Tr(K))ab=1a=b∏i=0r−1(K/(K+1))aiK+1(T_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 first marginal of the specified mixing of the vacuum with Tr(K)T_r(K)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 on Nr\mathbb N^rNr satisfying S(X)=ofReal⁡(rg(K))S(X)=\operatorname{ofReal}(r g(K))S(X)=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)).

Here 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, with the total real logarithm, and ofReal⁡(x)=max⁡(x,0)\operatorname{ofReal}(x)=\max(x,0)ofReal(x)=max(x,0) in [0,+∞][0,+\infty][0,+∞]. For any real η,Nˉ\eta,\bar Nη,Nˉ with 0≤η≤10\le\eta\le10≤η≤1 and Nˉ≥0\bar N\ge0Nˉ≥0, put

F={g(ηNˉ)−g((1−η)Nˉ),η>12,0,η≤12.F=\begin{cases} g(\eta\bar N)-g((1-\eta)\bar N),&\eta>\tfrac12,\\ 0,&\eta\le\tfrac12. \end{cases}F={g(ηNˉ)−g((1−η)Nˉ),0,​η>21​,η≤21​.​

The theorem asserts simultaneously that

C1=ofReal⁡(F),C1coh=C1,F is coherently achievable,Ir=rF(r>0),Cw=wC1(w>0),\mathcal C_1=\operatorname{ofReal}(F),\qquad \mathcal C_1^{\mathrm{coh}}=\mathcal C_1,\qquad F\text{ is coherently achievable},\qquad \mathcal I_r=rF\quad(r>0),\qquad \mathcal C_w=w\mathcal C_1\quad(w>0),C1​=ofReal(F),C1coh​=C1​,F is coherently achievable,Ir​=rF(r>0),Cw​=wC1​(w>0),

where the fourth equality is in the extended real numbers and the other capacity equalities are in the extended nonnegative reals. The quantities in these assertions are defined as follows. A density kernel on Nr\mathbb N^rNr is a complex matrix XXX admitting a countable expansion 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​∥<∞, whose finite quadratic forms ∑a,b∈sza‾Xabzb\sum_{a,b\in s}\overline{z_a}X_{ab}z_b∑a,b∈s​za​​Xab​zb​ are real and nonnegative for every finite sss and every complex function zzz, and whose real diagonal entries are summable with sum 111. The 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 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)​, where the nonnegative weights are summable with sum 111, positive-weight vectors have norm 111, and distinct positive-weight vectors are orthogonal; zero-weight vectors are unrestricted, and the infimum is +∞+\infty+∞ if there is no such representation. To specify the mixing, define

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))=∏i=0r−1bt(ai,ei;pi,qi),Bt(X,Y)uv=∑a∈Nr×Nr∑b∈Nr×NrBt(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=0}^{r-1}b_t(a_i,e_i;p_i,q_i),\\ \mathcal B_t(X,Y)_{uv} &=\sum_{a\in\mathbb N^r\times\mathbb N^r} \sum_{b\in\mathbb N^r\times\mathbb N^r} 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)},\\ V_r{}_{ab}&=\mathbf1_{a=0,\ b=0},\qquad 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​Vr​ab​​=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=0∏r−1​bt​(ai​,ei​;pi​,qi​),=a∈Nr×Nr∑​b∈Nr×Nr∑​Bt​(u,a)Xa1​b1​​Ya2​b2​​Bt​(v,b)​,=e∑​Bt​(X,Y)(a,e),(b,e)​,=1a=0, b=0​,Pt​X=Mt​(X,Vr​),(Et​X)ab​=e∑​Bt​(X,Vr​)(e,a),(e,b)​.​

For a kernel XXX, its energy is

E(X)=∑i=0r−1∑a∈NrofReal⁡(aiRe⁡Xaa).\mathcal E(X)=\sum_{i=0}^{r-1}\sum_{a\in\mathbb N^r} \operatorname{ofReal}(a_i\operatorname{Re}X_{aa}).E(X)=i=0∑r−1​a∈Nr∑​ofReal(ai​ReXaa​).

A private code of length rrr consists of a positive message count MMM, nonnegative summable weights wkw_kwk​ with ∑kwk=1\sum_kw_k=1∑k​wk​=1, density kernels XmkX_{mk}Xmk​ for every 0≤m<M0\le m<M0≤m<M and k∈Nk\in\mathbb Nk∈N, and effects DmD_mDm​ whose finite quadratic forms are real and nonnegative and whose entries sum to ∑m(Dm)ab=1a=b\sum_m(D_m)_{ab}=\mathbf1_{a=b}∑m​(Dm​)ab​=1a=b​. It has photon budget 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​), eavesdropper kernels Zm=∑kwkEηXmkZ_m=\sum_kw_k E_\eta X_{mk}Zm​=∑k​wk​Eη​Xmk​ and Z‾=M−1∑mZm\overline Z=M^{-1}\sum_mZ_mZ=M−1∑m​Zm​, and leakage

S(Z‾)\dotminusM−1∑mS(Zm),S(\overline Z)\mathbin{\dotminus}M^{-1}\sum_mS(Z_m),S(Z)\dotminusM−1m∑​S(Zm​),

where subtraction is extended nonnegative subtraction, in particular +∞\dotminus+∞=0+\infty\mathbin{\dotminus}+\infty=0+∞\dotminus+∞=0. A real rate RRR is achievable at width www if R≥0R\ge0R≥0 and, for every 0<ϵ<10<\epsilon<10<ϵ<1 and every δ>0\delta>0δ>0, there is n0>0n_0>0n0​>0 such that for every integer n≥n0n\ge n_0n≥n0​ there is such a code of length nwnwnw, with photon budget at most ofReal⁡(nwNˉ)\operatorname{ofReal}(nw\bar N)ofReal(nwNˉ), leakage at most ofReal⁡(ϵ)\operatorname{ofReal}(\epsilon)ofReal(ϵ), rate R−δ≤log⁡M/nR-\delta\le\log M/nR−δ≤logM/n, and

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

including randomization indices of weight zero. Coherent achievability additionally requires every XmkX_{mk}Xmk​ to have entries

∏icαmk,i(ai) ∏icαmk,i(bi)‾,cα(j)=e−∣α∣2/2αjj!,\prod_i c_{\alpha_{mk,i}}(a_i)\, \overline{\prod_i c_{\alpha_{mk,i}}(b_i)}, \qquad c_\alpha(j)=e^{-|\alpha|^2/2}\frac{\alpha^j}{\sqrt{j!}},i∏​cαmk,i​​(ai​)i∏​cαmk,i​​(bi​)​,cα​(j)=e−∣α∣2/2j!​αj​,

for some complex amplitudes αmk,i\alpha_{mk,i}αmk,i​. The capacities Cw\mathcal C_wCw​ and Cwcoh\mathcal C_w^{\mathrm{coh}}Cwcoh​ are the suprema of ofReal⁡(R)\operatorname{ofReal}(R)ofReal(R) over achievable rates with and without this additional requirement, respectively. For a finite ensemble pj,Xjp_j,X_jpj​,Xj​, with positive alphabet size, pj≥0p_j\ge0pj​≥0, ∑jpj=1\sum_jp_j=1∑j​pj​=1, and density kernels XjX_jXj​, write X‾=∑jpjXj\overline X=\sum_jp_jX_jX=∑j​pj​Xj​ and

Jη(X)=S(PηX)real−S(EηX)real.J_\eta(X)=S(P_\eta X)^{\mathrm{real}}-S(E_\eta X)^{\mathrm{real}}.Jη​(X)=S(Pη​X)real−S(Eη​X)real.

Then Ir\mathcal I_rIr​ is the extended-real supremum of Jη(X‾)−∑jpjJη(Xj)J_\eta(\overline X)-\sum_jp_jJ_\eta(X_j)Jη​(X)−∑j​pj​Jη​(Xj​) over such ensembles with ∑jofReal⁡(pj)E(Xj)≤ofReal⁡(rNˉ)\sum_j\operatorname{ofReal}(p_j)\mathcal E(X_j)\le\operatorname{ofReal}(r\bar N)∑j​ofReal(pj​)E(Xj​)≤ofReal(rNˉ); the real conversion sends infinite entropy to 000. Finally, if η>12\eta>\tfrac12η>21​, the theorem also asserts

Jη(C‾Nˉ)−∫CJη(Cα) dμNˉ(α)=g(ηNˉ)−g((1−η)Nˉ),C‾Nˉ=T1(Nˉ),J_\eta(\overline C_{\bar N})-\int_{\mathbb C}J_\eta(C_\alpha)\,d\mu_{\bar N}(\alpha) =g(\eta\bar N)-g((1-\eta)\bar N),\qquad \overline C_{\bar N}=T_1(\bar N),Jη​(CNˉ​)−∫C​Jη​(Cα​)dμNˉ​(α)=g(ηNˉ)−g((1−η)Nˉ),CNˉ​=T1​(Nˉ),

and S(PηCα)=S(EηCα)=0S(P_\eta C_\alpha)=S(E_\eta C_\alpha)=0S(Pη​Cα​)=S(Eη​Cα​)=0 for every α∈C\alpha\in\mathbb Cα∈C. Here Cαab=cα(a)cα(b)‾C_\alpha{}_{ab}=c_\alpha(a)\overline{c_\alpha(b)}Cα​ab​=cα​(a)cα​(b)​, C‾N=∫Cα dμN(α)\overline C_N=\int C_\alpha\,d\mu_N(\alpha)CN​=∫Cα​dμN​(α) entry by entry, and μN\mu_NμN​ is the point mass at 000 when N=0N=0N=0, otherwise the measure with density e−∣α∣2/N/(πN)e^{-|\alpha|^2/N}/(\pi N)e−∣α∣2/N/(πN). The parameter endpoints η=0,1\eta=0,1η=0,1 and Nˉ=0\bar N=0Nˉ=0 are included; the block and width assertions quantify only over positive integers.

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