Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eqs.(1)–(2): SPDC number state and Wigner covariance

Open
QAlgorithms.Papers.Independent.Intakenext100.P85.spdc_state

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

prove2quantum

Let NS≥0N_S\ge0NS​≥0. On the complete two-mode oscillator space, define

∣ψNS⟩=∑n=0∞NSn(NS+1)n+1∣n,n⟩.|\psi_{N_S}\rangle=\sum_{n=0}^{\infty}\sqrt{\frac{N_S^n}{(N_S+1)^{n+1}}}|n,n\rangle.∣ψNS​​⟩=n=0∑∞​(NS​+1)n+1NSn​​​∣n,n⟩.

This vector has norm one, and each marginal has finite mean photon number NSN_SNS​. Its pure density is a zero-mean Gaussian state. With interleaved quadratures (qS,pS,qI,pI)(q_S,p_S,q_I,p_I)(qS​,pS​,qI​,pI​), q=(a+a†)/2q=(a+a^\dagger)/2q=(a+a†)/2, p=(a−a†)/(2i)p=(a-a^\dagger)/(2i)p=(a−a†)/(2i), its covariance is

ΛSI=14(S0Cq00S0−CqCq0S00−Cq0S),S=2NS+1,Cq=2NS(NS+1).\Lambda_{SI}=\frac14\begin{pmatrix}S&0&C_q&0\\0&S&0&-C_q\\C_q&0&S&0\\0&-C_q&0&S\end{pmatrix},\qquad S=2N_S+1,\quad C_q=2\sqrt{N_S(N_S+1)}.ΛSI​=41​​S0Cq​0​0S0−Cq​​Cq​0S0​0−Cq​0S​​,S=2NS​+1,Cq​=2NS​(NS​+1)​.

For NS>0N_S>0NS​>0 the signal and idler are entangled; at NS=0N_S=0NS​=0 the state is the two-mode vacuum. This identifies the actual illumination resource and its normalization.

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, Eqs.(1)–(2). The constructed number vector is normalized,
has marginal energy NS and the displayed zero-mean Gaussian covariance.
Only NS>0 implies entanglement; NS=0 is retained as vacuum. -/
theorem spdc_state (NS : ℝ) (hNS : 0 ≤ NS) (W : G.FockWeylSystem 2) :
    (∀ j, spdcVector NS j = spdcCoefficient NS j) ∧
    ‖spdcVector NS‖ = 1 ∧ T.IsDensity (spdcArray NS) ∧
    SourceGaussian W (spdcArray NS) 0 (spdcCov NS) ∧
    (∀ k : Fin 2, Summable (fun j : Occ 2 => (j k : ℝ) * (spdcArray NS j j).re) ∧
      marginalPhotonNumber (spdcArray NS) k = NS) ∧
    (0 < NS → ¬ T.IsSeparable (pairArray (spdcArray NS))) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P85

end
Source
Quantum Illumination with Gaussian States, arXiv:0810.0534v1, PDF p. 2, Eqs.(1)–(2): SPDC number state and Wigner covariance
Read-back

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

For every real NS≥0N_S\ge0NS​≥0 and every Weyl system WWW specified below, let H=ℓ2(N2;C)\mathcal H=\ell^2(\mathbb N^2;\mathbb C)H=ℓ2(N2;C), with occupation basis eje_jej​, and define

