Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Repeated joint tests attain the collective Chernoff rate

Open
QAlgorithms.Papers.Independent.Intakenext100.P96.entangled_counting

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Φ​.

For this statement assume 0<b0<b0<b, db<1db<1db<1, and 0<η<10<\eta<10<η<1.

For states a0,a1a_0,a_1a0​,a1​, write Q(a0,a1)=inf⁡0<s<1Tr⁡(a01−sa1s)Q(a_0,a_1)=\inf_{0<s<1}\operatorname{Tr}(a_0^{1-s}a_1^s)Q(a0​,a1​)=inf0<s<1​Tr(a01−s​a1s​), including one-sided limits at singular endpoints.

Prepare identical inputs independently with independent background noise, keeping all parameters fixed across trials. Let En∗E_n^*En∗​ be the minimum equal-prior error among all joint binary effects on the nnn returned copies. Let

Cn(p0,p1)=12∑k=0nmin⁡ ⁣{(nk)p0k(1−p0)n−k,(nk)p1k(1−p1)n−k}C_n(p_0,p_1)=\frac12\sum_{k=0}^{n}\min\!\left\{\binom nk p_0^k(1-p_0)^{n-k},\binom nk p_1^k(1-p_1)^{n-k}\right\}Cn​(p0​,p1​)=21​k=0∑n​min{(kn​)p0k​(1−p0​)n−k,(kn​)p1k​(1−p1​)n−k}

be the minimum error after recording the full number of yes outcomes, for yes probabilities p0,p1p_0,p_1p0​,p1​ under the two hypotheses. Define

B(p0,p1)=inf⁡0<s<1[(1−p0)1−s(1−p1)s+p01−sp1s].B(p_0,p_1)=\inf_{0<s<1}\left[(1-p_0)^{1-s}(1-p_1)^s+p_0^{1-s}p_1^s\right].B(p0​,p1​)=0<s<1inf​[(1−p0​)1−s(1−p1​)s+p01−s​p1s​].

Repeat the ideal joint measurement {PΦ,I−PΦ}\{P_\Phi,I-P_\Phi\}{PΦ​,I−PΦ​} on each returning signal and its own retained ancilla. With p0=b/dp_0=b/dp0​=b/d and p1=(1−η)b/d+ηp_1=(1-\eta)b/d+\etap1​=(1−η)b/d+η,

lim⁡n→∞(2En∗)1/n=lim⁡n→∞(2Cn(p0,p1))1/n=Q(σ0,σ1)=B(p0,p1).\lim_{n\to\infty}(2E_n^*)^{1/n} =\lim_{n\to\infty}\bigl(2C_n(p_0,p_1)\bigr)^{1/n} =Q(\sigma_0,\sigma_1)=B(p_0,p_1).n→∞lim​(2En∗​)1/n=n→∞lim​(2Cn​(p0​,p1​))1/n=Q(σ0​,σ1​)=B(p0​,p1​).

