Eq.(68): constant-channel divergence form of the AEP
OpenQAlgorithms.Papers.Independent.Intakethird100.P65.constantDivergence_aepAll systems have finite positive dimension and fixed computational bases. Matrix order is Loewner order and logarithms are base two.
Let be CPTP and let be all replacement channels from to , allowing arbitrary correlated output densities. Define as the supremum of output-state relative entropy over purified input densities, with support failure giving . Then
The optimized radii are finite, and the successive limits exist. This is the constant-channel divergence form of the AEP; it asserts nothing for a singleton alternative.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P65
noncomputable section
open Filter QAlgorithms
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Topology
namespace QAlgorithms.Papers.Independent.Intakethird100.P65
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Dependency50.P09 (transposeBob)
open QAlgorithms.Papers.Independent.Dependency50.P35 (maxRelative)
open QAlgorithms.Papers.Independent.Independent2.P01 (dampingKraus damping)
open QAlgorithms.Papers.Independent.Gap48.P33 (phaseFlipChannel)
open QAlgorithms.Papers.Independent.Information100.P06 (Below)
open QAlgorithms.Papers.Independent.Information100.P34 (choi)
open QAlgorithms.Papers.Independent.Information100.P62 (Stochastic)
open QAlgorithms.Papers.Independent.Information100.P63 (Mat)
open QAlgorithms.Papers.Independent.Information100.P67 (IsSubnormalized purifiedDistance)
open QAlgorithms.Papers.Independent.Information100.P69 (replacer permute)
open QAlgorithms.Papers.Independent.Information100.P71 (diamond channelPower channelRelative)
open QAlgorithms.Papers.Independent.Support50.P39 (quantumMutualInformation)
variable {A B C D R : Type} [Fintype A] [DecidableEq A]
[Fintype B] [DecidableEq B] [Fintype C] [DecidableEq C]
[Fintype D] [DecidableEq D] [Fintype R] [DecidableEq R]
variable [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D] [Nonempty R]
/-- Eq.(68), PDF p.15: all possibly correlated block constant channels.
The extended inner radius is also explicitly finite before conversion to real. -/
theorem constantDivergence_aep (N : Superop A B) (hN : IsChannel N) :
∃ value : ℝ, constantRelativeRadius N = (value : EReal) ∧
(∀ e : ℝ, 0 ≤ e → ∀ n : ℕ,
constantMaxRadius (channelPower N n) e ≠ ⊤ ∧
constantMaxRadius (channelPower N n) e ≠ ⊥) ∧
IteratedLimit (fun e n => (constantMaxRadius (channelPower N n) e).toReal / n) value := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P65
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For finite types with decidable equality and every channel , there exists a real number such that the infimum, over all density matrices on , of equals the finite extended-real value , where . A density matrix is positive semidefinite with trace , and a channel has a finite Kraus representation whose Kraus matrices satisfy . Here is the supremum over all unit vectors of the base-two relative entropy between and ; this relative entropy is unless both arguments are density matrices and , and otherwise is the nonnegative part of , divided by , with the matrix functions defined by continuous functional calculus and the total real logarithm. In addition, for every real and every natural , including , the following extended-real infimum is neither nor :
Here is on , , tensor powers are defined by products of matrix-unit entries, and for input register , using arbitrary matrices on , with . Finally, there exists a function such that, for every , as , and as . This is an iterated limit; the assertion gives no uniformity in . Extended-real infima and suprema retain their infinite values, and conversion to a real sends either infinity to , although the stated finiteness excludes that conversion case for when .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.