Asymptotic relative entropy of entanglement across every receiver cut
OpenQAlgorithms.Papers.Independent.Support50.P48.ree_cut_limitsLet , , , and . Let be the actual output obtained by transmitting half of a TMSV with finite mean photon number through the vacuum pure-loss broadcast channel. For a nonempty receiver subset , let be its receiver complement. Relative entropy of entanglement is the infimum of quantum relative entropy in bits over all normal separable states, using trace-norm closed separability. Then
where if , if and , and otherwise , with .
For two receivers the three nonempty cuts give (21), (25), and (26). This is an energy limit of actual resource-state REEs, not an exact finite-energy formula or a finite-energy operational converse.
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.4, (21),(25)-(26); PDF p.6, (31), interpreted as an energy limit.
The printed numerator in (31) is 1-eta_complement(T), consistently with
(27) and the preceding line of (31); no numerator correction is made.
The limit is zero for a zero selected signal, and infinite for positive signal
with no loss, as inferred from the source proof at the allowed endpoints.
There is no exact finite-energy REE formula in this statement. -/
theorem ree_cut_limits {m : ℕ} (hm : 0 < m)
(p : PureLossBroadcastParameters m) (T : Finset (Fin m)) (hT : T.Nonempty) :
(∀ N : ℝ≥0, IsDensity (resourceCut p N T)) ∧
Tendsto (fun N : ℝ≥0 => relativeEntanglementBits (resourceCut 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, let for satisfy , and let be nonempty. Set and , and define index sets and . For , , and , set
Formal infinite sums here take value zero if not summable. For any index set , call a matrix on a density matrix when it admits an expansion with and , every finite quadratic form is real and nonnegative, and its real diagonal entries are summable with sum one. Define as the infimum, over all such expansions of , of , with empty infimum . Let consist of the density matrices on such that, for every , some finite real convex combination of product density matrices satisfies . For matrices on , set
where subscripts denote principal submatrices and matrix logarithms use the continuous functional calculus of the total real logarithm, for which . The theorem asserts that is a density matrix for every nonnegative real , including zero, and that, as through nonnegative real values,
in . Nonempty is permitted to have total weight , and its complement is permitted to be empty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.