§III unnumbered, Eq. (12): stronger mixed-state secret-key inequality
OpenQAlgorithms.Papers.Independent.Gap48.P35.mixed_key_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, possibly mixed. Only the first term discards . The second gives both and to Eve, while the right side lets cooperate.
This is the stronger mixed-state inequality and imposes no global purity assumption.
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.5, Eq.(12): arbitrary mixed ABCE. Only the FIRST term traces C away; the second gives B to Eve and the third groups BC. -/
theorem mixed_key_monogamy {A : Type} {B : Type} {C : Type} {E : Type}
[Fintype A] [DecidableEq A] [Nonempty A] [Fintype B] [DecidableEq B] [Nonempty B] [Fintype C] [DecidableEq C] [Nonempty C] [Fintype E] [DecidableEq E] [Nonempty E]
(rho : Op (A × (B × (C × E)))) (hrho : IsDensityMatrix rho) :
keyLeft (dropC rho) + keyLeft (groupACBE rho) ≤ keyLeft (groupABCE 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 all finite, nonempty sets , each with decidable equality, and every positive semidefinite trace-one matrix on , let . Then
The second and third terms use the coordinate orderings and , respectively. For any state in sender–receiver–environment order , is the supremum over real admitting protocols for every natural block length , with positive integers , a sender POVM , and receiver POVMs , one for each ; all their effects are positive semidefinite and sum to the appropriate identity. Set
The protocols must admit with and a fixed such that , , and . At each , there must be density matrices on satisfying and for every , and , where . This quantification includes zero-mass keys and , with division by zero in the rate quotient defined as zero. No purity hypothesis is imposed on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.