Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Exact coherent-state error and Chernoff coefficient

Open
QAlgorithms.Papers.Independent.Intakethird100.P54.coherent_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​.

Let the signal coherent amplitudes be αm∈C\alpha_m\in\mathbb Cαm​∈C and the retained idler amplitudes be arbitrary. The full product coherent probe is normalized and has signal energy Ns=∑m∣αm∣2N_s=\sum_m|\alpha_m|^2Ns​=∑m​∣αm​∣2. Then

F=Q=e−(r1−r0)2Ns,Pe=1−1−e−(r1−r0)2Ns2≤12e−(r1−r0)2Ns.\mathcal F=Q=e^{-(r_1-r_0)^2N_s},\qquad P_e=\frac{1-\sqrt{1-e^{-(r_1-r_0)^2N_s}}}{2}\le\frac12e^{-(r_1-r_0)^2N_s}.F=Q=e−(r1​−r0​)2Ns​,Pe​=21−1−e−(r1​−r0​)2Ns​​​≤21​e−(r1​−r0​)2Ns​.

The result depends only on total signal energy, not its distribution among modes. The real field difference is appropriate because the channel phases are aligned.

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

/-- Coherent-state exact error, fidelity and Chernoff coefficient, PDF pp.7–8,
(61),(68), with multimode invariance from footnote [6], p.13. Section IV has
Delta=0; the real field-magnitude difference is therefore legitimate. -/
theorem coherent_error {M J : ℕ} (hM : 0 < M) (c : Channels)
    (hc : ValidSplitters c) (hr : Reading c) (beta : Fin J → ℂ) (alpha : Fin M → ℂ) :
    ‖coherentOpticalProbe beta alpha‖=1 ∧ HasSignalEnergy (coherentOpticalProbe beta alpha) (coherentEnergy alpha) ∧
    outputFidelity c (coherentOpticalProbe beta alpha) = Real.exp (-coherentExponent c * coherentEnergy alpha) ∧
    outputChernoff c (coherentOpticalProbe beta alpha) = Real.exp (-coherentExponent c * coherentEnergy alpha) ∧
    outputError c (coherentOpticalProbe beta alpha) =
      lowerError (Real.exp (-coherentExponent c * coherentEnergy alpha)) ∧
    outputError c (coherentOpticalProbe beta alpha) ≤ Real.exp (-coherentExponent c * coherentEnergy alpha)/2 := 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, coherent-error
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 specify 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​, and ϕ0=ϕ1=0\phi_0=\phi_1=0ϕ0​=ϕ1​=0. For arbitrary β∈CJ\beta\in\mathbb C^Jβ∈CJ and α∈CM\alpha\in\mathbb C^Mα∈CM, put Eα=∑m∣αm∣2E_\alpha=\sum_m|\alpha_m|^2Eα​=∑m​∣αm​∣2, d=(R1−R0)2d=(\sqrt{R_1}-\sqrt{R_0})^2d=(R1​​−R0​​)2, and 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!​. Define ψβ,α∈ℓ2(NJ×NM;C)\psi_{\beta,\alpha}\in\ell^2(\mathbb N^J\times\mathbb N^M;\mathbb C)ψβ,α​∈ℓ2(NJ×NM;C) from 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​) if this function is square summable, and as 000 otherwise. Set 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​ if k≤qk\le qk≤q, and 000 otherwise, and let Kb(x,y)=∑kzb,k(x)zb,k(y)‾K_b(x,y)=\sum_kz_{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_{\beta,\alpha}(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) to be 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 respective marginals ∑ez(x,e)z(y,e)‾\sum_ez(x,e)\overline{z(y,e)}∑e​z(x,e)z(y,e)​ and ∑ew(x,e)w(y,e)‾\sum_ew(x,e)\overline{w(y,e)}∑e​w(x,e)w(y,e)​ equal K,HK,HK,H. A resolution 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 of sum 111, unit vectors at positive weights, and orthogonality for distinct positive-weight vectors; zero-weight vectors are unrestricted. Define C(K,H)C(K,H)C(K,H) to be

inf⁡s∈[0,1]sup⁡resolutions (pa,ua),(qb,vb)∑a,bfs(pa)f1−s(qb)∣⟨ua,vb⟩∣2,\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,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. Define e(K,H)e(K,H)e(K,H) to be the infimum over these resolutions and bounded complex-linear operators AAA satisfying ⟨u,Av⟩=⟨v,Au⟩‾\langle u,Av\rangle=\overline{\langle v,Au\rangle}⟨u,Av⟩=⟨v,Au⟩​ and 0≤Re⁡⟨v,Av⟩≤∥v∥20\le\operatorname{Re}\langle v,Av\rangle\le\|v\|^20≤Re⟨v,Av⟩≤∥v∥2, of 12∑apa(1−Re⁡⟨ua,Aua⟩)+12∑bqbRe⁡⟨vb,Avb⟩\frac12\sum_a p_a(1-\operatorname{Re}\langle u_a,Au_a\rangle)+\frac12\sum_b q_b\operatorname{Re}\langle v_b,Av_b\rangle21​∑a​pa​(1−Re⟨ua​,Aua​⟩)+21​∑b​qb​Re⟨vb​,Avb​⟩. The extrema are real and have value 000 for empty defining sets; infinite sums have value 000 if not summable. The assertion is that ∥ψβ,α∥=1\|\psi_{\beta,\alpha}\|=1∥ψβ,α​∥=1, that Pn=∑q: ∑mqm=n∑i∣ψβ,α(i,q)∣2P_n=\sum_{q:\,\sum_mq_m=n}\sum_i|\psi_{\beta,\alpha}(i,q)|^2Pn​=∑q:∑m​qm​=n​∑i​∣ψβ,α​(i,q)∣2 has n↦nPnn\mapsto nP_nn↦nPn​ summable with ∑nnPn=Eα\sum_n nP_n=E_\alpha∑n​nPn​=Eα​ and Eα≥0E_\alpha\ge0Eα​≥0, and that

F(K0,K1)=e−dEα,C(K0,K1)=e−dEα,e(K0,K1)=1−1−e−dEα2≤e−dEα2.F(K_0,K_1)=e^{-dE_\alpha}, \qquad C(K_0,K_1)=e^{-dE_\alpha}, \qquad e(K_0,K_1)=\frac{1-\sqrt{1-e^{-dE_\alpha}}}{2} \le\frac{e^{-dE_\alpha}}2.F(K0​,K1​)=e−dEα​,C(K0​,K1​)=e−dEα​,e(K0​,K1​)=21−1−e−dEα​​​≤2e−dEα​​.

No positivity assumption is made on EαE_\alphaEα​; α=0\alpha=0α=0, J=0J=0J=0, and reflectance endpoints are included, with empty products equal to 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