Section 3.1 / (17): two-step coding inequality
OpenQAlgorithms.Papers.Independent.Gap20.P07.capacity_twoStepLet be arbitrary CPTP channels on nonzero complex Hilbert spaces, with relative capacities defined by memoryless powers, CPTP coding, and full-cb error. Then
Multiplication is in the extended nonnegative reals, with . Introducing an intermediate channel cannot improve the direct simulation rate.
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, (17): two-step coding, with extended nonnegative multiplication. -/
theorem capacity_twoStep {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) (T3 : Operation A B)
(h1 : IsTraceClassChannel T1) (h2 : IsTraceClassChannel T2) (h3 : IsTraceClassChannel T3) :
relativeCapacity T1 T2 * relativeCapacity T2 T3 ≤ relativeCapacity T1 T3 := 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 as follows. A trace-class matrix admits with square-summable vectors and finite ; is the infimum of these sums, with value 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 under all finite ancillary extensions. Such an extension applies the map to each block with fixed ancillary row and column indices. Define . For maps , define , with channel encoders and decoders between the relevant registers. Powers apply the map first to the first-coordinate block and recursively to the remaining coordinates, with the zeroth power evaluating at the unique empty tuples. Let be the supremum in of real such that, for every positive-integer sequence pair with and , the errors tend to ; an empty rate supremum is . Then
The multiplication is that of extended nonnegative reals, including its convention .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.