Figure 3: capacity bound for arbitrary beam-splitter environment
OpenQAlgorithms.Papers.Independent.Intakenext100.P62.generalEnvironmentCapacityAll 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.
Fix , and any normalized one-mode environment state . Each use mixes the signal with a fresh independent copy of and retains the plus port, defining . Define as the supremum of output entropy over normalized one-mode inputs of mean photons at most . Then
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.
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 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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real , every real , and every state on , the theorem asserts
where is embedded in . For any matrix on a label set ,
including the empty principal submatrix and using continuous functional calculus of the total real logarithm. The map in the inequality is
where
A state , here or in the coding condition below, is a matrix admitting with square-summable vectors and summable , having real nonnegative finite quadratic forms, and having a summable real diagonal with sum . The quantity is times the supremum of nonnegative rates such that, for every , there exists for which every integer admits an integer , states on , and bounded operators on with real nonnegative quadratic forms and , satisfying
Here is the coordinate unit vector, the zeroth power acts on the unique empty-coordinate entry, and the recursion is
No energy or entropy bound on is assumed. The theorem includes and both endpoints of , permits infinite entropy and capacity, and uses . Infinite complex sums have the displayed grouping and use value for nonsummable families.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.