Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Signal-energy bound on the Chernoff exponent

Open
QAlgorithms.Papers.Independent.Intakethird100.P54.chernoff_exponent

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 additionally R1<1R_1<1R1​<1, and let a normalized pure probe have finite mean signal energy NsN_sNs​. Then 0<μ<10<\mu<10<μ<1 and Q(ψ)>0Q(\psi)>0Q(ψ)>0. With natural logarithms and ξ=−ln⁡Q(ψ)\xi=-\ln Q(\psi)ξ=−lnQ(ψ),

ξ≤−2Nsln⁡μ=ln⁡(μ−2Ns).\xi\le-2N_s\ln\mu=\ln\bigl(\mu^{-2N_s}\bigr).ξ≤−2Ns​lnμ=ln(μ−2Ns​).

For each positive integer LLL, the normalized experiment consisting of LLL independent copies also satisfies

Pe(ψ⊗L)≥14μ2NsL.P_e(\psi^{\otimes L})\ge\frac14\mu^{2N_sL}.Pe​(ψ⊗L)≥41​μ2Ns​L.

These bounds control copy asymptotics; the identification of ξ\xiξ with the limiting optimal-error exponent is cited background, equation (55), rather than a new theorem of this paper.

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

/-- Chernoff exponent and finite-copy bound, PDF p.7, (56)–(57).
Natural logarithms are used; R1<1 excludes a log-zero/infinite-exponent endpoint.
The identification with the asymptotic opticalError exponent (55) is cited background [18]. -/
theorem chernoff_exponent {M J : ℕ} (hM : 0 < M) (c : Channels)
    (hc : ValidSplitters c) (hr : Reading c) (hloss : (c true).reflectance < 1)
    (psi : Hilbert (Occupation (Fin J) × Occupation (Fin M))) (hpsi : ‖psi‖=1)
    (N : ℝ) (hN : HasSignalEnergy psi N) :
    0 < splitterOverlap c ∧ splitterOverlap c < 1 ∧ 0 < outputChernoff c psi ∧
    -Real.log (outputChernoff c psi) ≤ -2*N*Real.log (splitterOverlap c) ∧
    ∀ L : ℕ, 0 < L → ‖opticalCopies psi L‖=1 ∧
      Real.rpow (splitterOverlap c) (2*N*(L : ℝ))/4 ≤ outputError c (opticalCopies psi L) := 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, chernoff-exponent
Read-back

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

Let M,J∈NM,J\in\mathbb NM,J∈N with M>0M>0M>0, and let the two splitters ccc have reflectances Rb∈[0,1]R_b\in[0,1]Rb​∈[0,1], phases ϕb\phi_bϕb​, 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​, and ϕ0=ϕ1=0\phi_0=\phi_1=0ϕ0​=ϕ1​=0; additionally assume R1<1R_1<1R1​<1. Put rb=Rbr_b=\sqrt{R_b}rb​=Rb​​, tb=1−Rbt_b=\sqrt{1-R_b}tb​=1−Rb​​, and o=r0r1+t0t1o=r_0r_1+t_0t_1o=r0​r1​+t0​t1​. Let ψ∈ℓ2(NJ×NM;C)\psi\in\ell^2(\mathbb N^J\times\mathbb N^M;\mathbb C)ψ∈ℓ2(NJ×NM;C) have norm 111, and let N∈RN\in\mathbb RN∈R be nonnegative with n↦nPnn\mapsto nP_nn↦nPn​ summable and ∑nnPn=N\sum_n nP_n=N∑n​nPn​=N, where Pn=∑q: ∑mqm=n∑i∣ψ(i,q)∣2P_n=\sum_{q:\,\sum_mq_m=n}\sum_i|\psi(i,q)|^2Pn​=∑q:∑m​qm​=n​∑i​∣ψ(i,q)∣2. For any probe χ\chiχ with mmm signal modes, define ab(q,k)=∏ℓ=1m(qℓkℓ)rbqℓ−kℓtbkℓa_b(q,k)=\prod_{\ell=1}^m\sqrt{\binom{q_\ell}{k_\ell}}r_b^{q_\ell-k_\ell}t_b^{k_\ell}ab​(q,k)=∏ℓ=1m​(kℓ​qℓ​​)​rbqℓ​−kℓ​​tbkℓ​​ if k≤qk\le qk≤q coordinatewise, and 000 otherwise; its returned kernels are Kbχ(x,y)=∑kzb,kχ(x)zb,kχ(y)‾K_b^\chi(x,y)=\sum_k z_{b,k}^\chi(x)\overline{z_{b,k}^\chi(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}^\chi(i,q)=\chi(i,q+k)a_b(q+k,k)zb,kχ​(i,q)=χ(i,q+k)ab​(q+k,k). A resolution of a kernel KKK means 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 ua∈ℓ2u_a\in\ell^2ua​∈ℓ2, nonnegative summable pap_apa​, ∑apa=1\sum_a p_a=1∑a​pa​=1, unit uau_aua​ for positive weights, and orthogonality between distinct vectors having positive weights; zero-weight vectors are unrestricted. For two kernels define

Cs(K0,K1)=sup⁡(pa,ua) resolves K0$qb,vb) resolves K1∑(a,b)∈N2fs(pa)f1−s(qb)∣⟨ua,vb⟩∣2,C(K0,K1)=inf⁡0≤s≤1Cs(K0,K1),C_s(K_0,K_1)= \sup_{\substack{(p_a,u_a)\text{ resolves }K_0\$q_b,v_b)\text{ resolves }K_1}} \sum_{(a,b)\in\mathbb N^2} f_s(p_a)f_{1-s}(q_b)|\langle u_a,v_b\rangle|^2, \qquad C(K_0,K_1)=\inf_{0\le s\le1}C_s(K_0,K_1),Cs​(K0​,K1​)=(pa​,ua​) resolves K0​$qb​,vb​) resolves K1​​sup​(a,b)∈N2∑​fs​(pa​)f1−s​(qb​)∣⟨ua​,vb​⟩∣2,C(K0​,K1​)=0≤s≤1inf​Cs​(K0​,K1​),

