Unnumbered key lower bound for a ccq state, Eq.17
OpenQAlgorithms.Papers.Independent.Intakenext100.P37.ccq_entropy_key_lower_boundLet be a density matrix on three positive finite-dimensional registers, classical in the specified computational bases of and . Eve's extension is this particular , and denotes von Neumann entropy in bits. Then the operational forward extraction capacity of this fixed ccq source satisfies
Here and are the actual partial traces of , and . The accepted capacity evaluates finite local measurements and forward authenticated public discussion on independent copies, includes the transcript with Eve, and lets the correctness and secrecy errors tend to zero. The bound remains valid when its right side is negative. It specializes Eq. (3) to the ccq setting; it is not the bipartite key capacity of the separable classical marginal.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P37
noncomputable section
open scoped Matrix BigOperators ComplexConjugate ComplexOrder ENNReal
namespace QAlgorithms.Papers.Independent.Intakenext100.P37
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P21 (Op)
open QAlgorithms.Papers.Independent.Dependency50.P24
(Key IsPrivate xForm twist twistingMatrix associatedCCQ transposeSecond transposeBob partyCut)
/-- PDF p.3, Eq.(17): one-way extraction from a FIXED ccq source and its actual
Eve marginal. It is not bipartite key distillation of the separable AB marginal.
Negative right sides remain legitimate lower bounds. -/
theorem ccq_entropy_key_lower_bound {a b e : ℕ} (ha : 0 < a) (hb : 0 < b)
(he : 0 < e) (rho : Op (Fin a × (Fin b × Fin e)))
(hrho : IsDensityMatrix rho) (hccq : IsCCQ rho) :
Frontier30.P12.quantumMutualInfo (Dependency50.P21.marginalAB rho) -
vnEntropy (traceLeft (traceLeft rho)) ≤ Frontier30.P12.quantumKeyCapacity rho := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P37
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every three positive integers , let be a complex matrix on that is positive semidefinite with trace one and satisfies
Let be obtained by tracing out the -dimensional register, and let be obtained by tracing out the first two registers. Then
where , with matrix functional calculus and the total logarithm convention at zero. The quantity is the real supremum of rates admitting the following protocol sequence. At each natural copy number , including zero, choose positive integers , a POVM on , and for every a POVM on ; POVM means positive semidefinite effects summing to the identity. With grouped into registers , put
and define on the transcript register and by diagonal transcript blocks and zero off-diagonal blocks. There must exist a real and nonnegative real errors such that, for every ,
and there exist density matrices and a single density matrix , on transcript together with , satisfying and for every ; also . Here , an empty tensor product has every matrix entry equal to one, and division by zero at copy number zero is interpreted as zero. The definition of the supremum does not separately require .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.