Sections 2.7 and 7.3: positive exponential reliability below capacity
OpenQAlgorithms.Papers.Independent.Gap20.P07.exponentialReliability_belowCapacityLet be a memoryless CPTP channel between nonzero complex Hilbert spaces, and let . There are constants and CPTP codes for every positive block length , transmitting exactly logical qubits, such that
The exponent may depend on and . For every channel, including those of zero capacity, the extended supremum of positive rates with such reliability equals . No prescribed exponent or reliability at the capacity endpoint is asserted.
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,29: the positive exponent may depend on both channel and rate. -/
theorem exponentialReliability_belowCapacity {I J : Type} [Nonempty I] [Nonempty J]
(T : Operation I J) (hT : IsTraceClassChannel T) :
exponentialCapacity T = qubitReferenceCapacity T ∧
∀ R : ℝ, 0 < R → ENNReal.ofReal R < qubitReferenceCapacity T → ExponentialReliable T R := 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 preserve trace-class coefficient matrices, be additive and complex homogeneous on them, and preserve density coefficient matrices after every finite ancillary identity extension, applied blockwise. 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 . Call maps with these properties channels. Write for the infimum of the expansion sums and . Let be the supremum of positive real such that every positive-integer sequence with and has vanishing error , using channel encoders and decoders. A real rate is exponentially reliable when there exist real constants and, for every integer , a channel encoder from dimension into and a channel decoder from back to that dimension, such that eventually in ,
The exponential capacity is the supremum in of positive exponentially reliable rates, with empty supremum . The theorem asserts that this capacity equals , and that every real satisfying is exponentially reliable. The inequality is strict; the assertion includes infinite and permits code dimension at initial block lengths.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.