Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Fock Chernoff optimality in Type I target detection

Open
QAlgorithms.Papers.Independent.Intakethird100.P54.type_I_chernoff

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 and restrict to normalized pure signal-only probes, so there are no retained idlers entangled with the signals. The absent-target return is vacuum and Q(ψ)=F(ψ)Q(\psi)=\mathcal F(\psi)Q(ψ)=F(ψ). For a Fock occupation N\mathbf NN with total KKK,

Q(∣N⟩)=(1−R1)K≤Q(ψ)Q(|\mathbf N\rangle)=(1-R_1)^K\le Q(\psi)Q(∣N⟩)=(1−R1​)K≤Q(ψ)

for every such pure signal-only competitor of mean signal energy KKK.

The restriction makes one returned state pure, which is essential to this Chernoff optimization claim.

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

/-- Type I target detection: pure SIGNAL-ONLY probes, PDF p.7.
The no-entangled-idler restriction is essential to the purity argument. -/
theorem type_I_chernoff {M : ℕ} (hM : 0 < M) (c : Channels)
    (hc : ValidSplitters c) (hr : Reading c) (habsent : (c false).reflectance=0) :
    (∀ psi : Hilbert (Occupation (Fin 0) × Occupation (Fin M)), ‖psi‖=1 →
      returned (c false) psi = opticalPureKernel (fock (0 : Occupation (Fin M))) ∧
      outputChernoff c psi=outputFidelity c psi) ∧
    (∀ n : Occupation (Fin M),
      outputChernoff c (fock n) = (1-(c true).reflectance)^photons n ∧
      ∀ psi : Hilbert (Occupation (Fin 0) × Occupation (Fin M)),
        ‖psi‖=1 → HasSignalEnergy psi (photons n : ℝ) →
          outputChernoff c (fock n) ≤ outputChernoff c psi) := 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. 7, type-I-chernoff
Read-back

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

Let M∈NM\in\mathbb NM∈N satisfy M>0M>0M>0, and let ccc consist of splitters with reflectances Rb∈[0,1]R_b\in[0,1]Rb​∈[0,1] and phases ϕb\phi_bϕb​, with 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. There are no idler modes: identify the singleton N0\mathbb N^0N0 with its unique element. For ψ∈ℓ2(N0×NM;C)\psi\in\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​ for k≤qk\le qk≤q, and 000 otherwise, and put Kbψ(x,y)=∑kzb,k(x)zb,k(y)‾K_b^\psi(x,y)=\sum_k z_{b,k}(x)\overline{z_{b,k}(y)}Kbψ​(x,y)=∑k​zb,k​(x)zb,k​(y)​, where zb,k(i,q)=ψ(i,q+k)ab(q+k,k)z_{b,k}(i,q)=\psi(i,q+k)a_b(q+k,k)zb,k​(i,q)=ψ(i,q+k)ab​(q+k,k). For kernels K,HK,HK,H on XXX, define F(K,H)F(K,H)F(K,H) as the real supremum of ∣⟨z,w⟩∣2|\langle z,w\rangle|^2∣⟨z,w⟩∣2 over norm-one z,w∈ℓ2(X×N;C)z,w\in\ell^2(X\times\mathbb N;\mathbb C)z,w∈ℓ2(X×N;C) whose marginals satisfy ∑ez(x,e)z(y,e)‾=K(x,y)\sum_ez(x,e)\overline{z(y,e)}=K(x,y)∑e​z(x,e)z(y,e)​=K(x,y) and ∑ew(x,e)w(y,e)‾=H(x,y)\sum_ew(x,e)\overline{w(y,e)}=H(x,y)∑e​w(x,e)w(y,e)​=H(x,y). A resolution of a kernel is a representation K(x,y)=∑apaua(x)ua(y)‾K(x,y)=\sum_a p_a u_a(x)\overline{u_a(y)}K(x,y)=∑a​pa​ua​(x)ua​(y)​, with nonnegative summable weights totaling 111, unit ℓ2\ell^2ℓ2 vectors at positive weights, and orthogonality between distinct positive-weight vectors; zero-weight vectors are unrestricted. Define

C(K,H)=inf⁡s∈[0,1]sup⁡resolutions (pa,ua),(qb,vb)∑a,bfs(pa)f1−s(qb)∣⟨ua,vb⟩∣2,C(K,H)=\inf_{s\in[0,1]} \sup_{\text{resolutions }(p_a,u_a),(q_b,v_b)} \sum_{a,b}f_s(p_a)f_{1-s}(q_b)|\langle u_a,v_b\rangle|^2,C(K,H)=s∈[0,1]inf​resolutions (pa​,ua​),(qb​,vb​)sup​a,b∑​fs​(pa​)f1−s​(qb​)∣⟨ua​,vb​⟩∣2,

where ft(0)=0f_t(0)=0ft​(0)=0 and ft(p)=ptf_t(p)=p^tft​(p)=pt otherwise. These extrema are real, with empty defining sets assigned value 000; infinite sums are total sums, equal to 000 if not summable. Writing ∣n⟩|n\rangle∣n⟩ for the unit coordinate vector at (0,n)(0,n)(0,n), the first assertion is that every norm-one ψ\psiψ, without an energy hypothesis, satisfies

K0ψ(x,y)=∣0⟩(x)∣0⟩(y)‾,C(K0ψ,K1ψ)=F(K0ψ,K1ψ).K_0^\psi(x,y)=|0\rangle(x)\overline{|0\rangle(y)}, \qquad C(K_0^\psi,K_1^\psi)=F(K_0^\psi,K_1^\psi).K0ψ​(x,y)=∣0⟩(x)∣0⟩(y)​,C(K0ψ​,K1ψ​)=F(K0ψ​,K1ψ​).

The second assertion is that every n∈NMn\in\mathbb N^Mn∈NM, with K=∑mnmK=\sum_mn_mK=∑m​nm​, satisfies

C(K0∣n⟩,K1∣n⟩)=(1−R1)K,C(K_0^{|n\rangle},K_1^{|n\rangle})=(1-R_1)^K,C(K0∣n⟩​,K1∣n⟩​)=(1−R1​)K,

and this is at most C(K0ψ,K1ψ)C(K_0^\psi,K_1^\psi)C(K0ψ​,K1ψ​) for every norm-one no-idler probe ψ\psiψ whose total-count law Pℓ=∑q: ∑mqm=ℓ∑i∈N0∣ψ(i,q)∣2P_\ell=\sum_{q:\,\sum_mq_m=\ell}\sum_{i\in\mathbb N^0}|\psi(i,q)|^2Pℓ​=∑q:∑m​qm​=ℓ​∑i∈N0​∣ψ(i,q)∣2 has ℓ↦ℓPℓ\ell\mapsto\ell P_\ellℓ↦ℓPℓ​ summable and ∑ℓℓPℓ=K\sum_\ell\ell P_\ell=K∑ℓ​ℓPℓ​=K. The occupation vector n=0n=0n=0 and the endpoint R1=1R_1=1R1​=1 are included; all zeroth powers, including 000^000, equal 111.

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