cj={NSj0/(NS+1)j0+1,j0=j1,0,j0≠j1.c_j=\begin{cases} \sqrt{N_S^{j_0}/(N_S+1)^{j_0+1}},&j_0=j_1,\\ 0,&j_0\ne j_1. \end{cases}cj​={NSj0​​/(NS​+1)j0​+1​,0,​j0​=j1​,j0​=j1​.​

Let vvv be the chosen vector with coordinates cjc_jcj​, or zero if no such vector exists, and put Xij=vivj‾X_{ij}=v_i\overline{v_j}Xij​=vi​vj​​. The assertion is that vj=cjv_j=c_jvj​=cj​ for every occupation jjj, ∥v∥=1\|v\|=1∥v∥=1, and XXX is a density kernel: it admits an expansion Xij=∑rur(i)wr(j)‾X_{ij}=\sum_r u_r(i)\overline{w_r(j)}Xij​=∑r​ur​(i)wr​(j)​, where ur,wr∈Hu_r,w_r\in\mathcal Hur​,wr​∈H and ∑r∥ur∥∥wr∥<∞\sum_r\|u_r\|\|w_r\|<\infty∑r​∥ur​∥∥wr​∥<∞; every finite quadratic form ∑i,j∈Fzi‾Xijzj\sum_{i,j\in F}\overline{z_i}X_{ij}z_j∑i,j∈F​zi​​Xij​zj​ is real and nonnegative; and its real diagonal is summable with sum one. More specifically, write R(X)R(X)R(X) for a chosen bounded operator having matrix XXX, or zero if none exists, and set

S=2NS+1,Q=2NS(NS+1),V=14(S0Q00S0−QQ0S00−Q0S)S=2N_S+1,\qquad Q=2\sqrt{N_S(N_S+1)},\qquad V=\frac14 \begin{pmatrix} S&0&Q&0\\ 0&S&0&-Q\\ Q&0&S&0\\ 0&-Q&0&S \end{pmatrix}S=2NS​+1,Q=2NS​(NS​+1)​,V=41​​S0Q0​0S0−Q​Q0S0​0−Q0S​​

in coordinate order (0,0),(0,1),(1,0),(1,1)(0,0),(0,1),(1,0),(1,1)(0,0),(0,1),(1,0),(1,1). Then R(X)R(X)R(X) has matrix XXX, is self-adjoint and positive, admits a representation R(X)x=∑r⟨wr,x⟩urR(X)x=\sum_r\langle w_r,x\rangle u_rR(X)x=∑r​⟨wr​,x⟩ur​ with summable products of vector norms, and has summable occupation-basis diagonal of trace one. Also 4V4V4V is symmetric and positive definite, 4V+iΩ4V+i\Omega4V+iΩ is positive semidefinite, and, for every ξ∈R4\xi\in\mathbb R^4ξ∈R4, the occupation-basis diagonal of R(X)W(ξ)R(X)W(\xi)R(X)W(ξ) is summable and

tr⁡(R(X)W(ξ))=exp⁡(−2ξTVξ),Ω=diag⁡ ⁣((01−10),(01−10)).\operatorname{tr}(R(X)W(\xi))=\exp(-2\xi^{\mathsf T}V\xi), \qquad \Omega=\operatorname{diag}\!\left( \begin{pmatrix}0&1\\-1&0\end{pmatrix}, \begin{pmatrix}0&1\\-1&0\end{pmatrix}\right).tr(R(X)W(ξ))=exp(−2ξTVξ),Ω=diag((0−1​10​),(0−1​10​)).

Here W(ξ)W(\xi)W(ξ) is assumed unitary for every ξ\xiξ, with occupation-basis entries ∏r=01dirjr(−ξr,1+iξr,0)\prod_{r=0}^1 d_{i_rj_r}(-\xi_{r,1}+i\xi_{r,0})∏r=01​dir​jr​​(−ξr,1​+iξr,0​), where

dmn(z)=e−∣z∣2/2m! n!∑h=0min⁡(m,n)zm−h(−z‾)n−hh!(m−h)!(n−h)!.d_{mn}(z)=e^{-|z|^2/2}\sqrt{m!\,n!} \sum_{h=0}^{\min(m,n)} \frac{z^{m-h}(-\overline z)^{n-h}}{h!(m-h)!(n-h)!}.dmn​(z)=e−∣z∣2/2m!n!​h=0∑min(m,n)​h!(m−h)!(n−h)!zm−h(−z)n−h​.

For each mode r=0,1r=0,1r=0,1, the sequence jrRe⁡Xjjj_r\operatorname{Re}X_{jj}jr​ReXjj​ is summable and its sum is NSN_SNS​. Finally, if NS>0N_S>0NS​>0, the reindexed kernel X(m,a),(n,b)X_{(m,a),(n,b)}X(m,a),(n,b)​ is not separable: it cannot be approximated, to every positive accuracy, by finite convex mixtures of product density kernels in the size

ν(Z)=inf⁡{∑r∥ur∥∥wr∥:Zij=∑rur(i)wr(j)‾, ∑r∥ur∥∥wr∥<∞},\nu(Z)=\inf\left\{\sum_r\|u_r\|\|w_r\|: Z_{ij}=\sum_r u_r(i)\overline{w_r(j)},\ \sum_r\|u_r\|\|w_r\|<\infty\right\},ν(Z)=inf{r∑​∥ur​∥∥wr​∥:Zij​=r∑​ur​(i)wr​(j)​, r∑​∥ur​∥∥wr​∥<∞},

where the infimum is in [0,∞][0,\infty][0,∞] and is +∞+\infty+∞ when no expansion exists. The case NS=0N_S=0NS​=0 is included in all preceding assertions, but the nonseparability conclusion is conditional on strict positivity.

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