Theorem 6.1 / (83): classical forward assistance is useless
OpenQAlgorithms.Papers.Independent.Gap20.P07.forwardAssistance_uselessLet be a memoryless CPTP channel between nonzero complex Hilbert spaces, and let be an integer classical alphabet size. Let allow an arbitrary finite number of forward messages at each block length, even superexponentially many. Encoding is a CP trace-nonincreasing instrument summing to a channel, each selected decoder is CPTP, and reliability uses the sum of unnormalized branch channel fidelities. Then
The fixed message budget gives the same capacity. No postselection, initial shared entanglement, or feedback is supplied. This is the uselessness of classical forward assistance.
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 pp.22--24, Theorem 6.1, (83): arbitrary finite message budgets per
block, even superexponential, and every fixed positive classical alphabet. -/
theorem forwardAssistance_useless {I J : Type} [Nonempty I] [Nonempty J]
(T : Operation I J) (hT : IsTraceClassChannel T) (messages : ℕ+) :
instrumentForwardCapacity T (fun _ _ => True) =
qubitReferenceCapacity (traceClassTensorMap T (classicalIdentity messages)) ∧
qubitReferenceCapacity (traceClassTensorMap T (classicalIdentity messages)) = qubitReferenceCapacity T ∧
instrumentForwardCapacity T (fun n k => (k : ℕ) = (messages : ℕ)^(n + 1)) = qubitReferenceCapacity T := 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 arbitrary nonempty types, let be any positive integer, and let be a trace class channel from matrices on to matrices on . Here trace class means admitting a coefficientwise expansion with and summable ; write for the infimum of these expansion costs in , with empty infimum . A density matrix is trace class, has real nonnegative finite principal quadratic forms, and has summable real diagonal with sum ; a trace class channel preserves trace class matrices, is additive and complex homogeneous on them, and preserves densities after every finite ancillary block amplification. Define , where applies separately to every block indexed by two ancillary labels in . Tensor powers apply a map recursively to each coordinate, with the zeroth power acting on the singleton empty-coordinate matrix. For any such map , define to be the supremum of strictly positive such that, for every pair of positive-integer sequences with and extended-real ,
where are trace class encoding and decoding channels of the indicated dimensions. Define to be the supremum of strictly positive for which there exist positive integers , with for every , encoding branches , and decoding trace class channels , for , such that each branch preserves trace class and is additive and complex homogeneous there, each finite amplification of a branch sends every density to for some and some density , the sum is a trace class channel, and
where and . All these rate suprema are taken in , with empty supremum . Let , and define the tensor map by
Then the three asserted equalities are
Thus the first supremum permits any positive number of branches at every block length, whereas the last requires exactly branches; is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.