Lemma A.2: conditional classical additive-noise bounds and gap
OpenQAlgorithms.Papers.Independent.Intakenext100.P62.conditionalClassicalNoiseCapacityAll 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 the universal general quantum EPI for all positive mode counts, arbitrary independent states and all transmissivities, with nats entropy. For all finite photon increments and budgets , let be circular Gaussian displacement noise adding mean photon number , and the identity when . Set and . Then
The two decimal bounds are in nats and bits respectively. Here means the product . This is the full conditional capacity sandwich and uniform gap of Lemma A.2.
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.9, Lemma A.2, (A15)–(A16): conditional classical Gaussian-noise
capacity sandwich and both uniform numerical gap bounds. The logarithm contains
1+e*nu, not 1+exp(nu). Noise nu is the finite photon increment; nu=0 is included.
The numerical differences are upper-minus-lower, in nats and bits respectively. -/
theorem conditionalClassicalNoiseCapacity (hEPI : GeneralQuantumEPI)
(nu N : ℝ) (hnu : 0 ≤ nu) (hN : 0 ≤ N) :
ENNReal.ofReal (g (N + nu) - g nu) ≤
photonCapacityNats (classicalNoiseKernel nu) N ∧
photonCapacityNats (classicalNoiseKernel nu) N ≤
ENNReal.ofReal (g (N + nu) - Real.log (1 + Real.exp 1 * nu)) ∧
(g (N + nu) - Real.log (1 + Real.exp 1 * nu)) -
(g (N + nu) - g nu) ≤ (11 / 100 : ℝ) ∧
((g (N + nu) - Real.log (1 + Real.exp 1 * nu)) -
(g (N + nu) - g nu)) / Real.log 2 ≤ (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 that, for every positive integer , every , and every pair of states on ,
For every , the declaration then asserts all four inequalities
where , , logarithms are natural, and embedded in the extended nonnegative reals. In the premise, for and otherwise, while
using principal restrictions and continuous functional calculus for the real logarithm, including the empty restriction. A state on an index set is a complex kernel for which there are with and , all finite quadratic forms are real and nonnegative, and the real diagonal is summable with sum . The operation in the premise is
where and
To define , let be a chosen bounded complex-linear operator on with matrix , if one exists, and zero otherwise, and let for standard basis vectors . Define the displacement operator , where
Then ; for ,
with planar Lebesgue measure. The capacity is times the extended nonnegative supremum of all rates such that, for every , there is a positive integer for which every admits a positive integer , states on , and bounded operators on with real nonnegative quadratic forms and , satisfying
The coordinatewise power leaves the scalar kernel on unchanged at power zero and is recursively specified by
Consequently, both the input-energy constraint and decoding success in this definition are averages over the messages. The entropy-power hypothesis ranges over all positive numbers of modes and all states, without energy or finite-entropy hypotheses, includes , and uses extended arithmetic with . The conclusion includes and ; its two numerical gap bounds are inequalities between real expressions without truncation, whereas the capacity bounds use positive parts. All infinite sums and integrals are those of the total definitions, the bounded-operator constructions retain their zero fallback, and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.