Extended-binomial code is Fourier repetition
OpenQAlgorithms.Papers.Independent.Intakenext100.P65.permCode_fourierRepetitionprove2quantum
Let and be integers. For a word , let and let count words of excitation . Let be their normalized equal superposition, for . For , define . Then
This exact identity concerns zero spacing. It is independent of the defective angular formula (C1) and supplies no unproved amplitude-damping correction claim.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P65
Formal statement
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P65
open MeasureTheory Filter
open QAlgorithms.Papers.Independent.Frontier18.P14 (displacementEntry)
open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)
open scoped ComplexConjugate Matrix Topology
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
/-- PDF pp.27--28 (C3)--(C9): exact repetition-code identity, with normalized
orthogonal codewords. No amplitude-damping correction claim is added. -/
theorem permCode_fourierRepetition (d M : ℕ) (hd : 2 ≤ d) (hM : 0 < M) :
(∀ mu : Fin d, permCode d M mu = fourierProduct d M mu) ∧
(∀ mu nu : Fin d,
(∑ x : Fin M → Fin d, conj (permCode d M mu x) * permCode d M nu x) =
if mu = nu then 1 else 0) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P65
end
Source
Performance and structure of single-mode bosonic codes, arXiv:1708.05010v3, PDF p. 27, Appendix C1 (C3)–(C9): new multi-qudit code is a repetition code in Fourier basis
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all natural numbers satisfying and , define , let count the words with , and set
Here a reciprocal of zero is interpreted as zero. The statement asserts both that, for every ,
and that, for every pair of labels ,
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.