Two-sided one-shot classical-quantum capacity bounds
OpenQAlgorithms.Papers.Independent.Support50.P20.oneShotCapacity_boundsLet be any channel from a nonempty classical set to normalized positive trace-class operators on a complex Hilbert space . A code has an integer number of equiprobable messages, an arbitrary encoder, and a complete -outcome POVM; its rate is and its error is average decoding error. Let be the extended supremum of rates of codes with error at most . For a discrete input law , set , with marginals , and write . Here , with . If , then
These bounds compare the operational capacity with optimized hypothesis-testing information without a dimension, alphabet-size, or memory assumption.
Formalization Note The cq testing optimization uses the diagonal classical blocks of an arbitrary effect. This preserves both trace probabilities and the whole testing optimization. Capacity is defined from codes independently of the information quantity.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P20
noncomputable section
open Filter
open scoped ENNReal
namespace QAlgorithms.Papers.Independent.Support50.P20
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Dependency50.P13
(IsTraceClass IsPositive operatorTrace State)
open QAlgorithms.Papers.Independent.Information100.P63 (logTwo)
variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
/-- PDF p.2, Theorem 1, (3): BOTH one-shot bounds, with distinct error parameters.
Capacity is an extended supremum of rates of actual finite-message codes. -/
theorem oneShotCapacity_bounds {X I : Type*} [Nonempty X]
(b : HilbertBasis I ℂ H) (W : ClassicalInputChannel X b)
(epsilon epsilonPrime : ℝ) (hPrime : 0 < epsilonPrime)
(hOrder : epsilonPrime < epsilon) (hOne : epsilon < 1) :
oneUseCodeCapacity b W epsilon ≤ optimizedTestingInformation b W epsilon ∧
optimizedTestingInformation b W epsilonPrime -
(logTwo (4 * epsilon / (epsilon - epsilonPrime)^2) : ℝ) ≤
oneUseCodeCapacity b W epsilon := by sorry
end QAlgorithms.Papers.Independent.Support50.P20
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a complete complex inner-product space, let be any nonempty type, let be any type, and let be a Hilbert basis of . A trace-class operator here means a bounded complex-linear operator admitting sequences such that and for every . Write . A state is such a trace-class operator satisfying , for every , and . Let assign a state to every . An effect is a bounded operator for which both and are self-adjoint with nonnegative real quadratic forms; set . For a probability mass function on and a family of effects , define and . Here the probabilities are the real values of the mass function. Define
where the infimum is in , , , and for . Define as the supremum, in the extended reals, of over positive integers , words , and effects with , satisfying ; the words need not be distinct. For every pair of real numbers , the declaration asserts
Both inequalities use extended-real arithmetic, and neither nor the basis index set is assumed finite or countable.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.