Limited-entanglement classical deficit and allocation
ProvedQAlgorithms.Papers.Independent.Gap48.P44.classical_deficit_and_allocationprove2quantum
Write and for , with . Let , , , and . Put and . Then
For , the feasible allocation gives , provided and .
The first display is in nats; the allocation gives an error in bits. The difference on the left is the one explicitly computed in the source proof.
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.9-10, Proposition 6: the proof supplies the missing printed LHS.
The first bound is in nats; the allocation conclusion is in bits.
Printed: only 5/(6 lambda N_S (1-eta)); changed: attach the difference explicitly
computed at the beginning of the proof. Why: the bound otherwise has no subject.
Independent moderation of this source-domain interpretation remains pending. -/
theorem classical_deficit_and_allocation (eta share budget : ℝ)
(heta0 : 0 ≤ eta) (heta1 : eta < 1) (hshare : share ∈ Set.Icc (0 : ℝ) 1)
(hbudget : 0 ≤ budget) (hthreshold : 2 ≤ share * (1 - eta) * budget) :
(g budget + g (eta * budget) - g ((1 - eta) * budget) -
(g (share * budget) + g (eta * budget) - g ((1 - eta) * share * budget)) ≤
5 / (6 * share * budget * (1 - eta))) ∧
(∀ epsilon : ℝ, 0 < epsilon →
let allocation := 5 / (6 * epsilon * budget * (1 - eta) * Real.log 2)
allocation ∈ Set.Icc (0 : ℝ) 1 → 2 ≤ allocation * (1 - eta) * budget →
|thermalEntropy budget + thermalEntropy (eta * budget) -
thermalEntropy ((1 - eta) * budget) -
(thermalEntropy (allocation * budget) + thermalEntropy (eta * budget) -
thermalEntropy ((1 - eta) * allocation * budget))| ≤ epsilon) := by sorry
end QAlgorithms.Papers.Independent.Gap48.P44
end
Source
Quantum trade-off coding for bosonic communication, arXiv:1105.0119v4, PDF p. 9, Proposition 6: limited-entanglement classical deficit and allocation rule
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For real satisfying , , , and , define and , with . Then
Also, for every real , set ; if and , then
All the original hypotheses, including those concerning , apply to both conclusions; they force and , while allowing . The first conclusion is a one-sided bound without an absolute value, and the second applies only when its stated allocation conditions hold.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.