Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

II.C: coherent interference outputs and dark monitoring port

Open
QAlgorithms.Papers.Independent.Intakethird100.P33.monitoringInterference

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let μ≥0\mu\ge0μ≥0 and t,tB∈[0,1]t,t_B\in[0,1]t,tB​∈[0,1], and put x=μt(1−tB)x=\mu t(1-t_B)x=μt(1−tB​) and a=xa=\sqrt{x}a=x​. The two consecutive monitoring inputs have coherent amplitudes b,c∈{0,a}b,c\in\{0,a\}b,c∈{0,a}, with equal phase whenever both are occupied. The balanced one-bin-delay interferometer produces, at their common interference slot, normalized coherent output modes with amplitudes

β1=i(b+c)/2,β2=(−b+c)/2.\beta_1=i(b+c)/2,\qquad\beta_2=(-b+c)/2.β1​=i(b+c)/2,β2​=(−b+c)/2.

Port rrr has mean photon number ∣βr∣2|\beta_r|^2∣βr​∣2 and ideal dark-count-free threshold-click probability 1−e−∣βr∣21-e^{-|\beta_r|^2}1−e−∣βr​∣2. When b=c=ab=c=ab=c=a, the output is ∣ia,0⟩|ia,0\rangle∣ia,0⟩, with mean intensities x,0x,0x,0 and zero click probability in the second port. This applies both within a decoy and across a 1,0 source-bit boundary. With exactly one occupied input, each selected-time output has mean intensity x/4x/4x/4 and the two click probabilities are equal. The all-vacuum case is included.

This is the optical coherence test; a nonempty input does not force a detection.

Formalization Note The source's single-input prose says x/2x/2x/2 per port. The displayed amplitude equations and endnote [6] instead give x/4x/4x/4, which is used here. Independent moderation of this disclosed correction remains required.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P33
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P33

open scoped BigOperators ENNReal

open QAlgorithms.RealRegisters (Hilbert)

open QAlgorithms.Papers.Independent.Dependency50.P33 (IsDensity rankOne)

open QAlgorithms.Papers.Independent.Dependency50.P39 (coherentCoefficient)

open QAlgorithms.Papers.Independent.Support50.P48 (vacuumAmplitude)

open QAlgorithms.Papers.Independent.Next46.P32 (FockPOVM realFockTracePair)

open QAlgorithms.Papers.Independent.Dependency50.P34
  (TwoModeFock fockKet photonMean)

open QAlgorithms.Papers.Independent.Frontier18.P14
  (coherentPair coherentPairCoefficients)

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

/-- PDF p.2, (6)-(7), and p.7 endnote [6]: exact coherent interference.
Printed prose gives single-input intensity x/2; changed to x/4, as both the
amplitude equations and endnote [6] require. This correction needs independent
moderation. Equal-input DM2 is vacuum; no assertion forces DM1 to click. -/
theorem monitoringInterference (mu t tB : ℝ) (hmu : 0 ≤ mu)
    (ht : t ∈ Set.Icc 0 1) (htB : tB ∈ Set.Icc 0 1) :
    let x := mu * t * (1 - tB)
    let a : ℂ := Real.sqrt x
    (∀ u v : Bool,
      let b := if u then a else 0
      let c := if v then a else 0
      let out := monitoringOutput b c
      ‖out‖ = 1 ∧
      (∀ nm, out nm = coherentPairCoefficients
        (Complex.I * (b + c) / 2) ((-b + c) / 2) nm) ∧
      (∀ port : Fin 2, Summable (fun nm : ℕ × ℕ =>
        ((if port = 0 then nm.1 else nm.2 : ℕ) : ℝ) * Complex.normSq (out nm))) ∧
      photonMean out 0 = Complex.normSq (Complex.I * (b + c) / 2) ∧
      photonMean out 1 = Complex.normSq ((-b + c) / 2) ∧
      opticalClick out 0 = 1 - Real.exp (-Complex.normSq (Complex.I * (b + c) / 2)) ∧
      opticalClick out 1 = 1 - Real.exp (-Complex.normSq ((-b + c) / 2))) ∧
    monitoringOutput a a = coherentPair (Complex.I * a) 0 ∧
    photonMean (monitoringOutput a a) 0 = x ∧
    photonMean (monitoringOutput a a) 1 = 0 ∧
    opticalClick (monitoringOutput a a) 1 = 0 ∧
    (∀ out ∈ ({monitoringOutput a 0, monitoringOutput 0 a} : Set TwoModeFock),
      photonMean out 0 = x / 4 ∧ photonMean out 1 = x / 4 ∧
      opticalClick out 0 = opticalClick out 1) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P33

