Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

pp.2,4: returned SPDC pair is classical and separable in bright noise

Open
QAlgorithms.Papers.Independent.Intakenext100.P85.return_idler_separable

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

prove2quantum

Let NS≥0N_S\ge0NS​≥0, 0<κ<10<\kappa<10<κ<1, and NB≥κN_B\ge\kappaNB​≥κ. Use the actual SPDC return–idler states of the thermal-loss/replacement experiment, with bath mean NB/(1−κ)N_B/(1-\kappa)NB​/(1−κ) under target presence and perfectly retained idler. Under both hypotheses,

ρRI(h) has a positive P representation and is separable across R:I,h∈{0,1}.\rho_{RI}^{(h)}\text{ has a positive P representation and is separable across }R:I,\qquad h\in\{0,1\}.ρRI(h)​ has a positive P representation and is separable across R:I,h∈{0,1}.

A positive P representation is a coherent-projector mixture under a Borel probability measure; singular measures are allowed at NB=κN_B=\kappaNB​=κ. Separability is the trace-norm closed convex hull of product densities on the complete oscillator spaces. This is a statement about the returned SPDC pair, not every channel input.

Formalization Note The p.4 phrase naming signal and return is corrected to return and idler, consistently with p.2, the covariance matrices and the abstract; independent moderation is required.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P85
Formal statement
noncomputable section

open MeasureTheory Filter

open scoped BigOperators ENNReal Topology

attribute [local instance] Classical.propDecidable Classical.decEq

namespace QAlgorithms.Papers.Independent.Intakenext100.P85

open QAlgorithms.Papers.Independent.Claimed50.P19 (Cov)

open QAlgorithms.Papers.Independent.Renew46.P41 (coherentProductCoefficient)

