Sections 2.2 and 7.3: sporadic capacity equals Q
OpenQAlgorithms.Papers.Independent.Gap20.P07.sporadicCapacity_eqLet be a memoryless CPTP channel between nonzero complex Hilbert spaces. A positive rate is sporadic if there are positive block sequences whose ratio has limsup and whose optimal full-cb coding errors tend to zero. Let be the extended nonnegative supremum of such rates. Then
This is equality of suprema. The extension argument achieves every strict subrate, and does not assert that the sporadic endpoint satisfies every sequence allowed by Definition 2.1.
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.4,25--29: equality of suprema; no false endpoint assertion. -/
theorem sporadicCapacity_eq {I J : Type} [Nonempty I] [Nonempty J]
(T : Operation I J) (hT : IsTraceClassChannel T) :
sporadicCapacity T = 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
For arbitrary nonempty types , let map complex coefficient matrices on to those on . A matrix is trace class when for sequences in satisfying ; let be the infimum of those sums in . A density coefficient matrix is trace class, has real nonnegative quadratic forms on every finite coordinate set, and has summable real diagonal entries with sum . Assume preserves trace class, is additive and complex homogeneous on such inputs, and preserves density coefficient matrices after extension by the identity on every finite ancillary register; such extensions apply separately to ancillary coefficient blocks. Maps with these properties are the allowed channels. Put , and for positive let be the infimum of over allowed channel encoders and decoders, where tensor powers apply maps independently to coordinates. The theorem equates two suprema in : the supremum of positive real for which there exist positive-integer sequences with , , and ; and the supremum of positive real for which every such pair of sequences with and has . Empty suprema are , and either capacity may be infinite.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.