Distillable key is bounded by operational entanglement cost
OpenQAlgorithms.Papers.Independent.Gap48.P42.key_bounded_by_costLet be positive finite dimensions and let be any positive semidefinite trace-one operator on . Define as the supremum of nonnegative achievable private-key rates under trace-preserving adaptive LOCC. An achievable rate uses positive input block lengths , complete outputs approximating exact private states in full trace norm with error tending to zero, and asymptotic lower rate . Every positive finite shield dimension and every joint-shield twist is permitted at each ; shields have no growth restriction. Rates and entropies use bits.
Let be operational singlet cost with adaptive LOCC and vanishing preparation error. Then
This includes states with zero distillable key and requires no attained key rate or optimal protocol sequence. It relates two operational resources on an arbitrary bipartite state, which need not itself be private.
Formalization Note The key supremum takes values in the extended nonnegative reals; the finite real cost is embedded in that space.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P42
namespace QAlgorithms.Papers.Independent.Gap48.P42
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal
noncomputable section
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF p.4, Property 2: every finite bipartite density has K_D<=E_C.
No positive-key, attained-rate, shield-growth or continuity hypothesis is added.
The proof's key-dimension-only continuity display is not asserted separately. -/
theorem key_bounded_by_cost {a b : ℕ} (ha : 0 < a) (hb : 0 < b)
(rho : Matrix (Fin a × Fin b) (Fin a × Fin b) ℂ) (hrho : IsDensityMatrix rho) :
distillableKey rho ≤ ENNReal.ofReal
(Dependency50.P42.entanglementCost Dependency50.P42.paperBures rho) := by sorry
end
end QAlgorithms.Papers.Independent.Gap48.P42
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every pair of positive natural numbers and every positive semidefinite trace-one matrix on , one has , where in . Define as the supremum of over nonnegative real with this property: for every , all sufficiently large positive integers admit positive natural numbers , a positive semidefinite trace-one shield matrix on , unitaries on that shield indexed by , and an allowed finite local-operations map such that and . Here , on local dimensions , has block between constant row key and constant column key , and zero entries for mismatched keys, using the fixed bijections between a local key–shield pair and its dimensioned index; . Define as the real infimum of all such that, for every , there are natural numbers with and an allowed map satisfying and , where is the projector onto and . All powers are grouped by party through the fixed cardinality bijections, and matrix square roots use continuous functional calculus. In both definitions, allowed maps are precisely those generated finitely from identities by , with finite Kraus families satisfying , and by the analogous operation on the other party, with allowed branch-dependent . The key definition requires every sufficiently large positive block length, whereas the cost definition only asks for some positive block length for each pair of tolerances. Key dimension , zero input singlets , and local dimensions or are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.