Sequential decoding — Finite independent-codebook error estimate
OpenGaoQuantumUnion.coding_applicationLet be a finite ensemble, orthogonal projectors, and . Assume , , , and , with and . For , independently sample codewords from , and decode in sequence using the actual projector experiment. Then
and a codebook exists with average error bounded by the same expression. This is the algebraic finite form of the paper's estimates before substituting and . The expectation is the explicit product-weight sum over all codebooks, with repetitions allowed; the required estimates are conclusions, not additional assumptions.
import Definitions.Def_GaoQuantumUnion_Decoding open Matrix WildeQIT GaoQuantumUnion open scoped MatrixOrder ComplexOrder ComplexConjugate set_option autoImplicit false
namespace GaoQuantumUnion
theorem coding_application {ι J : Type} [Fintype ι] [DecidableEq ι]
[Fintype J] [DecidableEq J] (p : FinDist J) (ρ : J → Matrix ι ι ℂ)
(hρ : ∀ j, IsDensityOperator (ρ j)) (P : Matrix ι ι ℂ) (hP : IsProjector P)
(Q : J → Matrix ι ι ℂ) (hQ : ∀ j, IsProjector (Q j))
(ε A B : ℝ) (hε : 0 < ε) (hA : 0 ≤ A) (hB : 0 ≤ B)
(havg : 1-ε ≤ (P*WildeQIT.Gentle.averageState p ρ).trace.re)
(hdetect : ∀ j, 1-ε ≤ (Q j*ρ j).trace.re)
(hsize : ∀ j, (Q j).trace.re ≤ B)
(hsandwich : ((A : ℂ) • (1 : Matrix ι ι ℂ)-P*WildeQIT.Gentle.averageState p ρ*P).PosSemidef)
(M : ℕ) (hM : 0 < M) :
(∑ C : Fin M → J, codeWeight p C*codeError ρ P Q C) ≤ 33*ε+4*((M : ℝ)-1)*A*B ∧
∃ C : Fin M → J, codeError ρ P Q C ≤ 33*ε+4*((M : ℝ)-1)*A*B := by sorry
end GaoQuantumUnion
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent blind read-back agent)
For any finite types and , each equipped with decidable equality, let satisfy for every and , let be a complex matrix indexed by for every , with each positive semidefinite and as an equality of complex numbers, and let and for every be complex matrices of the same size satisfying , , , and , where denotes conjugate transpose. Write for the identity matrix, , and , with each real weight embedded into for scalar multiplication. For any real numbers satisfying , , and , assume , for every , for every , and that is positive semidefinite. Then, for every natural number , consider all functions . For each such function and each define and for , and put ; thus matrix multiplication applies first, then the rejection factors for positions in that order, and finally . Define and , so the average inside assigns equal weight to positions, while the sum over functions uses the product weights . Both and the existence of a function with are asserted. The function need not be injective, so repeated values are included; zero values of are permitted, functions containing such values still occur in the sum with weight zero, and the existential conclusion imposes no positive-weight condition on its function. There is no upper bound assumed on , and or is allowed whenever the other hypotheses hold. The condition excludes and division by zero; for the only rejection prefix is the empty product , and the term is zero, with here subtraction in after converting to a real number. No nonemptiness assumption is separately imposed on the finite types, but cannot admit the specified because its empty sum is zero, and cannot satisfy the density hypotheses for the resulting nonempty because the trace of every such empty matrix is zero; thus those empty-type cases have no data satisfying all the hypotheses.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.