Section 3.1 / (16): tensor superadditivity
OpenQAlgorithms.Papers.Independent.Gap20.P07.capacity_superadditiveLet be CPTP channels on nonzero complex Hilbert spaces and let be any CPTP reference channel. Then their extended nonnegative relative capacities satisfy
This gives superadditivity for parallel use; it does not assert additivity for arbitrary noisy factors.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P07
noncomputable section
open Filter MeasureTheory
open scoped Topology ENNReal NNReal Matrix ComplexOrder ComplexConjugate
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus
namespace QAlgorithms.Papers.Independent.Gap20.P07
open QAlgorithms
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P33
(State IsTraceClass IsTraceClassChannel traceSize rankOne tensorApply)
open QAlgorithms.Papers.Independent.Frontier30.P14
(Operation isometryCoeff conjugateKernel)
open QAlgorithms.Papers.Independent.Claimed50.P35
(stabilizedTraceClassNorm traceClassTensorMap traceClassChannelPower
transpose transposeBound TraceLinear tracePair MeasurePrepare)
open QAlgorithms.Papers.Independent.Gap48.P29 (fe FiniteCPMap)
/-- PDF p.8, (16): tensor superadditivity, with no general additivity assumption. -/
theorem capacity_superadditive {I J K L A B : Type}
[Nonempty I] [Nonempty J] [Nonempty K] [Nonempty L] [Nonempty A] [Nonempty B]
(T1 : Operation I J) (T2 : Operation K L) (S : Operation A B)
(h1 : IsTraceClassChannel T1) (h2 : IsTraceClassChannel T2) (hS : IsTraceClassChannel S) :
relativeCapacity T1 S + relativeCapacity T2 S ≤
relativeCapacity (traceClassTensorMap T1 T2) S := by sorry
end QAlgorithms.Papers.Independent.Gap20.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be nonempty types, and let , , and satisfy these channel requirements: they preserve trace-class matrices, are additive and complex-homogeneous on them, and preserve densities after adjoining every finite ancillary register. Explicitly, trace class means having an expansion with and ; is the infimum of these sums, with empty infimum . A density is trace class with positive semidefinite finite principal restrictions and summable real diagonal of sum . Ancillary extension applies the map to each matrix block with fixed ancillary row and column indices. For any , put . For maps , set , with channel encoders and decoders between the relevant registers. Coordinate powers apply the map to the first-coordinate block and recursively to the remaining coordinates; the zeroth power evaluates at the unique empty tuples. Let be the supremum in of real such that every positive-integer sequence pair , with and , has ; the supremum is when there are no such rates. Define the joint map explicitly by
Then, with addition in the extended nonnegative reals,
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.