Strong-converse exponent bound and constructed crossing
OpenQAlgorithms.Papers.Independent.Gap48.P41.strong_converse_exponent_boundLet 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.
Put and . Spectral powers vanish on the kernel, including at zero and negative orders.
For any real , define
The maximum is attained and . For every sequence of effects,
If , some satisfies
This is a bound for every real rate, including the endpoint branches; it asserts no optimality of the quantum exponent.
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 pp.5--6, Theorem 3, (13)--(17): limsup bound for every real r, the
constructed crossing, attained compact maximum, and interior parametrization.
This is the paper's Petz bound, not the later optimal sandwiched exponent. -/
theorem strong_converse_exponent_bound [Nonempty I]
(rho sigma : Mat I) (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
(hsupp : SupportLE rho sigma) (r : ℝ) (A : TestSequence I)
(hrate : limsup (fun k => scaled k (logNonnegativeExtended
(accept sigma (k + 1) (A k).1))) atTop ≤ -(r : EReal)) :
petzPhi rho sigma (crossing rho sigma r) = r - crossing rho sigma r ∧
petzPhi rho sigma (crossing rho sigma r) = petzExponent rho sigma r ∧
IsGreatest (petzG rho sigma r '' Set.Icc 0 1) (petzExponent rho sigma r) ∧
limsup (fun k => scaled k (logNonnegativeExtended
(1 - typeI rho (k + 1) (A k).1))) atTop ≤
-((petzPhi rho sigma (crossing rho sigma r)) : EReal) ∧
((relativeEntropy rho sigma).toReal ≤ r ∧
r ≤ 2 * deriv (petzPsi rho sigma) 1 - petzPsi rho sigma 1 →
∃ s ∈ Set.Icc (0 : ℝ) 1,
petzExponent rho sigma r = s * deriv (petzPsi rho sigma) s - petzPsi rho sigma s ∧
r = (1 + s) * deriv (petzPsi rho sigma) s - petzPsi rho sigma s) := 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 . Define by spectral functional calculus, assigning zero to zero eigenvalues for every , and put
The real logarithm has . Let be any real number, with no nonnegativity requirement, and let , for every , be a matrix indexed by such that and . Write , and set for and otherwise. If
then , , and belongs to and dominates that entire set; also,
Finally, defining , with the same total logarithm in spectral functional calculus, if , there exists such that and . The limsup statements use extended real arithmetic.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.