Section 3.2: ideal quantum channel classical capacity
ProvedQAlgorithms.Papers.Independent.Gap20.P07.idealClassicalCapacityFor every integer , the unassisted classical capacity of an ideal -level quantum channel is
Here classical transmission uses the noiseless binary classical reference, equivalently complete dephasing followed by an ideal classical identity, with full-cb simulation error. CPTP coding has no shared entanglement or feedback. The equality includes achievability and the converse.
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 p.10: the ideal channel carries log2(d) classical bits per use,
with no shared entanglement or feedback; equality includes the converse. -/
theorem idealClassicalCapacity (d : ℕ) (hd : 0 < d) :
relativeCapacity (id : Operation (Fin d) (Fin d)) (classicalIdentity 2) =
ENNReal.ofReal (Real.logb 2 d) := 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 natural number , let be the identity on complex matrices, and let be the map on complex matrices given by . Define trace class by the existence of an expansion with square-summable vectors and finite ; write for 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 under every finite ancillary extension, which acts separately on blocks with fixed ancillary row and column indices. Put . For maps , let be the infimum of over channel encoders and decoders between the relevant registers. Coordinate powers recursively apply the map to the first-coordinate block and then to the remaining coordinates; their zeroth power evaluates at the unique empty tuples. The relative capacity is the supremum in of real such that every positive-integer sequence pair , with and , has , with empty supremum . Then
The case is included and gives .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.