Section 3.1 / (15): bottleneck inequality
OpenQAlgorithms.Papers.Independent.Gap20.P07.capacity_bottleneckLet and be composable CPTP channels, and let be any CPTP reference channel, all on nonzero complex Hilbert spaces. For the full-cb relative capacities of Definition 2.1,
The reference may be noisy. This is the capacity bottleneck property for sequential channel use.
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, (15): bottleneck inequality, including arbitrary noisy references. -/
theorem capacity_bottleneck {I J K A B : Type}
[Nonempty I] [Nonempty J] [Nonempty K] [Nonempty A] [Nonempty B]
(T1 : Operation J K) (T2 : Operation I J) (S : Operation A B)
(h1 : IsTraceClassChannel T1) (h2 : IsTraceClassChannel T2) (hS : IsTraceClassChannel S) :
relativeCapacity (T1 ∘ T2) S ≤ min (relativeCapacity T1 S) (relativeCapacity 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 be channels in the following sense. A matrix is trace class when for square-summable vectors with ; is the infimum of these sums in , including if there is no expansion. A density is trace class, has positive semidefinite finite principal restrictions, and has summable real diagonal of sum . A channel preserves trace-class matrices, is additive and complex-homogeneous on them, and preserves densities after adjoining any finite ancillary register. For any matrix map , let be the supremum of over integers and trace-class with , where
For maps and , define , where are positive integers and are channels between the corresponding input and output registers. Here is formed by applying to the first-coordinate matrix block and recursively to the remaining coordinates; its zeroth power evaluates at the unique empty tuples. Define as the supremum, in , of all real for which every pair of positive-integer sequences , satisfying and , satisfies . An empty rate supremum is ; no attainment of the error infimum is required. Then
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.