Strict type-II rate gap forces exponentially vanishing success
OpenQAlgorithms.Papers.Independent.Gap48.P41.exponentially_fast_strong_converseLet be a nonempty finite orthonormal basis, and let be positive semidefinite complex matrices of trace one with . For a positive integer , an arbitrary effect accepts the null state . Write and . All logarithms are natural, with in rates. Write , using support-restricted spectral logarithms inside the trace.
For every sequence of effects with
there are and a positive threshold such that
In particular, . This gives the paper's exponential strong converse, with the decay rate concluded from the strict gap.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P41
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap48.P41
open scoped Matrix ComplexOrder BigOperators
open Filter QAlgorithms
open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)
open QAlgorithms.Papers.Independent.Information100.P07 (positiveProjection)
open QAlgorithms.Papers.Independent.Dependency50.P28
(tr SupportLE relativeEntropy scalarPower classicalD typeI accept TestSequence
scaled logNonnegativeExtended)
open QAlgorithms.Papers.Independent.Claimed50.P15 (legendre)
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I : Type} [Fintype I] [DecidableEq I]
/-- PDF p.7, Corollary 1, (18): a strict type-II rate gap forces exponential
convergence of alpha to one. Constants are chosen before the block index. -/
theorem exponentially_fast_strong_converse [Nonempty I]
(rho sigma : Mat I) (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
(hsupp : SupportLE rho sigma) (A : TestSequence I)
(hrate : limsup (fun k => scaled k (logNonnegativeExtended
(accept sigma (k + 1) (A k).1))) atTop < -relativeEntropy rho sigma) :
(∃ c : ℝ, 0 < c ∧ ∃ K : ℕ, ∀ k ≥ K,
1 - typeI rho (k + 1) (A k).1 ≤ Real.exp (-c * ((k + 1 : ℕ) : ℝ))) ∧
Tendsto (fun k => typeI rho (k + 1) (A k).1) atTop (nhds 1) := by sorry
end QAlgorithms.Papers.Independent.Gap48.P41
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a nonempty finite type with decidable equality, and let be positive semidefinite complex matrices indexed by , each of trace , with . For every , let be a matrix indexed by with and . Define
Here tensor powers have entries , and matrix logarithms use spectral functional calculus with the total real logarithm, including . Put for and otherwise. If the extended real inequality holds, then there exist a real and a natural number such that
and as .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.