Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Binomial identity and distortion coefficients

Open
QAlgorithms.Papers.Independent.Intakenext100.P65.binomial_diagonalQec

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let N,S,ℓ≥0N,S,\ell\ge0N,S,ℓ≥0 be integers, 0<γ<10<\gamma<10<γ<1, and use the positive and negative combinations ∣±⟩=(∣0bin⟩±∣1bin⟩)/2|\pm\rangle=(|0_{\rm bin}\rangle\pm|1_{\rm bin}\rangle)/\sqrt2∣±⟩=(∣0bin​⟩±∣1bin​⟩)/2​ as the logical basis. For the actual compression of Eℓ†EℓE_\ell^\dagger E_\ellEℓ†​Eℓ​, let cℓℓc_{\ell\ell}cℓℓ​ and zℓℓz_{\ell\ell}zℓℓ​ denote its identity and Z coefficients in that basis. Define G±(x)=((1±xS+1)/2)N+1G_\pm(x)=((1\pm x^{S+1})/2)^{N+1}G±​(x)=((1±xS+1)/2)N+1. Then

cℓℓ=γℓℓ!G+(ℓ)(1−γ),zℓℓ=γℓℓ!G−(ℓ)(1−γ).c_{\ell\ell}=\frac{\gamma^\ell}{\ell!}G_+^{(\ell)}(1-\gamma),\qquad z_{\ell\ell}=\frac{\gamma^\ell}{\ell!}G_-^{(\ell)}(1-\gamma).cℓℓ​=ℓ!γℓ​G+(ℓ)​(1−γ),zℓℓ​=ℓ!γℓ​G−(ℓ)​(1−γ).

Polynomial derivatives make the zero above the finite support exact. No claim is made that these two coefficients alone describe the full block for every positive loss count.

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 p.12 (6.4)--(6.5): only c and z are prescribed, in the plus/minus basis;
this does not erase possible other coefficients for positive loss count. -/
theorem binomial_diagonalQec (N S l : ℕ) (g : ℝ) (hg0 : 0 < g) (hg1 : g < 1) :
    qecC (binomialParity N S) g l l =
      g ^ l / Nat.factorial l *
        (((Polynomial.derivative : Polynomial ℝ → Polynomial ℝ)^[l])
          (binomialGenerator N S false)).eval (1 - g) ∧
    qecZ (binomialParity N S) g l l =
      g ^ l / Nat.factorial l *
        (((Polynomial.derivative : Polynomial ℝ → Polynomial ℝ)^[l])
          (binomialGenerator N S true)).eval (1 - g) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P65

end
Source
Performance and structure of single-mode bosonic codes, arXiv:1708.05010v3, PDF p. 12, §VI A (6.4)–(6.5): binomial diagonal QEC coefficients
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every natural numbers N,S,lN,S,lN,S,l, including zero, and real ggg with 0<g<10<g<10<g<1, define sequences

bν((S+1)m)=(−1)νm(N+1m)2N+1(0≤m≤N+1),pμ=b0+(−1)μb12,b_\nu((S+1)m)=(-1)^{\nu m}\sqrt{\frac{\binom{N+1}{m}}{2^{N+1}}} \quad(0\le m\le N+1),\qquad p_\mu=\frac{b_0+(-1)^\mu b_1}{\sqrt2},bν​((S+1)m)=(−1)νm2N+1(mN+1​)​​(0≤m≤N+1),pμ​=2​b0​+(−1)μb1​​,

where the bνb_\nubν​ vanish elsewhere and μ,ν∈{0,1}\mu,\nu\in\{0,1\}μ,ν∈{0,1}. Put

(Llv)(n)=(n+ll) (g)l(1−g)nv(n+l),Kμν=∑n≥0(Llpμ)(n)‾(Llpν)(n).(L_l v)(n)=\sqrt{\binom{n+l}{l}}\,(\sqrt g)^l(\sqrt{1-g})^n v(n+l),\qquad K_{\mu\nu}=\sum_{n\ge0}\overline{(L_l p_\mu)(n)}(L_l p_\nu)(n).(Ll​v)(n)=(ln+l​)​(g​)l(1−g​)nv(n+l),Kμν​=n≥0∑​(Ll​pμ​)(n)​(Ll​pν​)(n).

Then the real half-sum and half-difference of the diagonal entries satisfy

Re⁡(K00+K11)2=gll!dldxl(1+xS+12)N+1∣x=1−g,Re⁡(K00−K11)2=gll!dldxl(1−xS+12)N+1∣x=1−g.\frac{\operatorname{Re}(K_{00}+K_{11})}{2} =\frac{g^l}{l!} \left.\frac{d^l}{dx^l}\left(\frac{1+x^{S+1}}2\right)^{N+1}\right|_{x=1-g}, \qquad \frac{\operatorname{Re}(K_{00}-K_{11})}{2} =\frac{g^l}{l!} \left.\frac{d^l}{dx^l}\left(\frac{1-x^{S+1}}2\right)^{N+1}\right|_{x=1-g}.2Re(K00​+K11​)​=l!gl​dxldl​(21+xS+1​)N+1​x=1−g​,2Re(K00​−K11​)​=l!gl​dxldl​(21−xS+1​)N+1​x=1−g​.

For l=0l=0l=0, the zeroth derivative is the polynomial itself; no upper bound on lll is assumed.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me