/-- Source p.2 and p.4: the actual return/idler pair is positive-P and
separable when NB>=k. Printed p.4 says S_m,R_m; changed to R_m,I_m
because p.2, (3)–(4) and the abstract specify this pair. Singular positive
measures are allowed at equality. This correction requires independent review. -/
theorem return_idler_separable (k NS NB : ℝ) (hk : 0 < k) (hk1 : k < 1)
    (hNS : 0 ≤ NS) (hNB : k ≤ NB) :
    ∀ present : Bool,
      PositiveP (qiReturn present k NS NB) ∧
      T.IsSeparable (pairArray (qiReturn present k NS NB)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P85

end
Source
Quantum Illumination with Gaussian States, arXiv:0810.0534v1, PDF p. 2, pp.2,4: returned SPDC pair is classical and separable in bright noise
Read-back

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

For every real 0<k<10<k<10<k<1, NS≥0N_S\ge0NS​≥0, and NB≥kN_B\ge kNB​≥k, both the absent and present returned kernels defined here have a positive coherent-state representation and are separable after identifying the two occupation registers with N×N\mathbb N\times\mathbb NN×N. Specifically, let vvv be the chosen vector in ℓ2(N2;C)\ell^2(\mathbb N^2;\mathbb C)ℓ2(N2;C) with vm,a=1m=aNSm/(NS+1)m+1v_{m,a}=\mathbf1_{m=a}\sqrt{N_S^m/(N_S+1)^{m+1}}vm,a​=1m=a​NSm​/(NS​+1)m+1​, or zero if unrealizable, and set Amna,b=vm,avn,b‾A^{a,b}_{mn}=v_{m,a}\overline{v_{n,b}}Amna,b​=vm,a​vn,b​​. For a one-mode kernel AAA, let R(A)R(A)R(A) be a chosen bounded operator with matrix AAA, or zero if none exists, and write wt(h)=(t/(t+1))h/(t+1)w_t(h)=(t/(t+1))^h/(t+1)wt​(h)=(t/(t+1))h/(t+1). With

βη(m,ℓ;p,q)=1m+ℓ=p+qm!ℓ!p!q!∑0≤r≤pr≤m, m−r≤q(pr)(qm−r)(η)r+q−(m−r)(−1−η)p−r(1−η)m−r,\beta_\eta(m,\ell;p,q)= \mathbf1_{m+\ell=p+q} \sqrt{\frac{m!\ell!}{p!q!}} \sum_{\substack{0\le r\le p\\r\le m,\ m-r\le q}} \binom pr\binom q{m-r} (\sqrt\eta)^{r+q-(m-r)} (-\sqrt{1-\eta})^{p-r}(\sqrt{1-\eta})^{m-r},βη​(m,ℓ;p,q)=1m+ℓ=p+q​p!q!m!ℓ!​​0≤r≤pr≤m, m−r≤q​∑​(rp​)(m−rq​)(η​)r+q−(m−r)(−1−η​)p−r(1−η​)m−r,

define

L0(A)mn=1m=nwNB(m)∑aAaa,L1(A)mn=∑(h,ℓ)∈N2h≤m+ℓ, h≤n+ℓwNB/(1−k)(h) βk(m,ℓ;m+ℓ−h,h) βk(n,ℓ;n+ℓ−h,h) R(A)m+ℓ−h,n+ℓ−h,L_0(A)_{mn}=\mathbf1_{m=n}w_{N_B}(m)\sum_a A_{aa},\qquad L_1(A)_{mn}= \sum_{\substack{(h,\ell)\in\mathbb N^2\\h\le m+\ell,\ h\le n+\ell}} w_{N_B/(1-k)}(h)\, \beta_k(m,\ell;m+\ell-h,h)\, \beta_k(n,\ell;n+\ell-h,h)\, R(A)_{m+\ell-h,n+\ell-h},L0​(A)mn​=1m=n​wNB​​(m)a∑​Aaa​,L1​(A)mn​=(h,ℓ)∈N2h≤m+ℓ, h≤n+ℓ​∑​wNB​/(1−k)​(h)βk​(m,ℓ;m+ℓ−h,h)βk​(n,ℓ;n+ℓ−h,h)R(A)m+ℓ−h,n+ℓ−h​,

and Y(m,a),(n,b)(p)=Lp(Aa,b)mnY^{(p)}_{(m,a),(n,b)}=L_p(A^{a,b})_{mn}Y(m,a),(n,b)(p)​=Lp​(Aa,b)mn​. Infinite sums here have their total-function meanings. For each p=0,1p=0,1p=0,1, the positive coherent-state assertion means that Y(p)Y^{(p)}Y(p) is a density kernel and there is a probability measure μp\mu_pμp​ on C2\mathbb C^2C2 for which all the following entry integrands are integrable and

Yij(p)=∫cα(i)cα(j)‾ dμp(α),cα(j)=∏r=01e−∣αr∣2/2αrjrjr!.Y^{(p)}_{ij}=\int c_\alpha(i)\overline{c_\alpha(j)}\,d\mu_p(\alpha), \qquad c_\alpha(j)=\prod_{r=0}^1e^{-|\alpha_r|^2/2}\frac{\alpha_r^{j_r}}{\sqrt{j_r!}}.Yij(p)​=∫cα​(i)cα​(j)​dμp​(α),cα​(j)=r=0∏1​e−∣αr​∣2/2jr​!​αrjr​​​.

A density kernel here has an expansion Zij=∑rur(i)wr(j)‾Z_{ij}=\sum_r u_r(i)\overline{w_r(j)}Zij​=∑r​ur​(i)wr​(j)​ with ∑r∥ur∥∥wr∥<∞\sum_r\|u_r\|\|w_r\|<\infty∑r​∥ur​∥∥wr​∥<∞, has real nonnegative finite quadratic forms, and has summable real diagonal of sum one. The separability assertion means that, for every ϵ>0\epsilon>0ϵ>0, there is a finite convex mixture Z=∑r=1qprAr⊗BrZ=\sum_{r=1}^q p_r A_r\otimes B_rZ=∑r=1q​pr​Ar​⊗Br​ of one-mode density kernels, with pr≥0p_r\ge0pr​≥0 and ∑rpr=1\sum_rp_r=1∑r​pr​=1, such that

ν(Y(p)−Z)<ϵ,ν(D)=inf⁡{∑r∥ur∥∥wr∥:Dij=∑rur(i)wr(j)‾, ∑r∥ur∥∥wr∥<∞}.\nu(Y^{(p)}-Z)<\epsilon, \qquad \nu(D)=\inf\left\{\sum_r\|u_r\|\|w_r\|: D_{ij}=\sum_r u_r(i)\overline{w_r(j)},\ \sum_r\|u_r\|\|w_r\|<\infty\right\}.ν(Y(p)−Z)<ϵ,ν(D)=inf{r∑​∥ur​∥∥wr​∥:Dij​=r∑​ur​(i)wr​(j)​, r∑​∥ur​∥∥wr​∥<∞}.

This infimum is in [0,∞][0,\infty][0,∞], with value +∞+\infty+∞ if there is no such expansion. The assumptions include NS=0N_S=0NS​=0 and NB=kN_B=kNB​=k; since k>0k>0k>0, they exclude NB=0N_B=0NB​=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