Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

First undetectable cat loss and bit-flip saturation

Open
QAlgorithms.Papers.Independent.Intakenext100.P65.cat_firstUndetectable

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

prove2quantum

Fix S≥0S\ge0S≥0 and 0<γ<10<\gamma<10<γ<1. In the normalized cat basis with real amplitude a>0a>0a>0, write NarN_a^rNar​ for projected-coherent normalization probabilities and ϵℓk\epsilon_{\ell k}ϵℓk​ for the compression of Eℓ†EkE_\ell^\dagger E_kEℓ†​Ek​. Then

ϵ0,S+1=(γa)S+1e−γa2(S+1)!Na0NaS+1(0Na1−γ0Na1−γS+10).\epsilon_{0,S+1}=\frac{(\sqrt\gamma a)^{S+1}e^{-\gamma a^2}}{\sqrt{(S+1)!N_a^0N_a^{S+1}}}\begin{pmatrix}0&N_{a\sqrt{1-\gamma}}^0\\N_{a\sqrt{1-\gamma}}^{S+1}&0\end{pmatrix}.ϵ0,S+1​=(S+1)!Na0​NaS+1​​(γ​a)S+1e−γa2​(0Na1−γ​S+1​​Na1−γ​0​0​).

Let cℓkc_{\ell k}cℓk​ be the identity coefficient and xℓkx_{\ell k}xℓk​ the logical-X coefficient of the actual block. Both c00c_{00}c00​ and cS+1,S+1c_{S+1,S+1}cS+1,S+1​ are positive at every finite a>0a>0a>0, and

x0,S+1c00cS+1,S+1⟶1(a→∞).\frac{x_{0,S+1}}{\sqrt{c_{00}c_{S+1,S+1}}}\longrightarrow1\qquad(a\to\infty).c00​cS+1,S+1​​x0,S+1​​⟶1(a→∞).

This ratio statement preserves the source's meaning of asymptotic saturation even when all entries tend to zero.

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.11 (5.15)--(5.16): first undetectable loss and ratio saturation of the
bit-flip Cauchy--Schwarz bound; both probabilities may vanish as a grows. -/
theorem cat_firstUndetectable (S : ℕ) (g : ℝ) (hg0 : 0 < g) (hg1 : g < 1) :
    (∀ a > (0 : ℝ), qecBlock (catCodeCoordinates a S) g 0 (S + 1) =
      (((Real.sqrt g * a) ^ (S + 1) * Real.exp (-g * a ^ 2) /
        Real.sqrt ((Nat.factorial (S + 1) : ℝ) * catNorm a S 0 * catNorm a S (S + 1))) : ℂ) •
          !![0, (catNorm (a * Real.sqrt (1 - g)) S 0 : ℂ);
             (catNorm (a * Real.sqrt (1 - g)) S (S + 1) : ℂ), 0]) ∧
    (∀ a > (0 : ℝ), 0 < qecC (catCodeCoordinates a S) g 0 0 ∧ 0 < qecC (catCodeCoordinates a S) g (S + 1) (S + 1)) ∧
    Tendsto (fun a => qecX (catCodeCoordinates a S) g 0 (S + 1) /
      Real.sqrt (qecC (catCodeCoordinates a S) g 0 0 * qecC (catCodeCoordinates a S) g (S + 1) (S + 1))) atTop (nhds 1) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P65

end
Source
Performance and structure of single-mode bosonic codes, arXiv:1708.05010v3, PDF p. 11, §V B (5.15)–(5.16): first undetectable cat loss and its saturation
Read-back

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

For every natural number SSS, including S=0S=0S=0, and real ggg with 0<g<10<g<10<g<1, put D=2(S+1)D=2(S+1)D=2(S+1), define

Cr(a)=∑n≥0n≡r(modD)∣e−a2/2ann!∣2,vμ(a)(n)={e−a2/2ann!C(S+1)μ(a),n≡(S+1)μ(modD),0,otherwise,C_r(a)=\sum_{\substack{n\ge0\\ n\equiv r\pmod D}} \left|\frac{e^{-a^2/2}a^n}{\sqrt{n!}}\right|^2,\qquad v_\mu^{(a)}(n)= \begin{cases} \dfrac{e^{-a^2/2}a^n}{\sqrt{n!}\sqrt{C_{(S+1)\mu}(a)}}, &n\equiv(S+1)\mu\pmod D,\\ 0,&\text{otherwise}, \end{cases}Cr​(a)=n≥0n≡r(modD)​∑​​n!​e−a2/2an​​2,vμ(a)​(n)=⎩⎨⎧​n!​C(S+1)μ​(a)​e−a2/2an​,0,​n≡(S+1)μ(modD),otherwise,​

for real aaa and μ∈{0,1}\mu\in\{0,1\}μ∈{0,1}. Define

(Llv)(n)=(n+ll) (g)l(1−g)nv(n+l),Klk(a)μν=∑n≥0(Llvμ(a))(n)‾(Lkvν(a))(n),(L_l v)(n)=\sqrt{\binom{n+l}{l}}\,(\sqrt g)^l(\sqrt{1-g})^n v(n+l),\qquad K_{lk}(a)_{\mu\nu}=\sum_{n\ge0}\overline{(L_l v_\mu^{(a)})(n)}(L_k v_\nu^{(a)})(n),(Ll​v)(n)=(ln+l​)​(g​)l(1−g​)nv(n+l),Klk​(a)μν​=n≥0∑​(Ll​vμ(a)​)(n)​(Lk​vν(a)​)(n),

and clk(a)=Re⁡(Klk(a)00+Klk(a)11)/2c_{lk}(a)=\operatorname{Re}(K_{lk}(a)_{00}+K_{lk}(a)_{11})/2clk​(a)=Re(Klk​(a)00​+Klk​(a)11​)/2, xlk(a)=Re⁡(Klk(a)01+Klk(a)10)/2x_{lk}(a)=\operatorname{Re}(K_{lk}(a)_{01}+K_{lk}(a)_{10})/2xlk​(a)=Re(Klk​(a)01​+Klk​(a)10​)/2. Then, for every a>0a>0a>0,

K0,S+1(a)=(g a)S+1e−ga2(S+1)! C0(a)CS+1(a)(0C0(a1−g)CS+1(a1−g)0),c00(a)>0,cS+1,S+1(a)>0.K_{0,S+1}(a)= \frac{(\sqrt g\,a)^{S+1}e^{-ga^2}} {\sqrt{(S+1)!\,C_0(a)C_{S+1}(a)}} \begin{pmatrix} 0&C_0(a\sqrt{1-g})\\ C_{S+1}(a\sqrt{1-g})&0 \end{pmatrix}, \qquad c_{00}(a)>0,\quad c_{S+1,S+1}(a)>0.K0,S+1​(a)=(S+1)!C0​(a)CS+1​(a)​(g​a)S+1e−ga2​(0CS+1​(a1−g​)​C0​(a1−g​)0​),c00​(a)>0,cS+1,S+1​(a)>0.

Moreover,

lim⁡a→+∞x0,S+1(a)c00(a)cS+1,S+1(a)=1.\lim_{a\to+\infty} \frac{x_{0,S+1}(a)} {\sqrt{c_{00}(a)c_{S+1,S+1}(a)}}=1.a→+∞lim​c00​(a)cS+1,S+1​(a)​x0,S+1​(a)​=1.

All divisions use the total convention 1/0=01/0=01/0=0; in particular the defining expressions also assign values at a=0a=0a=0, although the displayed identities and positivity assertions quantify over a>0a>0a>0.

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