One-shot quantum Feinstein packing bounds
OpenQAlgorithms.Papers.Independent.Intakethird100.P05.one_shot_feinsteinLet be a density-output channel on a finite alphabet and finite-dimensional complex Hilbert space. For an input law , put and . Suppose , , and
For every and there are distinct words and positive decoder operators with such that
The test in the premise is the strict positive spectral projection. The error uses the original channel states and uniform messages. This one-shot statement gives both size and reliability of a single code; no upper restriction on or is imposed.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P05
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P05
open scoped Matrix ComplexConjugate ComplexOrder BigOperators
open Filter Topology QAlgorithms
open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)
open QAlgorithms.Papers.Independent.Information100.P07 (positiveProjection)
open QAlgorithms.Papers.Independent.Dependency50.P28 (tr pinch typeI accept)
open QAlgorithms.Papers.Independent.Claimed50.P45 (pinchedTest)
open QAlgorithms.Papers.Independent.Information100.P58 (Distribution)
open QAlgorithms.Papers.Independent.Information100.P27 (average)
open QAlgorithms.Papers.Independent.Dependency50.P07 (wordProb)
open QAlgorithms.Papers.Independent.Dependency50.P35 (directSum)
open QAlgorithms.Papers.Independent.Renew46.P44 (wordOutput)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {X I : Type} [Fintype X] [DecidableEq X] [Fintype I] [DecidableEq I]
/-- PDF p.4, Lemma 2, (17)–(19): a one-shot quantum Feinstein code with BOTH
cardinality and average-error bounds. There is no delta < 1 hypothesis.
The hypothesis uses pinched states; the output error uses original states. -/
theorem one_shot_feinstein (W : DensityOutputChannel X I) (p : Distribution X)
(delta c : ℝ) (hdelta : 0 ≤ delta) (hc : 0 < c)
(hgood : 1 - delta ≤ goodMass W p c)
(gamma eta : ℝ) (hgamma : 0 < gamma) (heta : 0 < eta) :
∃ C : DistinctWordCode X I,
gamma / (gamma + delta) * min eta (1 - delta - gamma - 2 * Real.sqrt eta) ≤
(C.size : ℝ) / c ∧
uniformMessageError W.state C ≤ delta + gamma + 2 * Real.sqrt eta := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P05
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For finite index types with decidable equality, let be positive semidefinite complex matrices of trace , and let with . Put and , summing over the distinct eigenvalues of , with its spectral projections. Let denote the orthogonal projection onto the range of the positive part , defined by continuous functional calculus. For real , assume , , , , and
There exists a code with positive integer size , distinct inputs , and positive semidefinite decoding matrices on satisfying , such that
There is no assumption that or that the expression inside the minimum is positive, so the size lower bound may be nonpositive.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.