Conditional thermal capacity bound, Eq. (A14) = (A17), and 0.16-bit claim
OpenQAlgorithms.Papers.Independent.Intakenext100.P62.conditionalThermalCapacityAll 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.
Assume universally the general quantum EPI: for every positive mode count, all independent normalized full-Fock inputs and every , the output entropy power is at least the weighted sum of input entropy powers. Under this premise, for all thermal parameters , , put
Then
This retains both the conditional capacity inequality and its advertised uniform bit-gap consequence. The universal premise is not asserted as a theorem.
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.4,7,9, (A14)/(A17): conditional thermal capacity upper bound
and advertised uniform 0.16-bit numerical gap from the Holevo lower bound.
The universal conjecture precedes every channel parameter; it is not inferred
from the proved balanced EPI. -/
theorem conditionalThermalCapacity (hEPI : GeneralQuantumEPI)
(lam NE N : ℝ) (hlam0 : 0 ≤ lam) (hlam1 : lam ≤ 1)
(hNE : 0 ≤ NE) (hN : 0 ≤ N) :
photonCapacityNats (thermalNoiseChannelKernel lam NE) N ≤
ENNReal.ofReal (conjecturedThermalUpperNats lam NE N) ∧
conjecturedThermalUpperNats lam NE N / Real.log 2 -
coherentSignalRateBits lam NE N ≤ (16 / 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
Assume the following universal entropy-power inequality: for every positive integer , every , and all states on ,
Then, for every and every , the declaration asserts both
and
All logarithms here are natural logarithms. The notation denotes , viewed as an extended nonnegative real. In the universal premise, if , and otherwise ; entropy is defined for any complex kernel by
where is its principal restriction and is the real logarithm applied by continuous functional calculus. The supremum includes the empty restriction. A state on any index set is a kernel having an expansion , with and , such that every finite quadratic form is real and nonnegative, and with summable real diagonal. The mixing kernel in the premise is
where the sums over and are nested in that order, , and
To specify the channel in the conclusion, write for a chosen bounded complex-linear operator on with matrix , if such an operator exists, and for the zero operator otherwise; write , where is the standard basis vector. Then
where this is a sum over the pair , and
Finally, means times the supremum, in the extended nonnegative reals, of all nonnegative rates with this property: for every , there is a positive integer such that every integer admits a positive number of messages, states on , and bounded operators on whose quadratic forms are real and nonnegative and whose sum is the identity, satisfying
Here is defined by applying successively to coefficient slices in each coordinate: its zeroth power leaves the scalar kernel on the singleton unchanged, and
Thus the budget restricts the uniformly averaged input, and the success requirement is averaged over messages. The universal premise includes both mixing endpoints, arbitrary states without energy or entropy restrictions, and infinite entropy values; extended arithmetic uses . The conclusion includes , , and . The real-valued gap inequality is asserted without positive-part truncation. Real logarithms use the total convention , and the operator choices above retain their zero fallback when no bounded realization exists.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.