Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Figure 3: capacity bound for arbitrary beam-splitter environment

Open
QAlgorithms.Papers.Independent.Intakenext100.P62.generalEnvironmentCapacity

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

prove2quantum

All capacities below are unassisted operational capacities: finite message codes may use arbitrary mixed signal states entangled across channel uses and arbitrary collective output POVMs. The uniform-message average decoding error vanishes at all sufficiently large blocklengths. The constraint is ensemble-average total input photon number at most nNnNnN for nnn uses. Write g(x)=(x+1)ln⁡(x+1)−xln⁡xg(x)=(x+1)\ln(x+1)-x\ln xg(x)=(x+1)ln(x+1)−xlnx, with 0ln⁡0=00\ln0=00ln0=0, and use nats unless bits are specified.

Fix 0≤λ≤10\le\lambda\le10≤λ≤1, N≥0N\ge0N≥0 and any normalized one-mode environment state σ\sigmaσ. Each use mixes the signal with a fresh independent copy of σ\sigmaσ and retains the plus port, defining E\mathcal EE. Define Smax⁡(E,N)S_{\max}(\mathcal E,N)Smax​(E,N) as the supremum of output entropy over normalized one-mode inputs of mean photons at most NNN. Then

C(E,N)+(1−λ)S(σ)≤Smax⁡(E,N).C(\mathcal E,N)+(1-\lambda)S(\sigma)\le S_{\max}(\mathcal E,N).C(E,N)+(1−λ)S(σ)≤Smax​(E,N).

This is the caption's subtraction bound whenever finite. The additive extended interpretation also retains environments of infinite entropy, and adds no attainment or finite-energy assumption on the environment.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P62
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P62

open scoped ENNReal BigOperators

open QAlgorithms.Papers.Independent.Dependency50.P33 (State productCoeff)

open QAlgorithms.Papers.Independent.Frontier18.P07 (extendedEntropyNats)

open QAlgorithms.Papers.Independent.Claimed50.P19 (FockIndex)

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

open QAlgorithms.Papers.Independent.Frontier18.P18 (operatorCoeff boundedOperator)

open QAlgorithms.Papers.Independent.Gap48.P26 (weightedPhotonExpectation)

open QAlgorithms.Papers.Independent.Bridge50.P28
  (classicalPhotonCapacityBits thermalNoiseChannelKernel coherentSignalRateBits)

open QAlgorithms.Papers.Independent.Next46.P17
  (beamSplitter bosonicEntropyPower diffusionChannel TotalFisherRegular totalFisher)

/-- PDF p.4, Fig.3 caption (derived on p.8): capacity for an arbitrary fixed
one-mode environment. This additive form agrees with the displayed subtraction
when finite and avoids infinity-minus-infinity for infinite environment entropy.
At lambda=1 the environment contribution is zero, even at infinite entropy. -/
theorem generalEnvironmentCapacity (lam N : ℝ)
    (hlam0 : 0 ≤ lam) (hlam1 : lam ≤ 1) (hN : 0 ≤ N) (sigma : State ℕ) :
    photonCapacityNats (oneModeBeamChannel lam sigma) N +
      ENNReal.ofReal (1 - lam) * extendedEntropyNats sigma.coefficients ≤
    maximumOutputEntropyNats (oneModeBeamChannel lam sigma) N := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P62

end
Source
Limits on classical communication from quantum entropy power inequalities, arXiv:1205.3407v2, PDF p. 4, Figure 3: capacity bound for arbitrary beam-splitter environment
Read-back

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

For every real 0≤λ≤10\le\lambda\le10≤λ≤1, every real N≥0N\ge0N≥0, and every state σ\sigmaσ on N\mathbb NN, the theorem asserts

