Lemma 2: weak additivity after output complex conjugation
OpenQAlgorithms.Papers.Independent.Intakenext100.P49.conjugation_weakAdditivityLet be a CPTP channel between positive finite-dimensional Hilbert spaces. Assume its Holevo capacity is weakly additive, meaning for every positive integer ; a strongly additive channel also meets this premise. In a fixed output basis let be the linear map , and assume explicitly that is CPTP. Then
Transpose agrees with entrywise complex conjugation on Hermitian density operators. This gives weak additivity of the conjugated channel when that channel exists in the CP sense required by the source's p.5 remark. It does not assert strong additivity of .
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 pp.4--5, Lemma 2 and its CP remark: weak additivity survives
output conjugation when the transpose extension is itself CPTP.
Weak additivity is the minimal premise and covers a strongly additive N as well. -/
theorem conjugation_weakAdditivity (a b : ℕ) (_ha : 0 < a) (_hb : 0 < b)
(N : Superop (Fin a) (Fin b)) (hN : WeakHolevoAdditive N)
(hM : IsChannel (transposeOutput N)) : WeakHolevoAdditive (transposeOutput N) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P49
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be positive natural numbers, and let be a map. Define as the supremum, over all finite probability ensembles of positive semidefinite trace-one input matrices, of
where , using continuous functional calculus. Suppose is a channel and for every natural number . Also suppose the map , with ordinary matrix transpose in the given coordinates, is a channel. Here a channel is a map represented on every input matrix as by a finite family with , and tensor powers act on matrix units by tensoring their images. Then is a channel and for every natural number ; there is no assertion about a zero-copy additivity identity.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.