Lemma-4
OpenQAlgorithms.Papers.Independent.Gap20.P04.lemma4Let be a CPTP channel on nonzero finite-dimensional registers, with receiver and environment obtained by tracing the same Stinespring isometry. Optimize over all finite classical labels , probability distributions, and normalized pure conditional states on a finite reference and input . For the resulting state, write , , , and , with entropy in bits. Rates are nonnegative, and denotes consumed ebits. The capacity regions are the closures of positive-blocklength scaled unions in Section III; their one-use unions have no added closure.
For , define . If is Hadamard and is any CPTP channel on nonzero finite registers, then
All three maxima are attained, and the product optimization includes entangled inputs. This is strong two-channel additivity.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P04
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap20.P04
open QAlgorithms
open QAlgorithms.Papers.Independent.Claimed50.P24
(Dilation PhysicalDilation ChannelEB Hadamard EqualMax AdditiveMax
dephasingDilation dephasingGamma cloningDilation)
open QAlgorithms.Papers.Independent.Information100.P67
(receiverChannel complementaryChannel dilationPower)
open QAlgorithms.Papers.Independent.Information100.P32 (diagonal)
open QAlgorithms.Papers.Independent.Dependency50.P24 (ensembleHolevoBits)
open QAlgorithms.Papers.Independent.Gap48.P44 (cqTimeSharing ceTimeSharing)
open scoped BigOperators Matrix ComplexConjugate
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I B E J D F : Type}
variable [Fintype I] [Fintype B] [Fintype E]
variable [Fintype J] [Fintype D] [Fintype F]
variable [DecidableEq I] [DecidableEq B] [DecidableEq E]
variable [DecidableEq J] [DecidableEq D] [DecidableEq F]
variable [Nonempty I] [Nonempty B] [Nonempty E]
variable [Nonempty J] [Nonempty D] [Nonempty F]
/-- PDF pp.10--11, Lemma 4: strong additivity, second channel arbitrary, lam>=1. -/
theorem lemma4 (U : Dilation I B E) (V : Dilation J D F)
(hU : PhysicalDilation U) (hV : PhysicalDilation V) (hH : Hadamard U)
(lam : ℝ) (hlam : 1 ≤ lam) :
AdditiveMax (purifiedValues (cqScore U lam)) (purifiedValues (cqScore V lam))
(purifiedValues (cqScore (product U V) lam)) := by sorry
end QAlgorithms.Papers.Independent.Gap20.P04
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty index sets with decidable equality, and let and satisfy and . For any such matrix , write and for the receiver and environment partial traces of . Assume that applying to the input factor of every unit pure state on a reference space of dimension tensored with , using the fixed enumeration of , produces a finite convex combination of products of positive semidefinite trace-one matrices. A valid purified input family for consists of positive integers , probabilities summing to , and unit vectors ; zero probabilities are allowed. Set , , and
where , with . Define by
For every real , there exist real numbers such that and are attained greatest values of and , respectively, and is an attained greatest value of , with each optimization ranging over all valid purified input families for its input space.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.