Coset weight polynomials and Shor–Laflamme enumerators
ProvedQAlgorithms.Papers.Independent.Support50.P40.shorLaflamme_relationLet and let be a finite set of canonical Hermitian -qubit Pauli labels, with scalar phases discarded. Write for the number of nonidentity factors, for , and . Using ordinary matrix traces, define and .
Then, for every Pauli label and nonnegative integer ,
For one also has
This identifies the probability polynomials with the earlier enumerators. The division-free formula remains valid at .
Formalization Note The first double sum in printed Eq. (6) omits . The statement includes the normalization forced by Eq. (5) and both right-hand expressions; independent moderation of this correction remains required.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P40
namespace QAlgorithms.Papers.Independent.Support50.P40
open QAlgorithms QAlgorithms.Stabilizer
open scoped ComplexConjugate Matrix
noncomputable section
/-- PDF p.7, Eqs.(5)--(6). Source correction: the first double sum in
printed Eq.(6) omits `4^(-p)`; Eq.(5) and both right-hand expressions force
this factor. The polynomial identity includes f=0; only the ratio form
requires f>0. No quantum-state hypothesis is needed for matrix enumerators. -/
theorem shorLaflamme_relation (p : ℕ) (C : Finset (ErrorLabel p))
(f : ℝ) (hf0 : 0 ≤ f) (hf1 : f ≤ 1) :
(∀ (e : ErrorLabel p) (d : ℕ),
slWeight d (pauliOps e) (pauliOps e) =
if opsWeight e = d then (4 : ℂ) ^ p else 0) ∧
((weightPolynomial f C : ℂ) = ((4 : ℂ) ^ p)⁻¹ *
∑ e ∈ C, ∑ d ∈ Finset.range (p + 1),
slWeight d (pauliOps e) (pauliOps e) * (f : ℂ) ^ (p - d) * (noiseG f : ℂ) ^ d) ∧
(0 < f →
(weightPolynomial f C : ℂ) = (f : ℂ) ^ p / (4 : ℂ) ^ p *
∑ e ∈ C, slEnumerator ((noiseG f : ℂ) / (f : ℂ)) (pauliOps e) (pauliOps e) ∧
(weightPolynomial f C : ℂ) = ((f : ℂ) / 4) ^ p *
∑ e ∈ C, slEnumerator (((1 - f) / (3 * f) : ℝ) : ℂ) (pauliOps e) (pauliOps e)) := by sorry
end
end QAlgorithms.Papers.Independent.Support50.P40
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , every finite set of length- strings over , and every real satisfying , set . Order the Boolean basis as , and use the Pauli matrices
For a label string , write and let count its nonidentity labels. Define
The traces in are multiplied without complex conjugation. The theorem asserts all of the following equalities:
where the real quantity on the left is embedded into ; moreover, if , it asserts both
The parameter in the first assertion is unrestricted, including , when its defining sum is empty. The theorem includes , , and the endpoints ; the final two equalities are required only under the additional hypothesis . At , the tensor product is the scalar identity on the unique empty Boolean string, and all zero-exponent powers equal .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.