Proposition 5: channel-independent output mutual-information bound
OpenQAlgorithms.Papers.Independent.Support50.P18.output_mutual_information_continuityLet be any CPTP channel on trace class and any separable reference. Suppose satisfies (22), write for its ground infimum, and fix finite . Put , with mutual information defined by extended relative entropy. This function is finite and uniformly continuous in trace distance on states of with input energy at most . The entropy capacity is finite at every finite budget above , and
whenever both input energies are at most and bounds their half trace distance. For pure joint inputs the modulus parameter may be replaced by under the original distance hypothesis. The bound is independent of the channel and places no energy constraint on its output.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P18
noncomputable section
open Filter
open scoped ENNReal NNReal BigOperators Topology
attribute [local instance] Classical.propDecidable Classical.decEq
namespace QAlgorithms.Papers.Independent.Support50.P18
open QAlgorithms.Papers.Independent.Dependency50.P33 (State PureState traceSize rankOne)
open QAlgorithms.Papers.Independent.Frontier18.P01 (convexOperatorMixture traceSecond)
open QAlgorithms.Papers.Independent.Frontier18.P07
(extendedEntropyNats extendedRelativeEntropyNats)
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Claimed50.P39 (g)
open QAlgorithms.Papers.Independent.Renew46.P08
(coefficientEnergy entropySupremum extendedHalfTraceDistance)
/-- Proposition 5, PDF pp.16--17, (48): arbitrary CPTP channel and reference.
Condition (22) forces discrete spectrum (Appendix p.21), justifying the choice
of an energy eigenbasis on A without a new spectral hypothesis. There is no
output-energy or output-entropy restriction. The pure refinement retains the
original d(rho,sigma)≤eps and substitutes only in the modulus. -/
theorem output_mutual_information_continuity {I J R : Type}
[Countable I] [Nonempty I] [Countable J] [Nonempty J] [Countable R] [Nonempty R]
(energy : I → ℝ≥0) (h22 : Condition22 energy)
(Phi : QAlgorithms.Papers.Independent.Frontier18.P01.Channel I J)
(E : ℝ) (hE : spectralGround energy ≤ E) :
(∀ u : ℝ, spectralGround energy ≤ u → entropySupremum energy u < ⊤) ∧
EnergyContinuity (fun X => coefficientEnergy energy (traceSecond X))
(@outputMutualInformation I J R Phi) E (entropyModulus (entropySupremum energy) 2 2 E) ∧
∀ (rho sigma : PureState (I × R)) (eps : ℝ),
coefficientEnergy energy (traceSecond rho.val.coefficients) ≤ ENNReal.ofReal E →
coefficientEnergy energy (traceSecond sigma.val.coefficients) ≤ ENNReal.ofReal E →
0 < eps → eps ≤ 1 / 2 → nuclearStateDistance rho.val sigma.val ≤ ENNReal.ofReal eps →
|(outputMutualInformation Phi rho.val.coefficients).toReal -
(outputMutualInformation Phi sigma.val.coefficients).toReal| ≤
entropyModulus (entropySupremum energy) 2 2 E (eps ^ 2 / 2) := by sorry
end QAlgorithms.Papers.Independent.Support50.P18
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be countable nonempty index types, let satisfy in as , and let . For any index set , an expansion of a matrix means with and ; call such a matrix trace class, and let be the infimum of these costs, with empty infimum . A state is a trace class matrix whose quadratic forms on every finite coordinate set are real and nonnegative and whose real diagonal is summable with sum . Let be a map from -indexed matrices to -indexed matrices that preserves trace class, is additive and complex homogeneous on trace class matrices, and, for every natural and every state on , sends its blocks to a state: the resulting entries are . This finite ancillary condition includes , where there is no input state. For any bipartite matrix , define its two marginals by summing the diagonal in the other coordinate. Define and by
where ranges over all finite coordinate sets, , and matrix logarithms use continuous functional calculus with . Put , , and ; empty suprema are . For a state on , let , and set . Then for all real , and on the set of states, is finite and its real value is uniformly continuous for : for every , some makes imply for all . For all and with ,
In addition, if are pure states, meaning and for unit vectors , the same energy and distance hypotheses give
Here converts finite extended nonnegative values to real numbers and sends to ; the asserted finiteness applies to all information values in these bounds, and zero distance is allowed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.