Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Amplification after pure loss equals Gaussian displacement noise

Open
QAlgorithms.Papers.Independent.Intakenext100.P65.amplification_afterLoss

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

prove2quantum

Let 0<γ<10<\gamma<10<γ<1 and let ρ\rhoρ be any positive trace-one operator on the complete oscillator Hilbert space. Write Nγ(ρ)=∑ℓ≥0EℓρEℓ†\mathcal N_\gamma(\rho)=\sum_{\ell\ge0}E_\ell\rho E_\ell^\daggerNγ​(ρ)=∑ℓ≥0​Eℓ​ρEℓ†​, and construct the quantum-limited amplifier with Kraus operators 1−γEℓ†\sqrt{1-\gamma}E_\ell^\dagger1−γ​Eℓ†​. The resulting amplification-after-loss output is a positive trace-one operator, and each of its number-basis entries is given by an integrable displacement average:

ANγ(ρ)=1−γπγ∫Ce−(1−γ)∣α∣2/γDαρDα† d2α.\mathcal A\mathcal N_\gamma(\rho)=\frac{1-\gamma}{\pi\gamma}\int_{\mathbb C}e^{-(1-\gamma)|\alpha|^2/\gamma}D_\alpha\rho D_\alpha^\dagger\,d^2\alpha.ANγ​(ρ)=πγ1−γ​∫C​e−(1−γ)∣α∣2/γDα​ρDα†​d2α.

The added displacement variance is γ/(1−γ)\gamma/(1-\gamma)γ/(1−γ). Positivity is encoded by all finite principal compressions and the nonnegative summable diagonal has trace one; this characterizes positive trace-class kernels and imposes no cutoff. No Schrödinger channel is applied to the identity.

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.20 (7.21): exact composition, amplification AFTER loss, with the source
variance g/(1-g); full positive trace-class inputs, not the non-trace-class identity. -/
theorem amplification_afterLoss (g : ℝ) (hg0 : 0 < g) (hg1 : g < 1)
    (R : ℕ → ℕ → ℂ) (hR : fockDensity R) :
    fockDensity (amplifierChannel g (lossChannel g R)) ∧
    (∀ n m : ℕ, Integrable (fun z : ℂ => (amplifiedLossDensity g z : ℂ) * displaceDensity z R n m) ∧
      amplifierChannel g (lossChannel g R) n m =
        ∫ z : ℂ, (amplifiedLossDensity g z : ℂ) * displaceDensity z R n m) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P65

end
Source
Performance and structure of single-mode bosonic codes, arXiv:1708.05010v3, PDF p. 20, §VII B (7.20)–(7.21): amplification after loss
Read-back

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

For every real ggg with 0<g<10<g<10<g<1 and every complex array R:N×N→CR:\mathbb N\times\mathbb N\to\mathbb CR:N×N→C, suppose that every finite leading matrix (Rnm)0≤n,m<h(R_{nm})_{0\le n,m<h}(Rnm​)0≤n,m<h​, for every h∈Nh\in\mathbb Nh∈N including h=0h=0h=0, is positive semidefinite, that ∑nRe⁡Rnn\sum_n\operatorname{Re}R_{nn}∑n​ReRnn​ is summable, and that this sum equals 111. Define

cg(l,s)={(sl) (g)l(1−g)s−l,l≤s,0,l>s,(LgR)nm=∑l≥0cg(l,n+l)cg(l,m+l)Rn+l,m+l,c_g(l,s)= \begin{cases} \sqrt{\binom{s}{l}}\,(\sqrt g)^l(\sqrt{1-g})^{s-l},&l\le s,\\ 0,&l>s, \end{cases} \quad (\mathcal L_gR)_{nm} =\sum_{l\ge0}c_g(l,n+l)c_g(l,m+l)R_{n+l,m+l},cg​(l,s)={(ls​)​(g​)l(1−g​)s−l,0,​l≤s,l>s,​(Lg​R)nm​=l≥0∑​cg​(l,n+l)cg​(l,m+l)Rn+l,m+l​, (AgR)nm=∑l=0min⁡(n,m)(1−g)cg(l,n)cg(l,m)Rn−l,m−l,Dz(a,b)=e−∣z∣2/2a! b!∑h=0min⁡(a,b)za−h(−z‾)b−h(a−h)! (b−h)! h!,(\mathcal A_gR)_{nm} =\sum_{l=0}^{\min(n,m)} (1-g)c_g(l,n)c_g(l,m)R_{n-l,m-l}, \quad D_z(a,b)=e^{-|z|^2/2}\sqrt{a!\,b!} \sum_{h=0}^{\min(a,b)} \frac{z^{a-h}(-\overline z)^{b-h}}{(a-h)!\,(b-h)!\,h!},(Ag​R)nm​=l=0∑min(n,m)​(1−g)cg​(l,n)cg​(l,m)Rn−l,m−l​,Dz​(a,b)=e−∣z∣2/2a!b!​h=0∑min(a,b)​(a−h)!(b−h)!h!za−h(−z)b−h​, (DzR)nm=∑j≥0(∑k≥0Dz(n,j)RjkDz(m,k)‾),wg(z)=1−gπge−(1−g)∣z∣2/g.(\mathcal D_zR)_{nm} =\sum_{j\ge0}\left(\sum_{k\ge0}D_z(n,j)R_{jk}\overline{D_z(m,k)}\right), \qquad w_g(z)=\frac{1-g}{\pi g}e^{-(1-g)|z|^2/g}.(Dz​R)nm​=j≥0∑​(k≥0∑​Dz​(n,j)Rjk​Dz​(m,k)​),wg​(z)=πg1−g​e−(1−g)∣z∣2/g.

Then Ag(LgR)\mathcal A_g(\mathcal L_gR)Ag​(Lg​R) has the same three density properties: all its finite leading matrices are positive semidefinite, its real diagonal is summable, and its diagonal sum is 111. Moreover, for every n,m∈Nn,m\in\mathbb Nn,m∈N, the complex function z↦wg(z)(DzR)nmz\mapsto w_g(z)(\mathcal D_zR)_{nm}z↦wg​(z)(Dz​R)nm​ is integrable with respect to Lebesgue measure on C\mathbb CC, and

(Ag(LgR))nm=∫Cwg(z)(DzR)nm dz.\bigl(\mathcal A_g(\mathcal L_gR)\bigr)_{nm} =\int_{\mathbb C}w_g(z)(\mathcal D_zR)_{nm}\,dz.(Ag​(Lg​R))nm​=∫C​wg​(z)(Dz​R)nm​dz.

The infinite sums in these definitions use the convention that a nonsummable family has sum zero.

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