Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

NDS exact discrimination and optimal loss-sector receiver

Open
QAlgorithms.Papers.Independent.Intakethird100.P54.nds_discrimination

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.

Let the normalized pure probe be NDS: its signal marginal is diagonal in the multimode occupation basis. For each lost occupation string k\mathbf kk, let vb,kv_{b,\mathbf k}vb,k​ be the unnormalized retained vector constructed by the vacuum splitter, pb,k=∥vb,k∥2p_{b,\mathbf k}=\|v_{b,\mathbf k}\|^2pb,k​=∥vb,k​∥2, Ik=⟨v0,k,v1,k⟩I_{\mathbf k}=\langle v_{0,\mathbf k},v_{1,\mathbf k}\rangleIk​=⟨v0,k​,v1,k​⟩, and Hk=span⁡{v0,k,v1,k}H_{\mathbf k}=\operatorname{span}\{v_{0,\mathbf k},v_{1,\mathbf k}\}Hk​=span{v0,k​,v1,k​}. These blocks are mutually orthogonal and have dimension at most two. Moreover pb,k=∑npn∣An;k(b)∣2p_{b,\mathbf k}=\sum_{\mathbf n}p_{\mathbf n}|A_{\mathbf n;\mathbf k}^{(b)}|^2pb,k​=∑n​pn​∣An;k(b)​∣2, with a convergent sum and A=0A=0A=0 unless k≤n\mathbf k\le\mathbf nk≤n componentwise. Then ∣Ik∣2≤p0,kp1,k|I_{\mathbf k}|^2\le p_{0,\mathbf k}p_{1,\mathbf k}∣Ik​∣2≤p0,k​p1,k​, and the convergent exact-error formula is

Pe=12−14∑k(p0,k+p1,k)2−4∣Ik∣2.P_e=\frac12-\frac14\sum_{\mathbf k}\sqrt{(p_{0,\mathbf k}+p_{1,\mathbf k})^2-4|I_{\mathbf k}|^2}.Pe​=21​−41​k∑​(p0,k​+p1,k​)2−4∣Ik​∣2​.

An attaining projective receiver first resolves the orthogonal loss blocks and then decides zero on the positive spectrum of ∣v0,k⟩⟨v0,k∣−∣v1,k⟩⟨v1,k∣|v_{0,\mathbf k}\rangle\langle v_{0,\mathbf k}|-|v_{1,\mathbf k}\rangle\langle v_{1,\mathbf k}|∣v0,k​⟩⟨v0,k​∣−∣v1,k​⟩⟨v1,k​∣ and one on its negative spectrum. Zero eigenspaces admit arbitrary projective ties; the complement of all blocks has probability zero. For priors πb≥0\pi_b\ge0πb​≥0 with π0+π1=1\pi_0+\pi_1=1π0​+π1​=1, the same blocks support the weighted spectral receiver and Pe=(1−∥π0ρ0−π1ρ1∥1)/2P_e=(1-\|\pi_0\rho_0-\pi_1\rho_1\|_1)/2Pe​=(1−∥π0​ρ0​−π1​ρ1​∥1​)/2.

