Actual TMSV broadcast conditional entropies and their unconstrained limits
ProvedQAlgorithms.Papers.Independent.Support50.P48.conditional_entropy_evaluationLet , let with , and put . For finite mean photon number , send one half of the normalized two-mode squeezed vacuum through the vacuum pure-loss broadcast channel. Denote its purification by and its reduced-state von Neumann entropies, in bits, by . All of its subsystem entropies are finite. For every nonempty receiver subset , write and let be its receiver complement. Then
where with . As , this nonnegative difference converges in to : zero if , infinity if and , and otherwise.
This evaluates the actual resource-state conditional entropies used in the merging inner bound. Formalization Note The full Fock coefficients and actual partial traces are used; real entropy differences are accompanied by finiteness conclusions. Fixed local output phase rotations do not affect these entropies.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P48
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P48
open Filter
open scoped BigOperators ENNReal NNReal Topology
open QAlgorithms.Papers.Independent.Dependency50.P30
(PureLossBroadcastParameters thermalEntropyBits)
open QAlgorithms.Papers.Independent.Dependency50.P33
(State IsDensity IsSeparable)
open QAlgorithms.Papers.Independent.Frontier18.P07
(extendedEntropyNats extendedRelativeEntropyNats)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF p.3, entropy calculation and (12)-(13); PDF p.6, after (29).
All marginal entropies are finite for finite N. The conditional entropy is
computed from the actual TMSV output, not defined by the claimed g-difference.
The extended endpoint limit is inferred from that finite-energy difference. -/
theorem conditional_entropy_evaluation {m : ℕ} (hm : 0 < m)
(p : PureLossBroadcastParameters m) (T : Finset (Fin m)) (hT : T.Nonempty) :
(∀ N : ℝ≥0, IsDensity (purifiedResource p N) ∧
(∀ S : Finset (ResourceMode m), resourceEntropyBits p N S ≠ ⊤) ∧
reverseCutYield p N T =
(resourceEntropyBits p N (environmentWith T)).toReal -
(resourceEntropyBits p N (environmentWith ∅)).toReal ∧
reverseCutYield p N T =
thermalEntropyBits (((portWeight p none : ℝ) +
(∑ i ∈ T, (p.transmissivity i : ℝ))) * (N : ℝ)) -
thermalEntropyBits ((portWeight p none : ℝ) * (N : ℝ))) ∧
Tendsto (fun N : ℝ≥0 => ENNReal.ofReal (reverseCutYield p N T))
atTop (𝓝 (extendedCutBound p T)) := by sorry
end QAlgorithms.Papers.Independent.Support50.P48
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a natural number with , let for satisfy , and let be nonempty. Set and . Use mode labels and, for each , define
For a subset of the mode labels and occupations , define the matrix
where uses on and on its complement; this formal infinite sum is zero if the summands are not summable. For any matrix indexed by a set , define
where is the principal submatrix and is the continuous functional calculus of the real logarithm, with scalar . Write , , and let . Put , where the real-value operation is the identity on finite values and sends to zero. The theorem asserts that, for every , is a density matrix in the following precise sense: it has an expansion with of the occupation index set and ; every finite quadratic form is real and nonnegative; and its real diagonal entries are summable with sum one. Moreover, every is finite, and
using the total logarithm convention at zero. Finally, as the nonnegative real variable tends to infinity,
in . The assertions for every include , and nonempty does not require .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.