Sections 2.6 and 4.4: infinite unconstrained Schumacher capacity
OpenQAlgorithms.Papers.Independent.Gap20.P07.unconstrainedEntropyCapacity_infiniteLet be a memoryless CPTP channel between nonzero complex Hilbert spaces with . If arbitrary finite block source dimensions are permitted, then
More explicitly, there are positive integer dimensions , numbers tending to zero, and source states
with CPTP codes defined on the entire enlarged space, whose entanglement fidelity tends to one while . This construction explains why a dimension or QAEP restriction is necessary for the entropy formulation.
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.6,19, (67)--(68): unconstrained entropy capacity is infinite if Q>0.
The witness is the actual direct-sum mixture and uses TP codes on its whole space. -/
theorem unconstrainedEntropyCapacity_infinite {I J : Type} [Nonempty I] [Nonempty J]
(T : Operation I J) (hT : IsTraceClassChannel T) (hQ : 0 < qubitReferenceCapacity T) :
sourceEntropyCapacity T (fun _ => True) = ⊤ ∧
∃ (d k : ℕ → ℕ+) (epsilon : ℕ → ℝ) (S : QuantumSource),
(∀ n, 0 < epsilon n ∧ epsilon n < 1) ∧ Tendsto epsilon atTop (𝓝 0) ∧
(∀ n, S.dimension n = d n + k n) ∧
(∀ n, HEq (S.rho n) (enlargedMixture (d n) (k n) (epsilon n))) ∧
SourceReliable T S ∧
Tendsto (fun n => ENNReal.ofReal (vnEntropy (S.rho n) / (n + 1 : ℝ))) atTop (𝓝 ⊤) := 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, meaning that it preserves coefficient matrices admitting expansions with and , is additive and complex homogeneous on them, and preserves density coefficient matrices after every finite ancillary identity extension, applied blockwise. A density coefficient matrix has real nonnegative finite-coordinate quadratic forms and a summable real diagonal of sum . Let be the infimum of the expansion sums, let , and let be the supremum of positive real for which all positive-integer sequences with and have , with channel encoders and decoders. Assume , allowing . A source is a sequence of positive dimensions and positive semidefinite trace-one matrices ; its entropy rate is , where , with . A source is reliable if length- channel codes with effective maps satisfy , where . The theorem asserts that the supremum of positive real for which some reliable source has entropy rate at least , with no additional source property, is . It further asserts the existence of positive-integer sequences , real numbers with , and a reliable source of dimension , whose density matrix, after identifying these equal dimensions, is exactly
and for which in the extended nonnegative reals. No rate of decay for , growth bound for , or countability assumption on is stipulated.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.