Half-error specialization of the one-shot lower bound
OpenQAlgorithms.Papers.Independent.Support50.P20.oneShotCapacity_halfErrorLet be an arbitrary classical-quantum channel on a nonempty input set, with normalized trace-class output states. Let be the extended supremum of rates of finite-message codes with complete decoding POVMs and average error at most . For a discrete input law , define the joint state and its marginals . For ,
This is the specialization of Theorem 1 obtained by taking the auxiliary error parameter equal to half the coding error. All logarithms and rates are in bits.
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 pp.2–3, Remark 1, (4): the epsilonPrime=epsilon/2 lower bound in bits. -/
theorem oneShotCapacity_halfError {X I : Type*} [Nonempty X]
(b : HilbertBasis I ℂ H) (W : ClassicalInputChannel X b) (epsilon : ℝ)
(hZero : 0 < epsilon) (hOne : epsilon < 1) :
optimizedTestingInformation b W (epsilon / 2) -
(logTwo (1 / epsilon) : ℝ) - 4 ≤ 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. Write . Let , for every , be a bounded complex-linear operator that is self-adjoint with nonnegative real quadratic form and trace , and admits a representation with . An effect means that both and are bounded self-adjoint operators with nonnegative real quadratic forms; put . For a probability mass function on and effects , put and , using real probability masses. Define , where the infimum is in , , , and for positive finite . Define as the extended-real supremum of over positive integers , words , and effects satisfying and ; repeated words are permitted. For every real , the declaration asserts the extended-real inequality
No finiteness or countability assumption is made on or .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.