cloning-time-sharing-gain
OpenQAlgorithms.Papers.Independent.Gap20.P04.cloningTimeSharingGainFor every universal symmetric-output cloning channel with parameter (integer in the cloning case), let and be the coordinate families in the corresponding explicit capacity formula, with . Define by time sharing between and and lowering both rates; define by time sharing between and , lowering and permitting extra consumption . Then
Both resource regions strictly improve on their own endpoint time-sharing strategy. Properness requires an interior improvement; no strict improvement is asserted at the endpoints. The noiseless case is excluded.
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.14--15: BOTH cloning resource regions strictly beat their endpoint time sharing. -/
theorem cloningTimeSharingGain (N : ℕ) (hN : 1 < N) :
cqTimeSharing (cloningCQ N 0).1 (cloningCQ N (1/2)).2 ⊂
capacityCQ (cloningDilation N) ∧
ceTimeSharing (cloningCE N 0).1 (cloningCE N (1/2)).1
(cloningCE N (1/2)).2 ⊂
capacityCE (cloningDilation N) := by sorry
end QAlgorithms.Papers.Independent.Gap20.P04
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every integer , put and define by
Write , using continuous functional calculus, and define
with the zero summand interpreted as . For a dilation , take all families with positive finite label and reference dimensions, probabilities summing to , and unit purifications with reduced input matrices . With receiver and environment maps , set , , , and . Let consist of nonnegative pairs with for some such family, and let consist of nonnegative pairs with . Define and , where has entries given by products of entries of . Then
Each inclusion asserts containment and inequality of the two sets; are excluded, and and zero probabilities in the input families are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.