This states that these separate measurements followed by optimal decisions from the full count attain the unrestricted collective error exponent. It does not identify single-shot error with many-copy error or assert an efficient physical detector.

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.7--8: repeated joint yes/no tests with optimal count postprocessing
attain the collective Chernoff rate. This is not equality of single-shot and
many-copy error probabilities, nor a claim of efficient detector implementation. -/
theorem entangled_counting (p : ModelParameters) (hb : 0 < p.b)
    (hdb : (p.d : ℝ) * p.b < 1) (heta0 : 0 < p.eta) (heta1 : p.eta < 1) :
    illuminationChernoffFactor (pairAbsent p.d p.b) (pairPresent p.d p.b p.eta) =
      binaryChernoff (p.b / (p.d : ℝ)) ((1 - p.eta) * (p.b / (p.d : ℝ)) + p.eta) ∧
    Tendsto (errorFactor (iidEqualPriorError (pairAbsent p.d p.b) (pairPresent p.d p.b p.eta)))
      atTop (nhds (binaryChernoff (p.b / (p.d : ℝ))
        ((1 - p.eta) * (p.b / (p.d : ℝ)) + p.eta))) ∧
    Tendsto (errorFactor (countingError (p.b / (p.d : ℝ))
        ((1 - p.eta) * (p.b / (p.d : ℝ)) + p.eta)))
      atTop (nhds (binaryChernoff (p.b / (p.d : ℝ))
        ((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. 8, Repeated joint yes/no measurements attain the entangled Chernoff rate
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, and assume additionally b>0b>0b>0, db<1db<1db<1, and 0<η<10<\eta<10<η<1. On the space with basis e∗,e0,…,ed−1e_\ast,e_0,\ldots,e_{d-1}e∗​,e0​,…,ed−1​, put B=diag⁡(1−db,b,…,b)B=\operatorname{diag}(1-db,b,\ldots,b)B=diag(1−db,b,…,b), and define

Ω=1d∑i=0d−1ei⊗ei,ρ0=B⊗Idd,ρ1=(1−η)ρ0+η ΩΩ∗,p0=bd,p1=(1−η)bd+η.\Omega=\frac1{\sqrt d}\sum_{i=0}^{d-1}e_i\otimes e_i,\qquad \rho_0=B\otimes\frac{I_d}{d},\qquad \rho_1=(1-\eta)\rho_0+\eta\,\Omega\Omega^\ast,\qquad p_0=\frac bd,\qquad p_1=(1-\eta)\frac bd+\eta .Ω=d​1​i=0∑d−1​ei​⊗ei​,ρ0​=B⊗dId​​,ρ1​=(1−η)ρ0​+ηΩΩ∗,p0​=db​,p1​=(1−η)db​+η.

Write C(A,C)=inf⁡0<s<1Re⁡tr⁡(CsA1−s)\mathcal C(A,C)=\inf_{0<s<1}\operatorname{Re}\operatorname{tr}(C^sA^{1-s})C(A,C)=inf0<s<1​Retr(CsA1−s), where powers use continuous functional calculus of real power functions, and put

β(p0,p1)=inf⁡0<s<1((1−p0)1−s(1−p1)s+p01−sp1s).\beta(p_0,p_1)=\inf_{0<s<1} \left((1-p_0)^{1-s}(1-p_1)^s+p_0^{1-s}p_1^s\right).β(p0​,p1​)=0<s<1inf​((1−p0​)1−s(1−p1​)s+p01−s​p1s​).

For every natural nnn, let EnE_nEn​ be one half of the real conversion of the following infimum, taken in the extended real numbers:

inf⁡T a complex matrix on the n-copy spaceT≥0, I−T≥0[Re⁡tr⁡(ρ0⊗nT)+Re⁡tr⁡(ρ1⊗n(I−T))],\inf_{\substack{T\ \text{a complex matrix on the }n\text{-copy space}\\ T\ge0,\ I-T\ge0}} \left[ \operatorname{Re}\operatorname{tr}(\rho_0^{\otimes n}T) +\operatorname{Re}\operatorname{tr}(\rho_1^{\otimes n}(I-T)) \right],T a complex matrix on the n-copy spaceT≥0, I−T≥0​inf​[Retr(ρ0⊗n​T)+Retr(ρ1⊗n​(I−T))],

where ≥0\ge0≥0 means positive semidefinite; the real conversion sends either infinite extended-real value to 000. Here tensor powers have entries (A⊗n)x,y=∏i=0n−1Axi,yi(A^{\otimes n})_{x,y}=\prod_{i=0}^{n-1}A_{x_i,y_i}(A⊗n)x,y​=∏i=0n−1​Axi​,yi​​, so the zeroth tensor power is the 1×11\times11×1 matrix with entry 111. Also define

Cn=12∑j=0nmin⁡{(nj)p0j(1−p0)n−j,(nj)p1j(1−p1)n−j}.C_n=\frac12\sum_{j=0}^{n} \min\left\{ \binom nj p_0^j(1-p_0)^{n-j}, \binom nj p_1^j(1-p_1)^{n-j} \right\}.Cn​=21​j=0∑n​min{(jn​)p0j​(1−p0​)n−j,(jn​)p1j​(1−p1​)n−j}.

The declaration asserts the equality and the two limits

C(ρ0,ρ1)=β(p0,p1),lim⁡n→∞(2En+1)1/(n+1)=β(p0,p1),lim⁡n→∞(2Cn+1)1/(n+1)=β(p0,p1),\mathcal C(\rho_0,\rho_1)=\beta(p_0,p_1),\qquad \lim_{n\to\infty}(2E_{n+1})^{1/(n+1)}=\beta(p_0,p_1),\qquad \lim_{n\to\infty}(2C_{n+1})^{1/(n+1)}=\beta(p_0,p_1),C(ρ0​,ρ1​)=β(p0​,p1​),n→∞lim​(2En+1​)1/(n+1)=β(p0​,p1​),n→∞lim​(2Cn+1​)1/(n+1)=β(p0​,p1​),

where nnn tends to infinity through natural numbers and the roots are real powers.

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