§III unnumbered: secret key versus net common randomness
OpenQAlgorithms.Papers.Independent.Gap48.P35.key_common_randomness_tradeoffAll 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. In the key task is Eve; in the second task is a legitimate party, and the right side lets cooperate.
The common randomness is net of communication, and the grouping retains both factors.
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, §III following Eq.(12): key on AB secret against C, plus net common randomness on AC, bounded by net common randomness on A:BC. -/
theorem key_common_randomness_tradeoff {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) :
keyLeft rho + commonLeft (marginalRB 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
For all finite, nonempty , each with decidable equality, and every positive semidefinite trace-one matrix on , put . Then
Here is the supremum over real admitting protocols at every natural block length , with positive integers , a sender POVM on , and receiver POVMs , one for each . With , , and , there must be tending to zero and a fixed such that , , , and there exist density matrices with and for every ; also . Every POVM consists of positive semidefinite effects summing to the identity, , and zero-mass keys remain subject to the stated existence conditions. The quantity is , where is the supremum over real such that some fixed has the following property: for every , all sufficiently large positive admit a sender POVM , a message in a positive finite message alphabet, a key in a positive finite alphabet of size , and receiver POVMs , satisfying
with , , and . This definition of imposes the displayed key-entropy and disagreement conditions without requiring a uniform key or an environment secrecy condition. The key-capacity sequence also includes , whose rate quotient is defined as zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.