Theorem 7: purified-state one-way secret-key monogamy
OpenQAlgorithms.Papers.Independent.Gap48.P35.pure_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 a normalized pure state. In each term the systems after the vertical bar belong to Eve; all four systems are retained and merely regrouped.
This is pure-state secret-key monogamy. The first term gives both and to Eve.
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, Theorem 7: globally pure ABCE; Eve holds CE in the first term, BE in the second, and E in the grouped term. -/
theorem pure_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) (hpure : IsPure rho) :
keyLeft 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 finite, nonempty sets , each with decidable equality, let be a positive semidefinite trace-one matrix on , and additionally suppose for some . Then
The three terms use, respectively, the orderings , , and of the same matrix; regrouping changes no entries beyond this coordinate permutation. For a state ordered as sender , receiver , and environment , the quantity is the supremum over real rates with the following property. For every natural , there are positive integers , a sender POVM on , and, for each , a receiver POVM on ; every POVM consists of positive semidefinite matrices summing to the identity. Define
There must exist tending to zero and a real , independent of , such that , , and . For each , there must also exist density matrices and a common density matrix on such that and for every key , where ; finally . These requirements include , with its rate quotient defined as zero, and include keys of zero mass, for which the stated existence and distance conditions on still apply.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.