Proposition 7.2 / (107): one successful code yields a capacity lower bound
OpenQAlgorithms.Papers.Independent.Gap20.P07.oneCode_capacityLowerBoundLet be a memoryless CPTP channel between arbitrary nonzero complex Hilbert spaces. Suppose a CPTP code sends a -level system, where is prime, through channel uses, with actual full-cb error and . Writing for binary entropy in bits, put
Then , and every positive admits all-block codes with some positive exponential error exponent. Furthermore
The supremum is extended nonnegative and is zero if the set is empty. Logical and physical dimensions may differ, and is valid. This retains the lower bound, least-upper-bound clause, and exponential reliability conclusion.
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.28--29, Proposition 7.2, (107): actual prime-dimensional code,
positive N, the entire lower bound, least-upper-bound clause, and exponential
reliability at every positive strict subrate. Empty prime-code supremum is zero. -/
theorem oneCode_capacityLowerBound {I J : Type} [Nonempty I] [Nonempty J]
(T : Operation I J) (hT : IsTraceClassChannel T) :
(∀ (N : ℕ+) (d : ℕ), Nat.Prime d → ∀ C : TraceClassBlockCode T N d,
C.error < ENNReal.ofReal (1 / (2 * Real.exp 1)) →
ENNReal.ofReal (hashingBound N d C.error.toReal) ≤ qubitReferenceCapacity T ∧
∀ R : ℝ, 0 < R → R < hashingBound N d C.error.toReal → ExponentialReliable T R) ∧
qubitReferenceCapacity T = hashingSupremum 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 sets, and let map complex matrices indexed by to complex matrices indexed by . Use the following meanings throughout: a matrix is trace class if it admits an expansion with and ; write for the infimum, over all such expansions, of , valued in and equal to when no expansion exists. A density matrix is a trace-class matrix whose every finite quadratic form is real and nonnegative, whose real diagonal is summable, and whose real diagonal sum is . A trace-class channel preserves trace class, is additive and complex homogeneous on trace-class inputs, and, for every natural number , its application to the first coordinate of every density matrix on the input labels paired with produces a density matrix; its action on arbitrary matrices outside trace class is otherwise unrestricted. Assume is such a channel. For any matrix map , define
where applying to the first coordinate means applying it separately to each matrix block determined by the two auxiliary indices. Let be its recursively defined action on coordinates: at it returns the sole input entry on the singleton empty-coordinate register; at , it applies to the first-coordinate block and then to the remaining coordinates. An block code consists of trace-class channels from labels to and from to labels, with effective map and error . For every positive integer , every prime natural number (thus ), and every such code satisfying , set and
where and , with zero endpoint terms interpreted as . Then , and every real with has the following property: there exist real constants and, for every natural number , a block code using applications of and dimension , whose error is eventually at most . Here is defined as follows: for positive integers , let be the infimum of over trace-class encoding and decoding channels between labels and the corresponding -coordinate input and output registers, with an empty infimum equal to ; then is the supremum in of the positive real numbers such that, for every pair of positive-integer sequences with and , one has . In addition,
where the supremum is taken in and is if its indexing set is empty; the strict error threshold ensures every error used here is finite.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.