Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Optimal joint single-shot test and four probabilities

Open
QAlgorithms.Papers.Independent.Intakenext100.P96.entangled_single_shot

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Work in the retained vacuum/single-photon model, on a signal space with vacuum ∣vac⟩|\mathrm{vac}\rangle∣vac⟩ and d≥1d\ge1d≥1 orthogonal single-photon modes. Let b≥0b\ge0b≥0 be the background probability per mode, with db≤1db\le1db≤1, and let 0≤η≤10\le\eta\le10≤η≤1 be the reflection probability. Set

ρ0=(1−db)∣vac⟩⟨vac∣+b∑k=1d∣k⟩⟨k∣.\rho_0=(1-db)|\mathrm{vac}\rangle\langle\mathrm{vac}|+b\sum_{k=1}^d|k\rangle\langle k|.ρ0​=(1−db)∣vac⟩⟨vac∣+bk=1∑d​∣k⟩⟨k∣.

Use the resource ∣Φd⟩=d−1/2∑k=1d∣k⟩S∣k⟩A|\Phi_d\rangle=d^{-1/2}\sum_{k=1}^d|k\rangle_S|k\rangle_A∣Φd​⟩=d−1/2∑k=1d​∣k⟩S​∣k⟩A​, transmitting only the signal and retaining the ancillary photon perfectly. Write PΦ=∣Φd⟩⟨Φd∣P_\Phi=|\Phi_d\rangle\langle\Phi_d|PΦ​=∣Φd​⟩⟨Φd​∣, σ0=ρ0⊗IA/d\sigma_0=\rho_0\otimes I_A/dσ0​=ρ0​⊗IA​/d, and σ1=(1−η)σ0+ηPΦ\sigma_1=(1-\eta)\sigma_0+\eta P_\Phiσ1​=(1−η)σ0​+ηPΦ​. With equal prior probabilities, the ideal joint measurement {PΦ,I−PΦ}\{P_\Phi,I-P_\Phi\}{PΦ​,I−PΦ​}, guessing present on yes, minimizes error among all binary effects on signal and ancilla. The four conditional probabilities are

pe(no∣0)=1−b/d,pe(yes∣0)=b/d,pe(no∣1)=(1−b/d)(1−η),pe(yes∣1)=(1−η)b/d+η.\begin{aligned} p_e(\mathrm{no}\mid0)&=1-b/d,&p_e(\mathrm{yes}\mid0)&=b/d,\\ p_e(\mathrm{no}\mid1)&=(1-b/d)(1-\eta),& p_e(\mathrm{yes}\mid1)&=(1-\eta)b/d+\eta . \end{aligned}pe​(no∣0)pe​(no∣1)​=1−b/d,=(1−b/d)(1−η),​pe​(yes∣0)pe​(yes∣1)​=b/d,=(1−η)b/d+η.​

The labels 0,10,10,1 denote absence and presence. These probabilities express the effective background reduction from bbb to b/db/db/d.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P96
Formal statement
noncomputable section

open Filter

open scoped BigOperators Topology ComplexConjugate ComplexOrder Matrix.Norms.L2Operator

namespace QAlgorithms.Papers.Independent.Intakenext100.P96

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF pp.6--7, (9): the ideal Phi_d joint projector is an optimal equal-prior
single-shot test, with all four displayed conditional probabilities. -/
theorem entangled_single_shot (p : ModelParameters) :
    IsEffect (pairTest p.d) ∧
    (∀ M : Matrix (SignalIndex p.d × Fin p.d) (SignalIndex p.d × Fin p.d) ℂ,
      IsEffect M →
      binaryError (pairAbsent p.d p.b) (pairPresent p.d p.b p.eta) (pairTest p.d) ≤
        binaryError (pairAbsent p.d p.b) (pairPresent p.d p.b p.eta) M) ∧
    effectProb (1 - pairTest p.d) (pairAbsent p.d p.b) = 1 - p.b / (p.d : ℝ) ∧
    effectProb (1 - pairTest p.d) (pairPresent p.d p.b p.eta) =
      (1 - p.b / (p.d : ℝ)) * (1 - p.eta) ∧
    effectProb (pairTest p.d) (pairAbsent p.d p.b) = p.b / (p.d : ℝ) ∧
    effectProb (pairTest p.d) (pairPresent p.d p.b p.eta) =
      (1 - p.eta) * (p.b / (p.d : ℝ)) + p.eta := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P96

end
Source
Quantum Illumination, arXiv:0803.2022v2, PDF p. 7, Optimal joint single-shot test and four conditional probabilities (9)
Read-back

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

Let ppp consist of a natural number d>0d>0d>0 and real numbers b,ηb,\etab,η satisfying b≥0b\ge0b≥0, db≤1db\le1db≤1, and 0≤η≤10\le\eta\le10≤η≤1. Let J={⊥}⊔{0,…,d−1}J=\{\bot\}\sqcup\{0,\ldots,d-1\}J={⊥}⊔{0,…,d−1}, B=diag⁡(1−db,b,…,b)B=\operatorname{diag}(1-db,b,\ldots,b)B=diag(1−db,b,…,b), and define a vector on J×{0,…,d−1}J\times\{0,\ldots,d-1\}J×{0,…,d−1} by Ω⊥,j=0\Omega_{\bot,j}=0Ω⊥,j​=0 and Ωi,j=δij/d\Omega_{i,j}=\delta_{ij}/\sqrt dΩi,j​=δij​/d​. Set P=ΩΩ∗P=\Omega\Omega^*P=ΩΩ∗, A=B⊗(1d/d)A=B\otimes(\mathbf1_d/d)A=B⊗(1d​/d), and A1=(1−η)A+ηPA_1=(1-\eta)A+\eta PA1​=(1−η)A+ηP. Writing E(M,ρ)=Re⁡tr⁡(Mρ)E(M,\rho)=\operatorname{Re}\operatorname{tr}(M\rho)E(M,ρ)=Retr(Mρ) and e(M)=(E(M,A)+E(1−M,A1))/2e(M)=\bigl(E(M,A)+E(\mathbf1-M,A_1)\bigr)/2e(M)=(E(M,A)+E(1−M,A1​))/2, the theorem asserts that P⪰0P\succeq0P⪰0 and 1−P⪰0\mathbf1-P\succeq01−P⪰0, that e(P)≤e(M)e(P)\le e(M)e(P)≤e(M) for every matrix MMM on J×{0,…,d−1}J\times\{0,\ldots,d-1\}J×{0,…,d−1} satisfying M⪰0M\succeq0M⪰0 and 1−M⪰0\mathbf1-M\succeq01−M⪰0, and that

E(1−P,A)=1−bd,E(1−P,A1)=(1−bd)(1−η),E(P,A)=bd,E(P,A1)=(1−η)bd+η.E(\mathbf1-P,A)=1-\frac bd,\qquad E(\mathbf1-P,A_1)=\left(1-\frac bd\right)(1-\eta),\qquad E(P,A)=\frac bd,\qquad E(P,A_1)=(1-\eta)\frac bd+\eta.E(1−P,A)=1−db​,E(1−P,A1​)=(1−db​)(1−η),E(P,A)=db​,E(P,A1​)=(1−η)db​+η.

The allowed parameters include b=0b=0b=0, db=1db=1db=1, η=0\eta=0η=0, η=1\eta=1η=1, and d=1d=1d=1.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me