Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Exact Fock target-detection error

Open
QAlgorithms.Papers.Independent.Intakethird100.P54.fock_target_error

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

prove2quantum

Let M≥1M\ge1M≥1 be the finite number of signal modes and J≥0J\ge0J≥0 the finite number of retained idler modes, on the full optical Fock spaces. The two channels have equal priors, independent vacuum environments, reflectances 0≤R0≤R1≤10\le R_0\le R_1\le10≤R0​≤R1​≤1, field magnitudes rb=Rbr_b=\sqrt{R_b}rb​=Rb​​ and tb=1−Rbt_b=\sqrt{1-R_b}tb​=1−Rb​​, and distinct complex reflection coefficients rbeiθbr_b e^{i\theta_b}rb​eiθb​. Every signal mode sees the same channel; idlers are retained losslessly and environment outputs are inaccessible. Write F\mathcal FF for squared Uhlmann fidelity, PeP_ePe​ for minimum average error over all joint binary receivers, Qs=Tr⁡(ρ0sρ11−s)Q_s=\operatorname{Tr}(\rho_0^s\rho_1^{1-s})Qs​=Tr(ρ0s​ρ11−s​), and Q=min⁡0≤s≤1QsQ=\min_{0\le s\le1}Q_sQ=min0≤s≤1​Qs​, with zero powers interpreted as support projections. Here the common phase is removed, so θ0=θ1=0\theta_0=\theta_1=0θ0​=θ1​=0 and R0<R1R_0<R_1R0​<R1​. Put μ=r0r1+t0t1\mu=r_0r_1+t_0t_1μ=r0​r1​+t0​t1​.

Assume R0=0R_0=0R0​=0. For any multimode Fock occupation with total signal photon number KKK,

Pe=12(1−R1)K.P_e=\frac12(1-R_1)^K.Pe​=21​(1−R1​)K.

Photon counting with decision 'present' exactly when the total returned count is positive attains this error. At K=0K=0K=0 it always declares absence and has error 1/21/21/2; at R1=1R_1=1R1​=1 and K>0K>0K>0 the error is zero.

This gives an exact endpoint rule without a logarithmic threshold.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P54
Formal statement
noncomputable section

open scoped BigOperators ComplexConjugate

open MeasureTheory Filter

namespace QAlgorithms.Papers.Independent.Intakethird100.P54

open QAlgorithms.RealRegisters (Hilbert)

open QAlgorithms.Papers.Independent.Claimed50.P47 (Occupation)

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

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

/-- Exact Fock target-detection error and attaining count>0 rule, PDF p.9, (70).
K=0 is a tie with opticalError 1/2; the endpoint R1=1 is included. -/
theorem fock_target_error {M : ℕ} (hM : 0 < M) (c : Channels)
    (hc : ValidSplitters c) (hr : Reading c) (h0 : (c false).reflectance=0)
    (n : Occupation (Fin M)) :
    outputError c (fock n)=(1-(c true).reflectance)^photons n/2 ∧
    ∃ E, IsOpticalEffect E ∧ CountsAs E (fun q => decide (0 < photons q)) ∧
      sectorRisk c (fock n) E (1/2) (1/2)=outputError c (fock n) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P54

end
Source
Discriminating quantum-optical beam-splitter channels with number-diagonal signal states: Applications to quantum reading and target detection, arXiv:1105.4063v3, PDF p. 9, fock-target-error
Read-back

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