Cnat(Tλ,σ,N)+[1−λ]+H(σ)≤sup⁡ρ a state on N∑j′[jRe⁡ρjj]+≤NH(Tλ,σ(ρ))in [0,∞],C_{\mathrm{nat}}(T_{\lambda,\sigma},N) +[1-\lambda]_+H(\sigma) \le \sup_{\substack{\rho\text{ a state on }\mathbb N\\ \sum_j'[j\,\operatorname{Re}\rho_{jj}]_+\le N}} H(T_{\lambda,\sigma}(\rho)) \quad\text{in }[0,\infty],Cnat​(Tλ,σ​,N)+[1−λ]+​H(σ)≤ρ a state on N∑j′​[jReρjj​]+​≤N​sup​H(Tλ,σ​(ρ))in [0,∞],

where [x]+=max⁡(x,0)[x]_+=\max(x,0)[x]+​=max(x,0) is embedded in [0,∞][0,\infty][0,∞]. For any matrix AAA on a label set LLL,

H(A)=sup⁡s⊆Ls finite[(Re⁡tr⁡As)log⁡(Re⁡tr⁡As)−Re⁡tr⁡(Aslog⁡fcAs)]+,H(A)=\sup_{\substack{s\subseteq L\\s\text{ finite}}} \left[ (\operatorname{Re}\operatorname{tr}A_s)\log(\operatorname{Re}\operatorname{tr}A_s) -\operatorname{Re}\operatorname{tr}(A_s\log_{\mathrm{fc}}A_s) \right]_+,H(A)=s⊆Ls finite​sup​[(RetrAs​)log(RetrAs​)−Retr(As​logfc​As​)]+​,

including the empty principal submatrix and using continuous functional calculus of the total real logarithm. The map in the inequality is

Tλ,σ(X)ab=∑k′∑(p,q)∈N2′∑(r,s)∈N2′hλ(a,k;p,q)Xprσqshλ(b,k;r,s),T_{\lambda,\sigma}(X)_{ab} =\sum_k'\sum_{(p,q)\in\mathbb N^2}'\sum_{(r,s)\in\mathbb N^2}' h_\lambda(a,k;p,q)X_{pr}\sigma_{qs}h_\lambda(b,k;r,s),Tλ,σ​(X)ab​=k∑′​(p,q)∈N2∑′​(r,s)∈N2∑′​hλ​(a,k;p,q)Xpr​σqs​hλ​(b,k;r,s),

where

hλ(a,b;p,q)={a! b!p! q!∑i=0p∑j=0q1{i+j=a}(pi)(qj)(λ)i(1−λ)p−i(1−λ)j(−λ)q−j,a+b=p+q,0,otherwise.h_\lambda(a,b;p,q)= \begin{cases} \displaystyle \sqrt{\frac{a!\,b!}{p!\,q!}} \sum_{i=0}^{p}\sum_{j=0}^{q} \mathbf1_{\{i+j=a\}}\binom pi\binom qj (\sqrt\lambda)^i(\sqrt{1-\lambda})^{p-i} (\sqrt{1-\lambda})^j(-\sqrt\lambda)^{q-j}, &a+b=p+q,\\ 0,&\text{otherwise}. \end{cases}hλ​(a,b;p,q)=⎩⎨⎧​p!q!a!b!​​i=0∑p​j=0∑q​1{i+j=a}​(ip​)(jq​)(λ​)i(1−λ​)p−i(1−λ​)j(−λ​)q−j,0,​a+b=p+q,otherwise.​

A state AAA, here or in the coding condition below, is a matrix admitting Aab=∑r′ur(a)vr(b)‾A_{ab}=\sum_r'u_r(a)\overline{v_r(b)}Aab​=∑r′​ur​(a)vr​(b)​ with square-summable vectors ur,vru_r,v_rur​,vr​ and summable ∥ur∥∥vr∥\|u_r\|\|v_r\|∥ur​∥∥vr​∥, having real nonnegative finite quadratic forms, and having a summable real diagonal with sum 111. The quantity Cnat(T,N)C_{\mathrm{nat}}(T,N)Cnat​(T,N) is log⁡2\log2log2 times the supremum of nonnegative rates RRR such that, for every ϵ,δ>0\epsilon,\delta>0ϵ,δ>0, there exists n0>0n_0>0n0​>0 for which every integer n≥n0n\ge n_0n≥n0​ admits an integer M>0M>0M>0, states ρm\rho_mρm​ on Fn={0,…,n−1}→NF_n=\{0,\ldots,n-1\}\to\mathbb NFn​={0,…,n−1}→N, and bounded operators DmD_mDm​ on ℓ2(Fn;C)\ell^2(F_n;\mathbb C)ℓ2(Fn​;C) with real nonnegative quadratic forms and ∑mDm=I\sum_mD_m=I∑m​Dm​=I, satisfying

∑a∈Fn′[(∑ta(t))Re⁡ρˉaa]+≤nN,1M∑mRe⁡∑a∈Fn′∑b∈Fn′(T[n](ρm))ab(Dmea)b≥1−ϵ,R−δ≤log⁡Mnlog⁡2,ρˉ=M−1∑mρm.\sum_{a\in F_n}'\left[\left(\sum_ta(t)\right)\operatorname{Re}\bar\rho_{aa}\right]_+\le nN, \qquad \frac1M\sum_m\operatorname{Re}\sum_{a\in F_n}'\sum_{b\in F_n}' (T^{[n]}(\rho_m))_{ab}(D_me_a)_b\ge1-\epsilon, \qquad R-\delta\le\frac{\log M}{n\log2}, \quad \bar\rho=M^{-1}\sum_m\rho_m.a∈Fn​∑′​[(t∑​a(t))Reρˉ​aa​]+​≤nN,M1​m∑​Rea∈Fn​∑′​b∈Fn​∑′​(T[n](ρm​))ab​(Dm​ea​)b​≥1−ϵ,R−δ≤nlog2logM​,ρˉ​=M−1m∑​ρm​.

Here eae_aea​ is the coordinate unit vector, the zeroth power T[0]T^{[0]}T[0] acts on the unique empty-coordinate entry, and the recursion is

(T[n+1]X)a,b=(T[n] ⁣[(s,t)↦T ⁣[(i,j)↦X(i,s),(j,t)]a(0),b(0)])tail⁡a,tail⁡b.(T^{[n+1]}X)_{a,b} =\left(T^{[n]}\!\left[(s,t)\mapsto T\!\left[(i,j)\mapsto X_{(i,s),(j,t)}\right]_{a(0),b(0)} \right]\right)_{\operatorname{tail}a,\operatorname{tail}b}.(T[n+1]X)a,b​=(T[n][(s,t)↦T[(i,j)↦X(i,s),(j,t)​]a(0),b(0)​])taila,tailb​.

No energy or entropy bound on σ\sigmaσ is assumed. The theorem includes N=0N=0N=0 and both endpoints of λ\lambdaλ, permits infinite entropy and capacity, and uses 0⋅∞=00\cdot\infty=00⋅∞=0. Infinite complex sums have the displayed grouping and use value 000 for nonsummable families.

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