Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Leading-order single-loss cat sweet spot

Open
QAlgorithms.Papers.Independent.Intakenext100.P65.cat_sweetSpot

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

prove2quantum

Consider the S=1S=1S=1 projected-coherent cat states ∣0a⟩,∣1a⟩|0_a\rangle,|1_a\rangle∣0a​⟩,∣1a​⟩ with real a>0a>0a>0. Their mean photon numbers are finite. Equality of their mean photon numbers, which is the leading-order no-loss backaction condition, is equivalent to

⟨0a∣n^∣0a⟩=⟨1a∣n^∣1a⟩⟺sin⁡(a2)cosh⁡(a2)+cos⁡(a2)sinh⁡(a2)=0.\langle0_a|\hat n|0_a\rangle=\langle1_a|\hat n|1_a\rangle\quad\Longleftrightarrow\quad \sin(a^2)\cosh(a^2)+\cos(a^2)\sinh(a^2)=0.⟨0a​∣n^∣0a​⟩=⟨1a​∣n^∣1a​⟩⟺sin(a2)cosh(a2)+cos(a2)sinh(a2)=0.

This is the pole-free form of tan⁡(a2)=−tanh⁡(a2)\tan(a^2)=-\tanh(a^2)tan(a2)=−tanh(a2). It does not assert exact finite-loss correction, nor treat the approximate numerical root as an exact constant.

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.10 (5.9)--(5.10): exact leading-order condition, cross-multiplied to
avoid turning tangent poles into solutions. Rounded numerical roots are not equalities. -/
theorem cat_sweetSpot (a : ℝ) (ha : 0 < a) :
    (fockMomentDomain (catCodeCoordinates a 1 0) 1 ∧ fockMomentDomain (catCodeCoordinates a 1 1) 1) ∧
    (numberMoment (catCodeCoordinates a 1 0) 1 = numberMoment (catCodeCoordinates a 1 1) 1 ↔
      Real.sin (a ^ 2) * Real.cosh (a ^ 2) +
        Real.cos (a ^ 2) * Real.sinh (a ^ 2) = 0) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P65

end
Source
Performance and structure of single-mode bosonic codes, arXiv:1708.05010v3, PDF p. 10, §V A (5.9)–(5.10): leading-order single-loss cat sweet spot
Read-back

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

For every real a>0a>0a>0, define, for μ∈{0,1}\mu\in\{0,1\}μ∈{0,1},

Cμ=∑n=0∞∣1 n≡2μ  (mod 4)e−a2/2ann!∣2,vμ,n=1 n≡2μ  (mod 4)e−a2/2an/n!Cμ.C_\mu=\sum_{n=0}^{\infty} \left|\mathbf1_{\,n\equiv2\mu\;(\mathrm{mod}\,4)} e^{-a^2/2}\frac{a^n}{\sqrt{n!}}\right|^2, \qquad v_{\mu,n} =\frac{\mathbf1_{\,n\equiv2\mu\;(\mathrm{mod}\,4)} e^{-a^2/2}a^n/\sqrt{n!}}{\sqrt{C_\mu}}.Cμ​=n=0∑∞​​1n≡2μ(mod4)​e−a2/2n!​an​​2,vμ,n​=Cμ​​1n≡2μ(mod4)​e−a2/2an/n!​​.

The theorem asserts that both series ∑n=0∞n∣v0,n∣2\sum_{n=0}^{\infty}n|v_{0,n}|^2∑n=0∞​n∣v0,n​∣2 and ∑n=0∞n∣v1,n∣2\sum_{n=0}^{\infty}n|v_{1,n}|^2∑n=0∞​n∣v1,n​∣2 are summable, and that their sums are equal if and only if

sin⁡(a2)cosh⁡(a2)+cos⁡(a2)sinh⁡(a2)=0.\sin(a^2)\cosh(a^2)+\cos(a^2)\sinh(a^2)=0.sin(a2)cosh(a2)+cos(a2)sinh(a2)=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