Theorem 8, Eq. (13): squashed-entanglement monogamy
OpenQAlgorithms.Papers.Independent.Gap48.P35.squashed_monogamyAll systems are finite nonzero-dimensional complex quantum systems. Density states are positive semidefinite with trace one, and is von Neumann entropy in bits. Write for formation, for maximal Holevo correlation measured on the second party, for asymptotic singlet preparation cost, for EPR distillation rate, for net common randomness, and for secret-key rate. A left arrow means communication from the second legitimate party to the first. Key secrecy includes all public transcripts. Asymptotic tasks use independent copies, vanishing error and no extra initially shared resource.
For every bipartite state, , with conditional quantum mutual information in bits and all positive finite ancillary dimensions allowed. Let be any density state.
The inequality assumes neither an optimal extension nor a fixed bound on its dimension.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P35
namespace QAlgorithms.Papers.Independent.Gap48.P35
open scoped Matrix ComplexConjugate ComplexOrder
open Filter Topology
open Information100.P21 (Op)
open Information100.P08 (IsPure formation measuredCorrelation)
open Dependency50.P19 (marginalRA marginalRB)
noncomputable section
/-- PDF p.6, Theorem 8, Eq.(13): the accepted half-CMI infimum over every positive finite ancillary dimension; no minimizer is assumed. -/
theorem squashed_monogamy {A : Type} {B : Type} {C : Type}
[Fintype A] [DecidableEq A] [Nonempty A] [Fintype B] [DecidableEq B] [Nonempty B] [Fintype C] [DecidableEq C] [Nonempty C]
(rho : Op (A × (B × C))) (hrho : IsDensityMatrix rho) :
Claimed50.P12.squashedEntanglement (marginalRA rho) +
Claimed50.P12.squashedEntanglement (marginalRB rho) ≤
Claimed50.P12.squashedEntanglement rho := by sorry
end
end QAlgorithms.Papers.Independent.Gap48.P35
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every finite, nonempty , each equipped with decidable equality, and every positive semidefinite trace-one matrix on , let and . Then
where, for a bipartite matrix ,
Here the extension is ordered , , , and ; the entropy is , with applied by spectral functional calculus. The infimum ranges over all positive finite extension dimensions, without a fixed upper bound or an assertion that the infimum is attained; the original systems may have dimension one.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.