Theorem 6, Eq. (11): one-way distillable-entanglement monogamy
OpenQAlgorithms.Papers.Independent.Gap48.P35.one_way_distillation_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.
Let be any density state. On the right cooperate and send classical messages to ; on the left and separately send to .
This monogamy statement assumes neither purity nor the existence of compatible good protocols.
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 pp.4--5, Theorem 6, Eq.(11): one-way distillation monogamy for every tripartite state, without purity or simultaneous-protocol hypotheses. -/
theorem one_way_distillation_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) :
distillLeft (marginalRA rho) + distillLeft (marginalRB rho) ≤ distillLeft 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 with decidable equality, and every positive semidefinite complex matrix on of trace one, writing and , one has
For an ordered bipartite state , denotes the supremum over real admitting a sequence of protocols, one for every natural block length . In each protocol ; the sender applies an instrument having a positive finite number of classical outcomes , a finite number of Kraus operators per outcome, and ; conditional on , the receiver applies a channel with . Thus, in sender–receiver order, the output is . The required conditions are
There is no bound on the number of communicated outcomes. The sequence must also contain a valid protocol at ; the rate quotient there is defined to be zero, and the limits concern .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.