Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Fidelity and common-exponent Chernoff product laws

Open
QAlgorithms.Papers.Independent.Intakethird100.P54.product_laws

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 ∣Ψ⟩=⨂m=1M∣ψm⟩|\Psi\rangle=\bigotimes_{m=1}^M|\psi_m\rangle∣Ψ⟩=⨂m=1M​∣ψm​⟩, where each normalized pure factor has one signal mode and an arbitrary finite retained idler register. The factors need not be identical or NDS. The grouped product is normalized, and for each common s∈[0,1]s\in[0,1]s∈[0,1],

F(Ψ)=∏m=1MF(ψm),Qs(Ψ)=∏m=1MQs(ψm).\mathcal F(\Psi)=\prod_{m=1}^M\mathcal F(\psi_m),\qquad Q_s(\Psi)=\prod_{m=1}^M Q_s(\psi_m).F(Ψ)=m=1∏M​F(ψm​),Qs​(Ψ)=m=1∏M​Qs​(ψm​).

These identities reduce a product experiment to its individual factors. They do not assert multiplicativity after independently minimizing the exponent in each factor.

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

/-- Product laws for arbitrary, possibly different and non-NDS, pure factors,
PDF p.6, (46)–(47). The same s is used in every factor; optimized coefficients
are not asserted to multiply. Equation (47)'s missing factor subscript is restored. -/
theorem product_laws {M : ℕ} (hM : 0 < M) (c : Channels) (hc : ValidSplitters c)
    (J : Fin M → ℕ) (psi : ∀ m, Hilbert (Occupation (Fin (J m)) × Occupation (Fin 1)))
    (hpsi : ∀ m, ‖psi m‖ = 1) :
    ‖productOpticalProbe J psi‖ = 1 ∧
    outputFidelity c (productOpticalProbe J psi) = ∏ m, outputFidelity c (psi m) ∧
    ∀ s ∈ Set.Icc (0 : ℝ) 1,
      outputChernoffAt c (productOpticalProbe J psi) s = ∏ m, outputChernoffAt c (psi m) s := 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. 6, product-laws
Read-back

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

Let M∈NM\in\mathbb NM∈N with M>0M>0M>0. 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​​, satisfying 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​. For each m∈{0,…,M−1}m\in\{0,\ldots,M-1\}m∈{0,…,M−1}, choose Jm∈NJ_m\in\mathbb NJm​∈N, possibly zero, and a norm-one vector ψm∈ℓ2(NJm×N;C)\psi_m\in\ell^2(\mathbb N^{J_m}\times\mathbb N;\mathbb C)ψm​∈ℓ2(NJm​×N;C), identifying a one-mode occupation with its single natural-number entry. Define Ψ∈ℓ2((∏mNJm)×NM;C)\Psi\in\ell^2((\prod_m\mathbb N^{J_m})\times\mathbb N^M;\mathbb C)Ψ∈ℓ2((∏m​NJm​)×NM;C) from the function

Ψ((im)m,n)=∏mψm(im,nm),\Psi((i_m)_m,n)=\prod_m\psi_m(i_m,n_m),Ψ((im​)m​,n)=m∏​ψm​(im​,nm​),

using that function if it is square-summable and zero otherwise. For any probe ϕ\phiϕ with a finite set of signal modes, define 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 zero otherwise, and define its returned kernels by ρbϕ(x,y)=∑kgb,kϕ(x)gb,kϕ(y)‾\rho_b^\phi(x,y)=\sum_k g_{b,k}^\phi(x)\overline{g_{b,k}^\phi(y)}ρbϕ​(x,y)=∑k​gb,kϕ​(x)gb,kϕ​(y)​, where gb,kϕ(i,p)=ϕ(i,p+k)Lb(p+k,k)g_{b,k}^\phi(i,p)=\phi(i,p+k)L_b(p+k,k)gb,kϕ​(i,p)=ϕ(i,p+k)Lb​(p+k,k). Write F(ϕ)F(\phi)F(ϕ) for the supremum of ∣⟨z,w⟩∣2|\langle z,w\rangle|^2∣⟨z,w⟩∣2 over unit square-summable vectors on the probe’s output labels times N\mathbb NN, with marginals ∑ez(x,e)z(y,e)‾=ρ0ϕ(x,y)\sum_e z(x,e)\overline{z(y,e)}=\rho_0^\phi(x,y)∑e​z(x,e)z(y,e)​=ρ0ϕ​(x,y) and ∑ew(x,e)w(y,e)‾=ρ1ϕ(x,y)\sum_e w(x,e)\overline{w(y,e)}=\rho_1^\phi(x,y)∑e​w(x,e)w(y,e)​=ρ1ϕ​(x,y). A resolution (an,un)(a_n,u_n)(an​,un​) of a kernel means summable nonnegative weights of sum 111, vectors unit at positive weights and orthogonal at distinct positive weights, and the entrywise representation 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. Write

Qs(ϕ)=sup⁡(a,u),(b,w)∑n,l∈Nh(an,s)h(bl,1−s)∣⟨un,wl⟩∣2,Q_s(\phi)=\sup_{(a,u),(b,w)} \sum_{n,l\in\mathbb N}h(a_n,s)h(b_l,1-s) |\langle u_n,w_l\rangle|^2,Qs​(ϕ)=(a,u),(b,w)sup​n,l∈N∑​h(an​,s)h(bl​,1−s)∣⟨un​,wl​⟩∣2,

where the resolutions are of ρ0ϕ,ρ1ϕ\rho_0^\phi,\rho_1^\phiρ0ϕ​,ρ1ϕ​, and h(p,t)=0h(p,t)=0h(p,t)=0 if p=0p=0p=0 and h(p,t)=pth(p,t)=p^th(p,t)=pt otherwise. Empty defining sets for these real suprema give value 000. The theorem asserts

∥Ψ∥=1,F(Ψ)=∏mF(ψm),Qs(Ψ)=∏mQs(ψm)for every s∈[0,1].\|\Psi\|=1,\qquad F(\Psi)=\prod_m F(\psi_m),\qquad Q_s(\Psi)=\prod_m Q_s(\psi_m)\quad\text{for every }s\in[0,1].∥Ψ∥=1,F(Ψ)=m∏​F(ψm​),Qs​(Ψ)=m∏​Qs​(ψm​)for every s∈[0,1].

There is no additional orthogonality condition on the input probes, and the endpoints s=0,1s=0,1s=0,1 use the stated zero-weight convention.

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