Theorem II.2: squashed-entanglement outer bound
OpenQAlgorithms.Papers.Independent.Support50.P09.distributedCompression_outerLet and let be a normalized pure state on finite nonzero Hilbert spaces. All entropies are von Neumann entropies in bits of marginals of this same state. For , write and
Let be the closure of achievable nonnegative rate tuples: for every , every sufficiently large positive blocklength admits independent local CPTP encoders and a joint receiver CPTP decoder, with and squared fidelity at least with the entire original pure state on . The reference is untouched; no auxiliary communication or supplied shared entanglement is allowed.
For a normalized state with finite nonzero local systems, define
Entropies are in bits. The infimum ranges over all normalized extensions and every positive finite dimension of , with no dimension bound or attainment assumption. One-party inputs use this same entropy expression and have value zero.
Every tuple in the closed operational rate region satisfies
The correction is evaluated on the actual marginal and lies outside the factor in . For its value is defined to be zero.
This is the necessary rate bound, extended to the closure by continuity of the linear inequalities.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P09
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P09
open QAlgorithms.Papers.Independent.Claimed50.P33
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
section Compression
variable {m : ℕ} {D : Fin m → Type} [∀ i, Fintype (D i)] [hD : ∀ i, Nonempty (D i)]
variable {R : Type} [Fintype R] [hR : Nonempty R]
variable (phi : EuclideanSpace ℂ (RegisterBasis D × R)) (hphi : ‖phi‖ = 1)
include hphi hD hR
/-- Theorem II.2, PDF p.6: the unrestricted-extension correction lies outside 1/2.
The necessary inequalities extend to the closed rate region. -/
theorem distributedCompression_outer (hm : 0 < m) :
multipartyCompressionRegion (pureDensity phi) ⊆ outerPolyhedron (pureDensity phi) := by sorry
end Compression
end QAlgorithms.Papers.Independent.Support50.P09
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let , let and be the ambient finite register and reference bases, and put for the ambient vector . For any matrix , use , with , , applied by continuous functional calculus. Let be the closure of the nonnegative rate vectors such that, for every , all sufficiently large positive integers admit positive compressed dimensions , independent encoders , and a joint decoder , satisfying and
where , reordered to put the reference copies first, and every encoder and decoder has a finite Kraus representation with . Write for the marginal retaining registers in and , and for the marginal retaining alone. Define ; for nonempty , define
where the infimum ranges over every positive integer and every positive semidefinite trace-one matrix on the selected registers and an auxiliary basis , with . Every satisfies, for every subset , including the empty subset,
These infima are real-valued infima, whose value on an empty candidate set is ; the displayed declaration does not assume .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.