Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Explicit Fock Chernoff optimizer and exponent

Open
QAlgorithms.Papers.Independent.Intakethird100.P54.fock_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 0<R0<R1<10<R_0<R_1<10<R0​<R1​<1, and let a Fock probe have total photon number K∈NK\in\mathbb NK∈N. Put Tb=1−RbT_b=1-R_bTb​=1−Rb​, f(s)=R0sR11−s+T0sT11−sf(s)=R_0^sR_1^{1-s}+T_0^sT_1^{1-s}f(s)=R0s​R11−s​+T0s​T11−s​, and

s∗=ln⁡[−R1ln⁡(R0/R1)/(T1ln⁡(T0/T1))]ln⁡[T0R1/(T1R0)].s_*=\frac{\ln[-R_1\ln(R_0/R_1)/(T_1\ln(T_0/T_1))]}{\ln[T_0R_1/(T_1R_0)]}.s∗​=ln[T0​R1​/(T1​R0​)]ln[−R1​ln(R0​/R1​)/(T1​ln(T0​/T1​))]​.

Then s∗∈[0,1]s_*\in[0,1]s∗​∈[0,1] minimizes fff, Qs=f(s)KQ_s=f(s)^KQs​=f(s)K, and

Q=f(s∗)K=e−ξNumK,Pe≤12f(s∗)K,ξNum=−ln⁡f(s∗).Q=f(s_*)^K=e^{-\xi_{\rm Num}K},\qquad P_e\le\frac12f(s_*)^K,\qquad\xi_{\rm Num}=-\ln f(s_*).Q=f(s∗​)K=e−ξNum​K,Pe​≤21​f(s∗​)K,ξNum​=−lnf(s∗​).

The per-photon gain is defined by G=ξNum/ξCSG=\xi_{\rm Num}/\xi_{\rm CS}G=ξNum​/ξCS​ with ξCS=(r1−r0)2\xi_{\rm CS}=(r_1-r_0)^2ξCS​=(r1​−r0​)2. It is not asserted to be large for all channels. At K=0K=0K=0, Q=1Q=1Q=1.

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

/-- Number-state Chernoff bound and derived optimizer, PDF p.8, (66)–(69).
The gain is a defined per-photon ratio, not a universal large-gain claim. -/
theorem fock_chernoff {M : ℕ} (hM : 0 < M) (c : Channels)
    (hc : ValidSplitters c) (hr : Reading c) (h0 : 0 < (c false).reflectance)
    (h1 : (c true).reflectance < 1) (n : Occupation (Fin M)) :
    fockOptimizer c ∈ Set.Icc (0 : ℝ) 1 ∧
    (∀ s ∈ Set.Icc (0 : ℝ) 1,
      outputChernoffAt c (fock n) s=(fockCoefficient c s)^photons n ∧
      fockCoefficient c (fockOptimizer c) ≤ fockCoefficient c s) ∧
    outputChernoff c (fock n)=(fockCoefficient c (fockOptimizer c))^photons n ∧
    outputError c (fock n) ≤ (fockCoefficient c (fockOptimizer c))^photons n/2 ∧
    (fockCoefficient c (fockOptimizer c))^photons n =
      Real.exp (-numberExponent c*(photons n : ℝ)) ∧
    exponentGain c=numberExponent c/coherentExponent c := 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. 8, fock-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 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​, 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, R0>0R_0>0R0​>0, and R1<1R_1<1R1​<1. Fix n∈NMn\in\mathbb N^Mn∈NM, set 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​ for k≤qk\le qk≤q, and 000 otherwise, and ρ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)​, where 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). 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)​, 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. Put

