Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pure-loss jump times change only a scalar at fixed count

Open
QAlgorithms.Papers.Independent.Intakenext100.P65.pureLoss_jumpTimes

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

prove2quantum

Let κ,t>0\kappa,t>0κ,t>0, let ℓ≥0\ell\ge0ℓ≥0 be an integer, and let 0≤τ1≤⋯≤τℓ≤t0\le\tau_1\le\cdots\le\tau_\ell\le t0≤τ1​≤⋯≤τℓ​≤t. Put γ=1−e−κt\gamma=1-e^{-\kappa t}γ=1−e−κt. Form the chronological trajectory operator by alternating no-jump factors e−κsn^/2e^{-\kappa s\hat n/2}e−κsn^/2 over successive intervals with ℓ\ellℓ annihilations, followed by the final no-jump interval. As in (8.3), omit scalar jump-rate factors. Its number-basis formula has a bounded extension to every oscillator Hilbert vector, and

E~ℓ=fℓEℓ,fℓ=ℓ! e−κ∑jτj/2γℓ/2>0.\widetilde E_\ell=f_\ell E_\ell,\qquad f_\ell=\frac{\sqrt{\ell!}\,e^{-\kappa\sum_j\tau_j/2}}{\gamma^{\ell/2}}>0.Eℓ​=fℓ​Eℓ​,fℓ​=γℓ/2ℓ!​e−κ∑j​τj​/2​>0.

The output is square summable for every square-summable input. No zero-probability branch is normalized. Thus jump times provide only a scalar at fixed loss count. Obtaining the count by parity monitoring separately presupposes fixed initial parity and ideal arbitrarily fast QND parity measurements.

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.22 (8.3)--(8.4): jump-time dependence is a positive scalar for a fixed
lost-photon count. The domain clause excludes renormalization of zero branches.
Parity tracking additionally needs fixed input parity and ideal fast QND measurements;
this operator identity itself is valid on arbitrary physical input vectors. -/
theorem pureLoss_jumpTimes (k t : ℝ) (hk : 0 < k) (ht : 0 < t) (l : ℕ)
    (times : Fin l → ℝ) (hord : Monotone times)
    (hrange : ∀ i, 0 ≤ times i ∧ times i ≤ t) :
    let g := 1 - Real.exp (-k * t)
    0 < trajectoryScalar k times g ∧
    (∀ v : FockCoordinates, fockDomain v →
      fockDomain (jumpTrajectory k t times v) ∧
      jumpTrajectory k t times v = (trajectoryScalar k times g : ℂ) • lossVector g l v) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P65

end
Source
Performance and structure of single-mode bosonic codes, arXiv:1708.05010v3, PDF p. 22, §VIII B (8.3)–(8.4): pure-loss jump times carry no extra recovery information
Read-back

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

For every k,t∈Rk,t\in\mathbb Rk,t∈R with k>0k>0k>0 and t>0t>0t>0, every l∈Nl\in\mathbb Nl∈N, and every nondecreasing sequence of times 0≤τ0≤⋯≤τl−1≤t0\le\tau_0\le\cdots\le\tau_{l-1}\le t0≤τ0​≤⋯≤τl−1​≤t, put g=1−e−ktg=1-e^{-kt}g=1−e−kt and

c=l! exp⁡ ⁣(−k2∑j=0l−1τj)(g)l.c=\frac{\sqrt{l!}\,\exp\!\left(-\frac{k}{2}\sum_{j=0}^{l-1}\tau_j\right)}{(\sqrt g)^l}.c=(g​)ll!​exp(−2k​∑j=0l−1​τj​)​.

Then c>0c>0c>0. Moreover, for every complex sequence vvv satisfying ∑n=0∞∣vn∣2<∞\sum_{n=0}^{\infty}|v_n|^2<\infty∑n=0∞​∣vn​∣2<∞, the following output sequence www is also square summable: start with s0=0s_0=0s0​=0, v(0)=vv^{(0)}=vv(0)=v, recursively set sj+1=τjs_{j+1}=\tau_jsj+1​=τj​ and vn(j+1)=n+1 e−k(τj−sj)(n+1)/2vn+1(j)v^{(j+1)}_n=\sqrt{n+1}\,e^{-k(\tau_j-s_j)(n+1)/2}v^{(j)}_{n+1}vn(j+1)​=n+1​e−k(τj​−sj​)(n+1)/2vn+1(j)​, and finish with wn=e−k(t−sl)n/2vn(l)w_n=e^{-k(t-s_l)n/2}v^{(l)}_nwn​=e−k(t−sl​)n/2vn(l)​. Its coordinates satisfy

wn=c (n+ll) (g)l(1−g)n vn+l(n∈N).w_n=c\,\sqrt{\binom{n+l}{l}}\,(\sqrt g)^l(\sqrt{1-g})^n\,v_{n+l}\qquad(n\in\mathbb N).wn​=c(ln+l​)​(g​)l(1−g​)nvn+l​(n∈N).

No normalization of vvv is assumed, and v=0v=0v=0 is included. Times may coincide and may equal either endpoint. The case l=0l=0l=0 is included: the time conditions are vacuous, c=1c=1c=1, and wn=e−ktn/2vnw_n=e^{-ktn/2}v_nwn​=e−ktn/2vn​.

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