Let M>0M>0M>0 be a natural number, and let ccc give two splitters with reflectances Rb∈[0,1]R_b\in[0,1]Rb​∈[0,1] and phases ϕb\phi_bϕb​, satisfying R0≤R1R_0\le R_1R0​≤R1​, unequal fields R0eiϕ0≠R1eiϕ1\sqrt{R_0}e^{i\phi_0}\ne\sqrt{R_1}e^{i\phi_1}R0​​eiϕ0​=R1​​eiϕ1​, ϕ0=ϕ1=0\phi_0=\phi_1=0ϕ0​=ϕ1​=0, and R0=0R_0=0R0​=0. Fix n∈NMn\in\mathbb N^Mn∈NM, let K=∑mnmK=\sum_mn_mK=∑m​nm​, and let ∣n⟩|n\rangle∣n⟩ be the unit coordinate vector at (0,n)(0,n)(0,n) in ℓ2(N0×NM;C)\ell^2(\mathbb N^0\times\mathbb N^M;\mathbb C)ℓ2(N0×NM;C). Define ab(q,k)=∏m(qmkm)(Rb)qm−km(1−Rb)kma_b(q,k)=\prod_m\sqrt{\binom{q_m}{k_m}}(\sqrt{R_b})^{q_m-k_m}(\sqrt{1-R_b})^{k_m}ab​(q,k)=∏m​(km​qm​​)​(Rb​​)qm​−km​(1−Rb​​)km​ when k≤qk\le qk≤q, and 000 otherwise; set zb,k(i,q)=∣n⟩(i,q+k)ab(q+k,k)z_{b,k}(i,q)=|n\rangle(i,q+k)a_b(q+k,k)zb,k​(i,q)=∣n⟩(i,q+k)ab​(q+k,k), ρb(x,y)=∑kzb,k(x)zb,k(y)‾\rho_b(x,y)=\sum_kz_{b,k}(x)\overline{z_{b,k}(y)}ρb​(x,y)=∑k​zb,k​(x)zb,k​(y)​, and let sb,ks_{b,k}sb,k​ be zb,kz_{b,k}zb,k​ as an ℓ2\ell^2ℓ2 vector if square summable, and 000 otherwise. A resolution of a kernel HHH is H(x,y)=∑apaua(x)ua(y)‾H(x,y)=\sum_a p_a u_a(x)\overline{u_a(y)}H(x,y)=∑a​pa​ua​(x)ua​(y)​, where the weights are nonnegative and summable with sum 111, each vector with positive weight is unit, and distinct positive-weight vectors are orthogonal; zero-weight vectors are unrestricted. An effect is a bounded complex-linear operator EEE with ⟨u,Ev⟩=⟨v,Eu⟩‾\langle u,Ev\rangle=\overline{\langle v,Eu\rangle}⟨u,Ev⟩=⟨v,Eu⟩​ and 0≤Re⁡⟨v,Ev⟩≤∥v∥20\le\operatorname{Re}\langle v,Ev\rangle\le\|v\|^20≤Re⟨v,Ev⟩≤∥v∥2. Let e(ρ0,ρ1)e(\rho_0,\rho_1)e(ρ0​,ρ1​) be the real infimum, over resolutions (pa,ua),(qa,va)(p_a,u_a),(q_a,v_a)(pa​,ua​),(qa​,va​) and effects, of 12∑apa(1−Re⁡⟨ua,Eua⟩)+12∑aqaRe⁡⟨va,Eva⟩\frac12\sum_a p_a(1-\operatorname{Re}\langle u_a,Eu_a\rangle)+\frac12\sum_a q_a\operatorname{Re}\langle v_a,Ev_a\rangle21​∑a​pa​(1−Re⟨ua​,Eua​⟩)+21​∑a​qa​Re⟨va​,Eva​⟩, with empty defining set assigned value 000. Then

e(ρ0,ρ1)=(1−R1)K2,e(\rho_0,\rho_1)=\frac{(1-R_1)^K}{2},e(ρ0​,ρ1​)=2(1−R1​)K​,

and there exists an effect EEE such that every vector vvv satisfies (Ev)(i,q)=0(Ev)(i,q)=0(Ev)(i,q)=0 when ∑mqm>0\sum_mq_m>0∑m​qm​>0, and (Ev)(i,q)=v(i,q)(Ev)(i,q)=v(i,q)(Ev)(i,q)=v(i,q) otherwise, and such that

12∑k(∥s0,k∥2−Re⁡⟨s0,k,Es0,k⟩)+12∑kRe⁡⟨s1,k,Es1,k⟩=e(ρ0,ρ1).\frac12\sum_k\left(\|s_{0,k}\|^2-\operatorname{Re}\langle s_{0,k},Es_{0,k}\rangle\right) +\frac12\sum_k\operatorname{Re}\langle s_{1,k},Es_{1,k}\rangle =e(\rho_0,\rho_1).21​k∑​(∥s0,k​∥2−Re⟨s0,k​,Es0,k​⟩)+21​k∑​Re⟨s1,k​,Es1,k​⟩=e(ρ0​,ρ1​).

The case n=0n=0n=0, hence K=0K=0K=0, and the endpoint R1=1R_1=1R1​=1 are included, with 00=10^0=100=1; infinite sums have value 000 if not summable.

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