Pointwise improvement over the extended and SWAT bounds
ProvedQAlgorithms.Papers.Independent.Bridge50.P15.twisted_bound_dominanceprove2quantum
Let , , and . Define
Then and , with . These are the scalar twisted, extension-expression, and SWAT bounds in bits. Equality is allowed at zero noise and after clipping. This pointwise comparison does not assert that the extension expression equals an extension capacity outside its separately established weak-degradability regime.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Bridge50_P15
Formal statement
noncomputable section
open Filter
open scoped BigOperators ENNReal Topology Matrix
namespace QAlgorithms.Papers.Independent.Bridge50.P15
attribute [local instance] Classical.propDecidable Classical.decEq
attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P33
(State IsDensity IsTraceClass IsTraceClassChannel productCoeff tensorApply rankOne)
open QAlgorithms.Papers.Independent.Frontier30.P14
(Operation conjugateKernel partialLeft partialRight isometryCoeff WeaklyDegradable GaussianDensity)
open QAlgorithms.Papers.Independent.Frontier18.P18 (operatorCoeff boundedOperator)
open QAlgorithms.Papers.Independent.Frontier18.P07 (extendedRelativeEntropyNats)
open QAlgorithms.Papers.Independent.Gap48.P26
(entropyBits PhaseInsensitive weightedPhotonExpectation thermalKernel)
open QAlgorithms.Papers.Independent.Claimed50.P35 (traceClassQuantumCapacity vacuumChannel)
open QAlgorithms.Papers.Independent.Dependency50.P30 (thermalEntropyBits)
open QAlgorithms.Papers.Independent.Support50.P07 (qubitPhaseFlipChannel)
open QAlgorithms.Papers.Independent.Information100.P08 (qubitInput thermalChannel)
/-- PDF p.7 after (40): 'better' means no larger, with equality permitted
at N=0 and when clipping gives zero. Scalar comparison, without extending the
extension-capacity identity to eta<1/2. -/
theorem twisted_bound_dominance (eta N : ℝ) (heta : 0 < eta) (heta1 : eta < 1)
(hN : 0 ≤ N) (hprime : 0 < eta - N * (1 - eta)) :
twistedBound eta N ≤ extendedBound eta N ∧ twistedBound eta N ≤ swatBound eta N := by sorry
end QAlgorithms.Papers.Independent.Bridge50.P15
end
Source
Narrow Bounds for the Quantum Capacity of Thermal Attenuators, arXiv:1801.04731v5, PDF p. 7, Pointwise improvement over the extended and SWAT bounds
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all real and satisfying , define
The assertion is the conjunction and . These are non-strict inequalities between real numbers, with the maxima retained even when the expressions inside them are zero or negative. The real logarithm is total, with , so is included.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.