The block receiver specifies an abstract optimum even in degenerate sectors, without dividing by a zero sector probability.

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 NDS discrimination and an attaining complete block receiver, PDF pp.4–5,
(25)–(42), and [22], p.13. Blocks have dimension AT MOST two; zero eigenvalues
are assigned arbitrary projective ties, correcting the source's degenerate-block prose. -/
theorem nds_discrimination {M J : ℕ} (hM : 0 < M) (c : Channels) (hc : ValidSplitters c)
    (psi : Hilbert (Occupation (Fin J) × Occupation (Fin M))) (hpsi : ‖psi‖ = 1)
    (hnds : IsNDS psi) :
    (∀ k, Module.Finite ℂ (lossBlock c psi k) ∧
      Module.finrank ℂ (lossBlock c psi k) ≤ 2) ∧
    (∀ k l, k ≠ l → ∀ u ∈ lossBlock c psi k, ∀ v ∈ lossBlock c psi l,
      inner ℂ u v = 0) ∧
    (∀ b k, Summable (fun n => signalLaw psi n * Complex.normSq (lossAmplitude (c b) n k)) ∧
      lossProbability c psi b k = ∑' n, signalLaw psi n * Complex.normSq (lossAmplitude (c b) n k)) ∧
    (∀ k, Complex.normSq (lossOverlap c psi k) ≤
      lossProbability c psi false k * lossProbability c psi true k) ∧
    Summable (fun k => Real.sqrt ((lossProbability c psi false k +
      lossProbability c psi true k)^2 - 4*Complex.normSq (lossOverlap c psi k))) ∧
    outputError c psi = 1/2 - (1/4) * ∑' k,
      Real.sqrt ((lossProbability c psi false k + lossProbability c psi true k)^2 -
        4*Complex.normSq (lossOverlap c psi k)) ∧
    (∃ E, BlockReceiver c psi 1 1 E ∧
      sectorRisk c psi E (1/2) (1/2) = outputError c psi) ∧
    (∀ v : Hilbert (Occupation (Fin J) × Occupation (Fin M)),
      (∀ k, ∀ w ∈ lossBlock c psi k, inner ℂ w v = 0) →
      ∀ b, (∑' k, Complex.normSq (inner ℂ (lossSector (c b) psi k) v)) = 0) ∧
    (∀ pi0 pi1 : ℝ, 0 ≤ pi0 → 0 ≤ pi1 → pi0+pi1=1 →
      bayesError (returned (c false) psi) (returned (c true) psi) pi0 pi1 =
        (1-weightedTraceNorm (returned (c false) psi) (returned (c true) psi) pi0 pi1)/2 ∧
      ∃ E, BlockReceiver c psi pi0 pi1 E ∧
        sectorRisk c psi E pi0 pi1 =
          bayesError (returned (c false) psi) (returned (c true) psi) pi0 pi1) := 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. 5, nds-discrimination
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, allowing J=0J=0J=0, and let ψ∈H=ℓ2(NJ×NM;C)\psi\in H=\ell^2(\mathbb N^J\times\mathbb N^M;\mathbb C)ψ∈H=ℓ2(NJ×NM;C) have norm 111. Let two splitters have reflectances Rb∈[0,1]R_b\in[0,1]Rb​∈[0,1], phases θb∈R\theta_b\in\mathbb Rθb​∈R, rb=Rbr_b=\sqrt{R_b}rb​=Rb​​, and tb=1−Rbt_b=\sqrt{1-R_b}tb​=1−Rb​​, with R0≤R1R_0\le R_1R0​≤R1​ and r0eiθ0≠r1eiθ1r_0e^{i\theta_0}\ne r_1e^{i\theta_1}r0​eiθ0​=r1​eiθ1​. Assume that

∑iψ(i,n)ψ(i,q)‾=0whenever n,q∈NM, n≠q.\sum_i\psi(i,n)\overline{\psi(i,q)}=0 \quad\text{whenever }n,q\in\mathbb N^M,\ n\ne q.i∑​ψ(i,n)ψ(i,q)​=0whenever n,q∈NM, n=q.

Define pn=∑i∣ψ(i,n)∣2p_n=\sum_i|\psi(i,n)|^2pn​=∑i​∣ψ(i,n)∣2 and Lb(n,k)=∏m(nmkm)einmθbrbnm−kmtbkmL_b(n,k)=\prod_m\sqrt{\binom{n_m}{k_m}}e^{in_m\theta_b}r_b^{n_m-k_m}t_b^{k_m}Lb​(n,k)=∏m​(km​nm​​)​einm​θb​rbnm​−km​​tbkm​​ when k≤nk\le nk≤n componentwise, and Lb(n,k)=0L_b(n,k)=0Lb​(n,k)=0 otherwise. Put gb,k(i,p)=ψ(i,p+k)Lb(p+k,k)g_{b,k}(i,p)=\psi(i,p+k)L_b(p+k,k)gb,k​(i,p)=ψ(i,p+k)Lb​(p+k,k), let vb,k∈Hv_{b,k}\in Hvb,k​∈H be this function if it is square-summable and the zero vector otherwise, and put

ρb(x,y)=∑kgb,k(x)gb,k(y)‾,Pb,k=∥vb,k∥2,Ck=⟨v0,k,v1,k⟩,Hk=span⁡C{v0,k,v1,k}.\rho_b(x,y)=\sum_k g_{b,k}(x)\overline{g_{b,k}(y)},\quad P_{b,k}=\|v_{b,k}\|^2,\quad C_k=\langle v_{0,k},v_{1,k}\rangle,\quad H_k=\operatorname{span}_{\mathbb C}\{v_{0,k},v_{1,k}\}.ρb​(x,y)=k∑​gb,k​(x)gb,k​(y)​,Pb,k​=∥vb,k​∥2,Ck​=⟨v0,k​,v1,k​⟩,Hk​=spanC​{v0,k​,v1,k​}.

For clarity, a resolution (an,un)(a_n,u_n)(an​,un​) of a kernel KKK means summable weights an≥0a_n\ge0an​≥0 of sum 111, vectors un∈Hu_n\in Hun​∈H that are unit whenever an>0a_n>0an​>0 and mutually orthogonal at distinct positive weights, and K(x,y)=∑nanun(x)un(y)‾K(x,y)=\sum_n a_nu_n(x)\overline{u_n(y)}K(x,y)=∑n​an​un​(x)un​(y)​; zero-weight vectors are unrestricted. An effect is a bounded complex-linear E:H→HE:H\to HE:H→H with ⟨u,Ev⟩=⟨v,Eu⟩‾\langle u,Ev\rangle=\overline{\langle v,Eu\rangle}⟨u,Ev⟩=⟨v,Eu⟩​ and 0≤qE(v)≤∥v∥20\le q_E(v)\le\|v\|^20≤qE​(v)≤∥v∥2, where qE(v)=Re⁡⟨v,Ev⟩q_E(v)=\operatorname{Re}\langle v,Ev\rangleqE​(v)=Re⟨v,Ev⟩. Define

B(π0,π1)=inf⁡(a,u),(b,w),E[π0∑nan(1−qE(un))+π1∑nbnqE(wn)],B(\pi_0,\pi_1)= \inf_{(a,u),(b,w),E} \left[\pi_0\sum_n a_n(1-q_E(u_n)) +\pi_1\sum_n b_nq_E(w_n)\right],B(π0​,π1​)=(a,u),(b,w),Einf​[π0​n∑​an​(1−qE​(un​))+π1​n∑​bn​qE​(wn​)],

using resolutions of ρ0,ρ1\rho_0,\rho_1ρ0​,ρ1​ and effects EEE, and define

W(w0,w1)=sup⁡(a,u),(b,w),T[w0∑nanqT(un)−w1∑nbnqT(wn)],W(w_0,w_1)= \sup_{(a,u),(b,w),T} \left[w_0\sum_n a_nq_T(u_n)-w_1\sum_n b_nq_T(w_n)\right],W(w0​,w1​)=(a,u),(b,w),Tsup​[w0​n∑​an​qT​(un​)−w1​n∑​bn​qT​(wn​)],

where TTT is bounded and complex linear, satisfies the same self-adjointness identity, and satisfies ∣qT(v)∣≤∥v∥2|q_T(v)|\le\|v\|^2∣qT​(v)∣≤∥v∥2 for every vvv. These are total real infima and suprema, with value 000 on empty defining sets. Set Eout=B(1/2,1/2)E_{\mathrm{out}}=B(1/2,1/2)Eout​=B(1/2,1/2). A block receiver with weights w0,w1w_0,w_1w0​,w1​ means an effect EEE with E2=EE^2=EE2=E, preserving every HkH_kHk​, such that, whenever v∈Hkv\in H_kv∈Hk​ and

w0⟨v0,k,v⟩v0,k−w1⟨v1,k,v⟩v1,k=av(a∈R),w_0\langle v_{0,k},v\rangle v_{0,k} -w_1\langle v_{1,k},v\rangle v_{1,k}=a v \quad(a\in\mathbb R),w0​⟨v0,k​,v⟩v0,k​−w1​⟨v1,k​,v⟩v1,k​=av(a∈R),

one has Ev=vEv=vEv=v if a>0a>0a>0 and Ev=0Ev=0Ev=0 if a<0a<0a<0; this condition prescribes neither choice when a=0a=0a=0. Define its sector risk by

SE(π0,π1)=π0∑k(P0,k−qE(v0,k))+π1∑kqE(v1,k).S_E(\pi_0,\pi_1)= \pi_0\sum_k\bigl(P_{0,k}-q_E(v_{0,k})\bigr) +\pi_1\sum_k q_E(v_{1,k}).SE​(π0​,π1​)=π0​k∑​(P0,k​−qE​(v0,k​))+π1​k∑​qE​(v1,k​).

The theorem asserts that every HkH_kHk​ is finite-dimensional with complex dimension at most 222, including dimensions 000 and 111; different HkH_kHk​ are orthogonal; for every b,kb,kb,k, the sequence n↦pn∣Lb(n,k)∣2n\mapsto p_n|L_b(n,k)|^2n↦pn​∣Lb​(n,k)∣2 is summable and Pb,k=∑npn∣Lb(n,k)∣2P_{b,k}=\sum_n p_n|L_b(n,k)|^2Pb,k​=∑n​pn​∣Lb​(n,k)∣2; and ∣Ck∣2≤P0,kP1,k|C_k|^2\le P_{0,k}P_{1,k}∣Ck​∣2≤P0,k​P1,k​ for every kkk. It further asserts that k↦(P0,k+P1,k)2−4∣Ck∣2k\mapsto\sqrt{(P_{0,k}+P_{1,k})^2-4|C_k|^2}k↦(P0,k​+P1,k​)2−4∣Ck​∣2​ is summable and

Eout=12−14∑k(P0,k+P1,k)2−4∣Ck∣2,E_{\mathrm{out}} =\frac12-\frac14\sum_k\sqrt{(P_{0,k}+P_{1,k})^2-4|C_k|^2},Eout​=21​−41​k∑​(P0,k​+P1,k​)2−4∣Ck​∣2​,

that some block receiver with weights 1,11,11,1 satisfies SE(1/2,1/2)=EoutS_E(1/2,1/2)=E_{\mathrm{out}}SE​(1/2,1/2)=Eout​, and that every v∈Hv\in Hv∈H orthogonal to every HkH_kHk​ satisfies ∑k∣⟨vb,k,v⟩∣2=0\sum_k|\langle v_{b,k},v\rangle|^2=0∑k​∣⟨vb,k​,v⟩∣2=0 for each bbb. Finally, for every π0,π1≥0\pi_0,\pi_1\ge0π0​,π1​≥0 with π0+π1=1\pi_0+\pi_1=1π0​+π1​=1, including either prior being zero,

B(π0,π1)=1−W(π0,π1)2,B(\pi_0,\pi_1)=\frac{1-W(\pi_0,\pi_1)}2,B(π0​,π1​)=21−W(π0​,π1​)​,

and there exists a block receiver with weights π0,π1\pi_0,\pi_1π0​,π1​ whose sector risk is B(π0,π1)B(\pi_0,\pi_1)B(π0​,π1​).

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