Pure-loss CE coding properly improves endpoint time sharing
ProvedQAlgorithms.Papers.Independent.Gap48.P44.pureLoss_ce_beats_timeSharingprove2quantum
Write and for , with . For , fix . Define , , and . Let contain the nonnegative pairs with and for some . Let contain the nonnegative pairs satisfying, for some , and . Then
The second coordinate is consumed entanglement, the negative of the source’s net entanglement rate. The endpoints have the same photon budget.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P44
Formal statement
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap48.P44
open Filter
open scoped ENNReal Topology
open QAlgorithms.Papers.Independent.Claimed50.P39 (g)
open QAlgorithms.Papers.Independent.Information100.P54 (thermalEntropy)
/-- PDF pp.7-8, Figure 2(b): proper CE-family inclusion at the caption's budget.
The second coordinate is nonnegative entanglement CONSUMPTION. -/
theorem pureLoss_ce_beats_timeSharing (eta : ℝ) (heta0 : 0 < eta) (heta1 : eta < 1) :
let budget := 50 / (1 - eta)
ceTimeSharing (thermalEntropy (eta * budget))
(thermalEntropy budget + thermalEntropy (eta * budget) -
thermalEntropy ((1 - eta) * budget)) (thermalEntropy budget) ⊂
lossCE eta budget := by sorry
end QAlgorithms.Papers.Independent.Gap48.P44
end
Source
Quantum trade-off coding for bosonic communication, arXiv:1105.0119v4, PDF p. 7, §III B / Figure 2(b): CE trade-off versus time sharing
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real with , put and define
Then the set
is a proper subset of
Thus every pair in the first set belongs to the second, and at least one pair in the second does not belong to the first; the parameters and include both endpoints.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.