Section 3.2 / (18): ideal channel capacity
ProvedQAlgorithms.Papers.Independent.Gap20.P07.idealCapacityLet and be integers. The capacity of an ideal -level channel relative to an ideal -level channel is
The one-dimensional physical channel gives zero; the one-dimensional reference is excluded from the quotient. This calibrates ideal quantum transmission in bits.
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.9--10, (18): n=1 gives zero; the reference dimension exceeds one. -/
theorem idealCapacity (n m : ℕ) (hn : 0 < n) (hm : 2 ≤ m) :
relativeCapacity (id : Operation (Fin n) (Fin n)) (id : Operation (Fin m) (Fin m)) =
ENNReal.ofReal (Real.logb 2 n / Real.logb 2 m) := 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 every pair of natural numbers with and , let be the identity maps on complex matrices of the indicated dimensions. The relative capacity used here has the following precise meaning. A trace-class matrix has an expansion with square-summable vectors and ; is the infimum of these sums in , with empty infimum . A density is trace class with positive semidefinite finite principal restrictions and summable real diagonal of sum . A channel preserves trace-class matrices, is additive and complex-homogeneous on them, and preserves densities after adjoining every finite ancillary register. For any map , its stabilized size is , where the ancillary extension applies to each block with fixed ancillary row and column indices. For positive integers , put , with channel encoders and decoders between the corresponding registers. Powers recursively apply the map to the first-coordinate block and then to the remaining coordinates, with the zeroth power evaluating at the unique empty tuples. Finally, is the supremum in of real for which every positive-integer sequence pair , satisfying and , has ; an empty rate supremum is . The assertion is
The ratio is nonnegative under these hypotheses, and is included, giving capacity .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.