Sections 2.6 and 4.4: entropy capacity for QAEP sources
OpenQAlgorithms.Papers.Independent.Gap20.P07.qaepEntropyCapacity_eqLet be a memoryless CPTP channel on nonzero physical Hilbert spaces. A source consists of finite nonzero block spaces and density states ; its entropy rate is , with entropy in bits. It satisfies QAEP at finite rate if this entropy rate is and, for every , the total spectral mass in
tends to one. Let be the extended supremum of entropy rates of QAEP sources transmitted by CPTP codes with squared entanglement fidelity tending to one. Then
Typical restrictions are normalized only at positive retained mass. QAEP does not impose a bound on every eigenvalue of the original source state. This version covers the source class specified by the paper without restricting it to product sources.
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.5--6,18--19: QAEP source capacity equals Q. The definition uses
concentrated typical mass; it does not impose the erroneous global eigenvalue bound. -/
theorem qaepEntropyCapacity_eq {I J : Type} [Nonempty I] [Nonempty J]
(T : Operation I J) (hT : IsTraceClassChannel T) :
sourceEntropyCapacity T QuantumSource.QAEP = 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 arbitrary nonempty types and a trace-class channel: a coefficient matrix is trace class if it admits with and ; preserves this class, is additive and complex homogeneous there, and preserves density coefficient matrices under every finite ancillary identity extension, applied blockwise. Density coefficient matrices have real nonnegative quadratic forms on every finite coordinate set and a summable real diagonal of sum . Let be the infimum of the expansion sums and . Define as the supremum of positive real such that every positive-integer sequence with and has vanishing infimal simulation error , with channel encoders and decoders. A source consists of positive dimensions and positive semidefinite trace-one matrices ; put in , where uses spectral functional calculus and . Its QAEP property means that some finite satisfies and, for every , , where is the spectral indicator of . The source is reliable if there are channel encoders and decoders of length and dimension , with effective maps , for which , where
The theorem says that the supremum of positive for which a reliable QAEP source has equals . Tensor powers apply maps independently to coordinates; capacity suprema are extended nonnegative suprema with empty value , and source dimensions may equal .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.