Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Zero-background target envelopes and fixed-energy high-loss limit

Open
QAlgorithms.Papers.Independent.Intakethird100.P54.target_detection_no_go

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 fix a finite Ns≥0N_s\ge0Ns​≥0. For R=R1R=R_1R=R1​, define

L(R,Ns)=1−1−(1−R)Ns2,C(R,Ns)=1−1−e−RNs2.L(R,N_s)=\frac{1-\sqrt{1-(1-R)^{N_s}}}{2},\qquad C(R,N_s)=\frac{1-\sqrt{1-e^{-RN_s}}}{2}.L(R,Ns​)=21−1−(1−R)Ns​​​,C(R,Ns​)=21−1−e−RNs​​​.

Every normalized pure joint probe of signal energy NsN_sNs​ has error at least L(R1,Ns)L(R_1,N_s)L(R1​,Ns​). Every product coherent probe with that signal energy, with arbitrary pure coherent idlers, has exact error C(R1,Ns)C(R_1,N_s)C(R1​,Ns​). For each fixed NsN_sNs​,

lim⁡R↓0(C(R,Ns)−L(R,Ns))=0,lim⁡R↓0−ln⁡(1−R)R=1.\lim_{R\downarrow0}\bigl(C(R,N_s)-L(R,N_s)\bigr)=0,\qquad\lim_{R\downarrow0}\frac{-\ln(1-R)}R=1.R↓0lim​(C(R,Ns​)−L(R,Ns​))=0,R↓0lim​R−ln(1−R)​=1.

These precise envelopes express the paper's high-loss comparison without a tolerance for 'appreciable' or a uniform relative-error claim at unbounded energy. The background environment is vacuum.

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 zero-background target envelopes and their fixed-energy high-loss limit,
PDF p.7, (59)–(60). The prose 'appreciable' is given no invented uniform tolerance. -/
theorem target_detection_no_go {M J : ℕ} (hM : 0 < M) (c : Channels)
    (hc : ValidSplitters c) (hr : Reading c) (habsent : (c false).reflectance=0)
    (N : ℝ) (hN : 0 ≤ N) :
    (∀ psi : Hilbert (Occupation (Fin J) × Occupation (Fin M)), ‖psi‖=1 → HasSignalEnergy psi N →
      targetLower (c true).reflectance N ≤ outputError c psi) ∧
    (∀ (beta : Fin J → ℂ) (alpha : Fin M → ℂ), coherentEnergy alpha=N →
      outputError c (coherentOpticalProbe beta alpha) = targetCoherent (c true).reflectance N) ∧
    Tendsto (fun R : ℝ => targetCoherent R N - targetLower R N)
      (nhdsWithin 0 (Set.Ioi 0)) (nhds 0) ∧
    Tendsto (fun R : ℝ => -Real.log (1-R)/R)
      (nhdsWithin 0 (Set.Ioi 0)) (nhds 1) := 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, target-detection-no-go
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 ccc be two splitters with reflectances Rb∈[0,1]R_b\in[0,1]Rb​∈[0,1] and phases ϕb\phi_bϕb​, such that R0≤R1R_0\le R_1R0​≤R1​, their fields R0eiϕ0\sqrt{R_0}e^{i\phi_0}R0​​eiϕ0​ and R1eiϕ1\sqrt{R_1}e^{i\phi_1}R1​​eiϕ1​ differ, ϕ0=ϕ1=0\phi_0=\phi_1=0ϕ0​=ϕ1​=0, and R0=0R_0=0R0​=0. Let N∈RN\in\mathbb RN∈R satisfy N≥0N\ge0N≥0. For any probe χ∈ℓ2(NJ×NM;C)\chi\in\ell^2(\mathbb N^J\times\mathbb N^M;\mathbb C)χ∈ℓ2(NJ×NM;C), put 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 coordinatewise and 000 otherwise, and define its returned kernel by Kbχ(x,y)=∑kχ(xi,xs+k)ab(xs+k,k)χ(yi,ys+k)ab(ys+k,k)‾K_b^\chi(x,y)=\sum_k\chi(x_{\mathrm i},x_{\mathrm s}+k)a_b(x_{\mathrm s}+k,k)\overline{\chi(y_{\mathrm i},y_{\mathrm s}+k)a_b(y_{\mathrm s}+k,k)}Kbχ​(x,y)=∑k​χ(xi​,xs​+k)ab​(xs​+k,k)χ(yi​,ys​+k)ab​(ys​+k,k)​. A resolution of a kernel on XXX is 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∈ℓ2(X;C)u_a\in\ell^2(X;\mathbb C)ua​∈ℓ2(X;C), nonnegative summable weights of sum 111, unit vectors at positive weights, and orthogonality for distinct positive-weight vectors; zero-weight vectors are unrestricted. Write e(K,H)e(K,H)e(K,H) for the real infimum over resolutions (pa,ua),(qa,va)(p_a,u_a),(q_a,v_a)(pa​,ua​),(qa​,va​) of K,HK,HK,H 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∑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​⟩; the empty defining set has infimum 000. First, for every norm-one ψ\psiψ such that 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 has n↦nPnn\mapsto nP_nn↦nPn​ summable and ∑nnPn=N\sum_n nP_n=N∑n​nPn​=N,

