Supplement V.B, Eqs.(187)–(190): operational key-capacity bound
OpenQAlgorithms.Papers.Independent.Intakethird100.P49.private_capacity_choi_boundLet be CPTP, . Let be the operational supremum of two-way LOCC private-generation rates from separable initialization, arbitrary finite shields and vanishing full trace-norm error. Let denote finite state REE in bits. Define as the supremum, over all positive finite memories and normalized , of the finite real difference . Put , with . For every fixed integer , PBT gives
and both and are at most . Furthermore
Consequently . Integer is fixed before the coding limit. The accepted half-norm operational convention has the same vanishing-error capacity by tolerance rescaling. The initial cut in printed Eq. (184) is corrected from to , pending independent moderation.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P49
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P49
open QAlgorithms Filter
open scoped Matrix ComplexConjugate ComplexOrder BigOperators
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P63 (Mat tensorPower)
open QAlgorithms.Papers.Independent.Dependency50.P18 (bipartiteTensor)
open QAlgorithms.Papers.Independent.Information100.P71 (diamond AdaptiveTest adaptiveInput adaptiveAccept)
open QAlgorithms.Papers.Independent.Bridge50.P25
(LOCCOn normalizedChannelChoi TwoWayGenerationCode TwoWayChannelProtocol
generationCodeError twoWayGenerationCapacity sendChannelRegister StateFunctional
IsDimensionChangingLOCCMonotone privateStateInPartyOrder)
open QAlgorithms.Papers.Independent.Support50.P07 (amplitudeDampingChannel)
/-- Supplement V.B, PDF pp.19--20, (184),(187)--(190): integer-port
operational key-capacity bound and its amortized-REE ingredients. K is the
accepted actual two-way code-rate supremum; its half-norm error convention has
the same vanishing-error limit as the source's full-norm convention. The input
cut in (184) is corrected to (a',a):b'. Fixed M precedes all coding limits.
Independent moderation of the cut correction is required. -/
theorem private_capacity_choi_bound (d : ℕ) [NeZero d] (hd : 2 ≤ d)
(E : Superop (Fin d) (Fin d)) (hE : IsChannel E) :
(∀ M : ℕ, 2 ≤ M →
amortizedREE (simulated E M) ≤ (realREE (choiPorts E M) : EReal) ∧
realREE (choiPorts E M) ≤ M * realREE (normalizedChannelChoi E) ∧
amortizedREE E ≤ ((realREE (choiPorts E M) + pbtError d M * Real.logb 2 d +
capacityContinuity (pbtError d M/2) : ℝ) : EReal) ∧
twoWayGenerationCapacity E true ≤ ((realREE (choiPorts E M) +
pbtError d M * Real.logb 2 d + capacityContinuity (pbtError d M/2) : ℝ) : EReal) ∧
((realREE (choiPorts E M) + pbtError d M * Real.logb 2 d +
capacityContinuity (pbtError d M/2) : ℝ) : EReal) ≤ (privateCapacityBound d M E : EReal)) ∧
twoWayGenerationCapacity E true ≤
⨅ M : {m : ℕ // 2 ≤ m}, (privateCapacityBound d M.val E : EReal) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P49
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number with , and every matrix map on admitting a finite Kraus representation with , use the following definitions. A density matrix is positive semidefinite with trace ; a separable density matrix is a finite convex combination of products of density matrices. For matrices on a finite bipartite space, let
where unless both arguments are density matrices and , and otherwise
These matrix functions use functional calculus and the scalar convention ; the infimum is in , and the subscript “real” sends finite values to their real values and sends to . For any map on -dimensional matrices, define
with real differences embedded in the extended real line, where
Thus the output of the distinguished input register belongs to the second party. Write , where , and let be the grouped -fold product, explicitly
Here identity amplification applies a map to each reference-indexed matrix block. For each , define a port-based map as follows. Put , define
using functional calculus and scalar inverse , and set
Let
where the supremum ranges over all complex matrices on . Define to be the extended-real supremum of all real for which there is a sequence of codes with positive use counts , natural key-bit counts satisfying , and errors tending to zero. Each code starts from a separable density matrix on , uses exactly times by sending the distinguished input register from Alice to Bob, and allows finite local protocols between uses and at termination. Those protocols are generated by identities and complete local Kraus instruments with recursively chosen branch protocols, allowing changes of dimension. Its error is half the trace norm between its output and a density-matrix private target on , whose entries are zero unless the two parties’ key indices agree on both row and column, and otherwise equal for a shield density matrix and shield unitaries . Finally put
with scalar logarithms totalized by . Then, for every natural , all five assertions hold:
The second inequality is a real inequality; the others use the extended real line, embedding every displayed real bound there. In addition,
where this last infimum is also in the extended real line.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.