Proposition 4, Eq. (8): common randomness dominates one-way distillation
OpenQAlgorithms.Papers.Independent.Gap48.P35.common_dominates_distillationAll 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. Both displayed rates permit only communication .
This compares operational net common randomness with one-way EPR distillation on the same input.
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.4, Proposition 4, Eq.(8): net common randomness dominates distillation, both with B-to-A communication. -/
theorem common_dominates_distillation {A : Type} {B : Type}
[Fintype A] [DecidableEq A] [Nonempty A] [Fintype B] [DecidableEq B] [Nonempty B]
(rho : Op (A × B)) (hrho : IsDensityMatrix rho) :
distillLeft rho ≤ commonLeft 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
Let be finite nonempty types with decidable equality and let be a positive semidefinite complex matrix of trace on . Define as the supremum of real rates for which there is a protocol at every natural block length , including , with a positive output dimension , a positive number of -party outcomes, Kraus matrices satisfying , and, for each , Kraus matrices satisfying , such that the output
satisfies and , where ; equivalently, one may keep the output order , as in the definition’s swapped input. No explicit nonnegativity condition is imposed on the real rate in this supremum, and division by zero at is assigned zero. Define , where is the supremum of real such that some , for every and all sufficiently large positive , permits a finite POVM on , maps from its outcomes to positive finite message and key alphabets, and a finite POVM on , satisfying , key alphabet size at most , disagreement at most , and key entropy at least ; each POVM consists of positive semidefinite effects summing to the identity, the joint law is , disagreement is , and key entropy is for . Then
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.