1− 1−(1−R1)N 2≤e(K0ψ,K1ψ).\frac{1-\sqrt{\,1-(1-R_1)^N\,}}2\le e(K_0^\psi,K_1^\psi).21−1−(1−R1​)N​​≤e(K0ψ​,K1ψ​).

Second, for every β∈CJ\beta\in\mathbb C^Jβ∈CJ and α∈CM\alpha\in\mathbb C^Mα∈CM with ∑m∣αm∣2=N\sum_m|\alpha_m|^2=N∑m​∣αm​∣2=N, define hz(n)=e−∣z∣2/2zn/n!h_z(n)=e^{-|z|^2/2}z^n/\sqrt{n!}hz​(n)=e−∣z∣2/2zn/n!​, and let ψβ,α\psi_{\beta,\alpha}ψβ,α​ be the coefficient function (i,q)↦∏jhβj(ij)∏mhαm(qm)(i,q)\mapsto\prod_jh_{\beta_j}(i_j)\prod_mh_{\alpha_m}(q_m)(i,q)↦∏j​hβj​​(ij​)∏m​hαm​​(qm​) as an ℓ2\ell^2ℓ2 vector if square summable, and 000 otherwise. Then

e(K0ψβ,α,K1ψβ,α)=1− 1−e−R1N 2.e(K_0^{\psi_{\beta,\alpha}},K_1^{\psi_{\beta,\alpha}}) =\frac{1-\sqrt{\,1-e^{-R_1N}\,}}2.e(K0ψβ,α​​,K1ψβ,α​​)=21−1−e−R1​N​​.

Finally, the following two right-hand limits hold:

lim⁡R→0+(1− 1−e−RN 2−1− 1−(1−R)N 2)=0,lim⁡R→0+−log⁡(1−R)R=1.\lim_{R\to0^+} \left(\frac{1-\sqrt{\,1-e^{-RN}\,}}2- \frac{1-\sqrt{\,1-(1-R)^N\,}}2\right)=0, \qquad \lim_{R\to0^+}\frac{-\log(1-R)}R=1.R→0+lim​(21−1−e−RN​​−21−1−(1−R)N​​)=0,R→0+lim​R−log(1−R)​=1.

Here real powers are used, the limits range over real R>0R>0R>0 approaching 000, and all infinite sums are total sums, equal to 000 if not summable. The statement permits J=0J=0J=0, N=0N=0N=0, and R1=1R_1=1R1​=1; in particular 00=10^0=100=1 in the real power.

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