Paper-level main capacity bounds: Lemma A.1, Eqs. (8)–(9), (A1)–(A2)
OpenQAlgorithms.Papers.Independent.Intakenext100.P62.thermalCapacityBoundsAll 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 for uses. Write , with , and use nats unless bits are specified.
For every transmissivity , environment photon mean and input photon budget , the memoryless channel has a fresh independent thermal environment each use and satisfies
For it additionally satisfies
These are the paper's two explicit entropy-power capacity bounds.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P62
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 pp.3,8–9, (8)–(9), Lemma A.1, (A1)–(A2): both new capacity bounds,
in nats, including all zero-energy and transmissivity endpoints. The balanced
clause concerns the same environment and input budget. -/
theorem thermalCapacityBounds (lam NE N : ℝ)
(hlam0 : 0 ≤ lam) (hlam1 : lam ≤ 1) (hNE : 0 ≤ NE) (hN : 0 ≤ N) :
photonCapacityNats (thermalNoiseChannelKernel lam NE) N ≤
ENNReal.ofReal (g (lam * N + (1 - lam) * NE) - (1 - lam) * g NE) ∧
(lam = 1 / 2 →
photonCapacityNats (thermalNoiseChannelKernel lam NE) N ≤
ENNReal.ofReal (balancedThermalUpperNats NE N)) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P62
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all real , , and , the theorem asserts both
and
where is embedded in . The map is defined as follows: is a chosen bounded operator on with coefficient matrix , if one exists, and otherwise; writing , set
where and
The quantity is times the supremum of all nonnegative rates with this property: for every , all sufficiently large positive integers admit a positive number of state signals on and bounded positive operators on with , satisfying
Here a state admits a countable expansion with square-summable and summable , has real nonnegative finite quadratic forms, and has summable real diagonal of sum . The power is the recursive coordinatewise map with zeroth power acting on the unique empty-coordinate matrix entry and
The assertions include and or ; all capacities and inequalities use extended nonnegative arithmetic. Infinite complex sums retain their displayed grouping and take value when their families are nonsummable.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.