Sections 2.6 and 4.4: entropy capacity for exponentially bounded source dimensions
OpenQAlgorithms.Papers.Independent.Gap20.P07.exponentialDimensionEntropyCapacity_eqLet be a memoryless CPTP channel between nonzero complex Hilbert spaces. Consider finite nonzero block sources transmitted by CPTP encoders and decoders with squared entanglement fidelity tending to one. Require each source to have some constant such that for every positive . Compute its bit-entropy rate using a limsup, and take the extended nonnegative supremum over sources and positive rates. Then
The growth constant varies with the source, and entropy rates need not converge. This gives the second source restriction under which entropy capacity agrees with quantum capacity.
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.6,19: each exponentially bounded source has its own tau; the entropy
rate is a limsup and need not converge. -/
theorem exponentialDimensionEntropyCapacity_eq {I J : Type} [Nonempty I] [Nonempty J]
(T : Operation I J) (hT : IsTraceClassChannel T) :
sourceEntropyCapacity T QuantumSource.ExponentialDimension = 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 and a map on complex coefficient matrices that preserves trace class, is additive and complex homogeneous on trace-class inputs, and preserves density coefficient matrices after every finite ancillary identity extension, acting on ancillary blocks. Here trace class means admitting , with and ; density coefficient matrices additionally have real nonnegative quadratic forms on every finite coordinate set and a summable real diagonal of sum . Such maps are the channels used below. Let be the infimum of expansion sums and let . Define as the supremum of positive real such that all positive-integer sequences with and have , where are channels. A source consists of positive dimensions and positive semidefinite trace-one matrices , with entropy rate in , where , with . It has exponential dimension if there is a real such that for every . It is reliable if channel encoders and decoders at lengths , with effective maps , satisfy , where . The assertion is that the supremum of positive real for which there exists such a reliable source of exponential dimension with equals . Tensor powers apply maps independently to coordinate blocks, empty capacity suprema are , and dimensions equal to are allowed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.