Uniform 0.06-bit gap after Eq. (9)
OpenQAlgorithms.Papers.Independent.Intakenext100.P62.balancedGapBitsAll 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 all , let and . Then
Thus the explicit balanced upper and coherent-signal lower bounds differ by at most bits uniformly in both photon means. The statement compares numerical bounds on capacity.
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.3, sentence after (9): the balanced numerical upper bound minus
the Holevo coherent-signal lower bound is at most 0.06 bits, uniformly over
both photon means. This compares explicit bounds, not capacity with itself. -/
theorem balancedGapBits (NE N : ℝ) (hNE : 0 ≤ NE) (hN : 0 ≤ N) :
balancedThermalUpperNats NE N / Real.log 2 -
coherentSignalRateBits (1 / 2) NE N ≤ (6 / 100 : ℝ) := 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 pair of nonnegative real numbers , the theorem asserts the real inequality
All logarithms here are natural logarithms, including the total convention . The assumptions include and ; the displayed terms are real numbers without nonnegative truncation.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.