Cs(ρ0,ρ1)=sup⁡resolutions (pa,ua),(qb,vb)∑a,bfs(pa)f1−s(qb)∣⟨ua,vb⟩∣2,C(ρ0,ρ1)=inf⁡s∈[0,1]Cs(ρ0,ρ1),C_s(\rho_0,\rho_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, \qquad C(\rho_0,\rho_1)=\inf_{s\in[0,1]}C_s(\rho_0,\rho_1),Cs​(ρ0​,ρ1​)=resolutions (pa​,ua​),(qb​,vb​)sup​a,b∑​fs​(pa​)f1−s​(qb​)∣⟨ua​,vb​⟩∣2,C(ρ0​,ρ1​)=s∈[0,1]inf​Cs​(ρ0​,ρ1​),

where ft(0)=0f_t(0)=0ft​(0)=0 and ft(p)=ptf_t(p)=p^tft​(p)=pt otherwise. Define e(ρ0,ρ1)e(\rho_0,\rho_1)e(ρ0​,ρ1​) as the real infimum over these resolutions and bounded complex-linear EEE satisfying ⟨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, of 12∑apa(1−Re⁡⟨ua,Eua⟩)+12∑bqbRe⁡⟨vb,Evb⟩\frac12\sum_a p_a(1-\operatorname{Re}\langle u_a,Eu_a\rangle)+\frac12\sum_b q_b\operatorname{Re}\langle v_b,Ev_b\rangle21​∑a​pa​(1−Re⟨ua​,Eua​⟩)+21​∑b​qb​Re⟨vb​,Evb​⟩. The suprema and infima are real, with value 000 on empty defining sets; infinite sums have value 000 if not summable. Define the following real quantities, using real powers in fff:

f(s)=R0sR11−s+(1−R0)s(1−R1)1−s,s∗=log⁡ ⁣(−R1log⁡(R0/R1)(1−R1)log⁡((1−R0)/(1−R1)))log⁡ ⁣((1−R0)R1(1−R1)R0),ν=−log⁡f(s∗),d=(R1−R0)2.f(s)=R_0^sR_1^{1-s}+(1-R_0)^s(1-R_1)^{1-s}, \qquad s_*= \frac{ \log\!\left( \frac{-R_1\log(R_0/R_1)} {(1-R_1)\log((1-R_0)/(1-R_1))} \right)} {\log\!\left(\frac{(1-R_0)R_1}{(1-R_1)R_0}\right)}, \qquad \nu=-\log f(s_*), \qquad d=(\sqrt{R_1}-\sqrt{R_0})^2.f(s)=R0s​R11−s​+(1−R0​)s(1−R1​)1−s,s∗​=log((1−R1​)R0​(1−R0​)R1​​)log((1−R1​)log((1−R0​)/(1−R1​))−R1​log(R0​/R1​)​)​,ν=−logf(s∗​),d=(R1​​−R0​​)2.

The assertion is that s∗∈[0,1]s_*\in[0,1]s∗​∈[0,1], that every s∈[0,1]s\in[0,1]s∈[0,1] satisfies

Cs(ρ0,ρ1)=f(s)K,f(s∗)≤f(s),C_s(\rho_0,\rho_1)=f(s)^K, \qquad f(s_*)\le f(s),Cs​(ρ0​,ρ1​)=f(s)K,f(s∗​)≤f(s),

and that

C(ρ0,ρ1)=f(s∗)K,e(ρ0,ρ1)≤f(s∗)K2,f(s∗)K=e−νK.C(\rho_0,\rho_1)=f(s_*)^K,\qquad e(\rho_0,\rho_1)\le\frac{f(s_*)^K}{2},\qquad f(s_*)^K=e^{-\nu K}.C(ρ0​,ρ1​)=f(s∗​)K,e(ρ0​,ρ1​)≤2f(s∗​)K​,f(s∗​)K=e−νK.

It also asserts that the quantity named exponent gain, whose definition is the ratio of the number exponent ν\nuν to the coherent exponent ddd, equals ν/d\nu/dν/d. The occupation vector n=0n=0n=0 is allowed, so K=0K=0K=0 is included and the powers with exponent KKK then equal 111; no uniqueness of s∗s_*s∗​ is asserted.

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