Theorem 1: strong Holevo additivity of every 1-to-(ell-1) qubit cloning channel
OpenQAlgorithms.Papers.Independent.Intakenext100.P49.cloning_strongAdditivityLet be an integer and let be the universal symmetric qubit cloning channel whose receiver holds all clones in their -dimensional symmetric subspace. The channel is the receiver reduction of the occupation-basis isometry in Eqs. (9)–(11). For every CPTP auxiliary channel between arbitrary positive finite dimensions,
Here is the supremum of the Holevo information over all finite ensembles of positive trace-one input operators, with entropy in bits. Joint inputs to the tensor product may be mixed and entangled. This is strong additivity and gives the classical single-letter property of the complete cloning output.
Formalization Note The natural parameter is . CPTP is included in the additivity predicate. The PDF's Eq. (9) agrees with the accepted dilation; the plan's claim of overlapping images at is contradicted by the original page.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P49
noncomputable section namespace QAlgorithms.Papers.Independent.Intakenext100.P49 open scoped BigOperators Matrix ComplexConjugate ComplexOrder open Filter open QAlgorithms.Papers.Independent.Support50.P01 (unruhSectorDilation unruhWeight unruhBlockDilation unruhBlockWeight unruhReceiver unruhReceiverEntropy) open QAlgorithms.Papers.Independent.Information100.P67 (receiverChannel complementaryChannel IsDegradable) open QAlgorithms.Papers.Independent.Dependency50.P41 (EntanglementBreaking) open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi) open QAlgorithms.Papers.Independent.Dependency50.P45 (holevoCapacity) open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel) open QAlgorithms.QuditFidelity (depolarizingMap) attribute [local instance] Classical.propDecidable Classical.decEq /-- PDF p.3, Theorem 1 (proof p.4): strong Holevo additivity for every ell>=2. The occupation-basis dilation agrees with Eqs.(9)--(11); Eq.(15) is not used. -/ theorem cloning_strongAdditivity (k : ℕ) : StrongHolevoAdditive (cloner k) := by sorry end QAlgorithms.Papers.Independent.Intakenext100.P49 end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , including , define , where is a complex matrix, the receiver index is , the environment index is , and
The theorem asserts that admits a finite Kraus representation valid for every , with , and that for every pair of positive natural numbers and every function from complex matrices to complex matrices admitting such a finite Kraus representation with normalization ,
Here, for a map on matrices over a finite input register,
with continuous functional calculus used in . The tensor map is defined on every matrix by
where are matrix units. Ensemble size zero cannot satisfy the weight normalization. All suprema are real suprema, with total-operation value for empty or unbounded-above sets.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.