end
Source
Towards practical and fast Quantum Cryptography, arXiv:quant-ph/0411022v1, PDF p. 2, II.C, (6)–(7)
Read-back

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

For all real μ,t,tB\mu,t,t_Bμ,t,tB​ with μ≥0\mu\ge0μ≥0 and t,tB∈[0,1]t,t_B\in[0,1]t,tB​∈[0,1], put x=μt(1−tB)x=\mu t(1-t_B)x=μt(1−tB​) and a=xa=\sqrt{x}a=x​, regarded as complex. Define cz(r)=e−∣z∣2/2zr/r!c_z(r)=e^{-|z|^2/2}z^r/\sqrt{r!}cz​(r)=e−∣z∣2/2zr/r!​; a coherent pair Γ(z,w)\Gamma(z,w)Γ(z,w) is the vector in ℓ2(N2;C)\ell^2(\mathbb N^2;\mathbb C)ℓ2(N2;C) with coefficients cz(m)cw(n)c_z(m)c_w(n)cz​(m)cw​(n) if this family is square summable, and zero otherwise. Put V(b,c)=Γ(i(b+c)/2,(−b+c)/2)V(b,c)=\Gamma(i(b+c)/2,(-b+c)/2)V(b,c)=Γ(i(b+c)/2,(−b+c)/2). For every pair of Booleans u,vu,vu,v, let b=ab=ab=a if uuu is true and zero otherwise, and c=ac=ac=a if vvv is true and zero otherwise. Then V(b,c)V(b,c)V(b,c) has norm one and, for every (m,n)(m,n)(m,n), has coefficient ci(b+c)/2(m)c(−b+c)/2(n)c_{i(b+c)/2}(m)c_{(-b+c)/2}(n)ci(b+c)/2​(m)c(−b+c)/2​(n). For each port r∈{0,1}r\in\{0,1\}r∈{0,1}, writing N0(m,n)=mN_0(m,n)=mN0​(m,n)=m and N1(m,n)=nN_1(m,n)=nN1​(m,n)=n, the family Nr(m,n)∣V(b,c)m,n∣2N_r(m,n)|V(b,c)_{m,n}|^2Nr​(m,n)∣V(b,c)m,n​∣2 is summable, and the means Pr(V)=∑m,nNr(m,n)∣Vm,n∣2P_r(V)=\sum_{m,n}N_r(m,n)|V_{m,n}|^2Pr​(V)=∑m,n​Nr​(m,n)∣Vm,n​∣2 and click quantities Qr(V)=∑m,n:Nr(m,n)>0∣Vm,n∣2Q_r(V)=\sum_{m,n:N_r(m,n)>0}|V_{m,n}|^2Qr​(V)=∑m,n:Nr​(m,n)>0​∣Vm,n​∣2 satisfy

P0(V(b,c))=∣i(b+c)2∣2,P1(V(b,c))=∣−b+c2∣2,Q0(V(b,c))=1−e−∣i(b+c)/2∣2,Q1(V(b,c))=1−e−∣(−b+c)/2∣2.P_0(V(b,c))=\left|\frac{i(b+c)}2\right|^2,\quad P_1(V(b,c))=\left|\frac{-b+c}2\right|^2,\quad Q_0(V(b,c))=1-e^{-|i(b+c)/2|^2},\quad Q_1(V(b,c))=1-e^{-|(-b+c)/2|^2}.P0​(V(b,c))=​2i(b+c)​​2,P1​(V(b,c))=​2−b+c​​2,Q0​(V(b,c))=1−e−∣i(b+c)/2∣2,Q1​(V(b,c))=1−e−∣(−b+c)/2∣2.

In addition, V(a,a)=Γ(ia,0)V(a,a)=\Gamma(ia,0)V(a,a)=Γ(ia,0), P0(V(a,a))=xP_0(V(a,a))=xP0​(V(a,a))=x, P1(V(a,a))=0P_1(V(a,a))=0P1​(V(a,a))=0, and Q1(V(a,a))=0Q_1(V(a,a))=0Q1​(V(a,a))=0. Every vector belonging to the set {V(a,0),V(0,a)}\{V(a,0),V(0,a)\}{V(a,0),V(0,a)} has both port means equal to x/4x/4x/4 and equal click quantities at the two ports. These assertions include x=0x=0x=0.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me