Section 3.1: additivity with a noiseless factor
OpenQAlgorithms.Papers.Independent.Gap20.P07.capacity_noiselessFactorLet be a CPTP channel between arbitrary nonzero complex physical Hilbert spaces. Let and be integers giving a finite noiseless factor and a finite noiseless reference. Then
The equality uses extended nonnegative capacities, allowing the physical channel to have infinite-dimensional systems or infinite capacity. It includes additivity for a pair of ideal channels.
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.8: exact additivity for a standard finite ideal reference and one
finite noiseless factor; the other channel's physical dimensions are unrestricted. -/
theorem capacity_noiselessFactor {I J : Type} [Nonempty I] [Nonempty J]
(T : Operation I J) (hT : IsTraceClassChannel T)
(d s : ℕ) (hd : 0 < d) (hs : 2 ≤ s) :
relativeCapacity (traceClassTensorMap T (id : Operation (Fin d) (Fin d)))
(id : Operation (Fin s) (Fin s)) =
relativeCapacity T (id : Operation (Fin s) (Fin s)) +
ENNReal.ofReal (Real.logb 2 d / Real.logb 2 s) := 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 nonempty types and be a channel, and let integers satisfy and . Here trace class means admitting , with square-summable vectors and ; is the infimum of these sums in , or if none exists. 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. Write . For maps , let be the infimum of over channel encoders and decoders between the corresponding registers. Powers apply the map to each coordinate, recursively beginning with the first-coordinate block; their zeroth power evaluates at the unique empty tuples. Define as the supremum of real such that every positive-integer sequence pair , with and , has . The supremum lies in and is for an empty collection of rates. Let denote the identity on complex matrices. The map sends , indexed by , to the matrix with entry at . Then
The maximum expresses conversion into the extended nonnegative reals; under the stated bounds the ratio is nonnegative and its denominator is positive. The case is included and contributes .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.