Sections 2.8 and 5: isometric encoding suffices
OpenQAlgorithms.Papers.Independent.Gap20.P07.isometricCapacity_eqLet be a memoryless CPTP channel between nonzero complex Hilbert spaces. Define using the channel-fidelity capacity with encoders restricted to for isometries from the logical space into the physical input block. Decoders remain arbitrary CPTP maps. Then
This restricts the encoding apparatus alone and makes no claim about homomorphic decoding.
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.7,20--22: isometric encoding suffices, with arbitrary CPTP decoding. -/
theorem isometricCapacity_eq {I J : Type} [Nonempty I] [Nonempty J]
(T : Operation I J) (hT : IsTraceClassChannel T) :
isometricCapacity T = qubitReferenceCapacity 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 nonempty types and let satisfy the channel requirements described here. Write . A trace-class matrix admits with ; let be the infimum of these sums in , or if no expansion exists. A density is such a matrix with positive semidefinite finite principal restrictions and a summable real diagonal summing to . A channel preserves trace-class matrices, is additive and complex-homogeneous on them, and preserves densities under every finite ancillary extension. That extension applies the map separately to each block determined by the ancillary row and column indices. Put , where the supremum is over trace-class . Coordinate powers apply to each coordinate, recursively applying it first to the first-coordinate block; their zeroth power evaluates at the unique empty row and column tuples. Let be the supremum of real such that every positive-integer sequence pair with and has
where range over channels encoding into and decoding from . Define as the supremum of real for which there are positive integers and channels , , for every , with the following properties: there is a complex linear isometry such that, on every trace-class ,
the extended-nonnegative limsup of equals ; and, for , the real quantity
Here the ancillary extension in this expression again acts on matrix blocks. Both capacity suprema are taken in , with empty supremum , and is allowed. The assertion is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.