where (f_t(p)=0whenwhenwhenp=0andandandf_t(p)=p^t,therealpower,otherwise;thuszeroweightscontribute, the real power, otherwise; thus zero weights contribute ,therealpower,otherwise;thuszeroweightscontribute0evenwhentheexponentiseven when the exponent isevenwhentheexponentis0.Define. Define .Definee(K_0,K_1)astheinfimumovertheseresolutionsandboundedcomplex−lineareffectsas the infimum over these resolutions and bounded complex-linear effectsastheinfimumovertheseresolutionsandboundedcomplex−lineareffectsE,satisfying, satisfying ,satisfying\langle u,Ev\rangle=\overline{\langle v,Eu\rangle}andandand0\le\operatorname{Re}\langle v,Ev\rangle\le|v|^2,of, of ,of\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\rangle.Thesearerealsupremaandinfima,withvalue. These are real suprema and infima, with value .Thesearerealsupremaandinfima,withvalue0onemptydefiningsets;infinitesumshavevalueon empty defining sets; infinite sums have valueonemptydefiningsets;infinitesumshavevalue0$ if not summable. Then

0<o<1,0<C(K0ψ,K1ψ),−log⁡C(K0ψ,K1ψ)≤−2Nlog⁡o.0<o<1,\qquad 0<C(K_0^\psi,K_1^\psi),\qquad -\log C(K_0^\psi,K_1^\psi)\le-2N\log o.0<o<1,0<C(K0ψ​,K1ψ​),−logC(K0ψ​,K1ψ​)≤−2Nlogo.

Moreover, for every natural number L>0L>0L>0, form the coefficient function

gL(i,q)=∏ℓ=0L−1ψ(iℓ,(qℓM+m)m=0M−1),i∈(NJ)L,q∈NLM,g_L(i,q)=\prod_{\ell=0}^{L-1}\psi\bigl(i_\ell,(q_{\ell M+m})_{m=0}^{M-1}\bigr), \quad i\in(\mathbb N^J)^L,\quad q\in\mathbb N^{LM},gL​(i,q)=ℓ=0∏L−1​ψ(iℓ​,(qℓM+m​)m=0M−1​),i∈(NJ)L,q∈NLM,

and let ψ[L]\psi^{[L]}ψ[L] be this function as an ℓ2\ell^2ℓ2 vector if it is square summable, and the zero vector otherwise. The assertion also gives

∥ψ[L]∥=1,o 2NL4≤e(K0ψ[L],K1ψ[L]).\|\psi^{[L]}\|=1, \qquad \frac{o^{\,2NL}}4\le e(K_0^{\psi^{[L]}},K_1^{\psi^{[L]}}).∥ψ[L]∥=1,4o2NL​≤e(K0ψ[L]​,K1ψ[L]​).

The statement allows J=0J=0J=0, N=0N=0N=0, and R0=0R_0=0R0​=0, but its conclusion about copies is only for L>0L>0L>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