Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section V B, Eqs.(25)–(26): average sampling error for joint input/output laws

Proved
QAlgorithms.Papers.Independent.Advance50.P17.averageSampling

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

prove2quantum

For fixed CPTP maps E,F\mathcal E,\mathcal FE,F on a ddd-dimensional register, d≥1d\ge1d≥1, let qx(y),px(y)q_x(y),p_x(y)qx​(y),px​(y) be their computational-basis output probabilities. Under uniform basis inputs, define the joint laws q(x,y)=qx(y)/dq(x,y)=q_x(y)/dq(x,y)=qx​(y)/d and p(x,y)=px(y)/dp(x,y)=p_x(y)/dp(x,y)=px​(y)/d. With TV⁡(q,p)=12∑x,y∣q(x,y)−p(x,y)∣\operatorname{TV}(q,p)=\frac12\sum_{x,y}|q(x,y)-p(x,y)|TV(q,p)=21​∑x,y​∣q(x,y)−p(x,y)∣ and BC⁡(q,p)=∑x,yq(x,y)p(x,y)\operatorname{BC}(q,p)=\sum_{x,y}\sqrt{q(x,y)p(x,y)}BC(q,p)=∑x,y​q(x,y)p(x,y)​,

TV⁡(q,p)≤Dpro(E,F),1−BC⁡(q,p)≤Cpro(E,F)2.\operatorname{TV}(q,p)\le D_{\rm pro}(\mathcal E,\mathcal F),\qquad 1-\operatorname{BC}(q,p)\le C_{\rm pro}(\mathcal E,\mathcal F)^2.TV(q,p)≤Dpro​(E,F),1−BC(q,p)≤Cpro​(E,F)2.

These compare joint input/output laws, without an exact-function or unitary-ideal premise.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P17
Formal statement
noncomputable section

open MeasureTheory Filter

open scoped Matrix ComplexConjugate Topology

namespace QAlgorithms.Papers.Independent.Advance50.P17

open QAlgorithms.Papers.Independent.Information100.P53 (fidelity)

open QAlgorithms.Papers.Independent.Information100.P08 (canonicalPurification)

open QAlgorithms.Papers.Independent.Information100.P75 (hermitianReal)

variable {I J K : Type} [Fintype I] [Fintype J] [Fintype K]
  [DecidableEq I] [DecidableEq J] [DecidableEq K]
  [Nonempty I] [Nonempty J] [Nonempty K]

/-- Section V B, PDF p.10, Eqs.(25)--(26): compare JOINT input/output laws under uniform
inputs. No exact-function or unitary-ideal premise is required. -/
theorem averageSampling (E F : FiniteProcess I I) :
    classicalVariation (jointLaw E.val) (jointLaw F.val) ≤ proDistance (stateDistance .trace) E.val F.val ∧
    1 - bhattacharyya (jointLaw E.val) (jointLaw F.val) ≤
      proDistance (stateDistance .sine) E.val F.val ^ 2 := by sorry

end QAlgorithms.Papers.Independent.Advance50.P17

end
Source
Distance measures to compare real and ideal quantum processes, arXiv:quant-ph/0408063v2, PDF p. 10, Section V B, Eqs.(25)–(26): average sampling error for joint input/output laws
Read-back

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

Let III be any finite nonempty type with decidable equality, and put d=∣I∣d=|I|d=∣I∣. Let E,FE,FE,F be channels on complex matrices indexed by III: each map G∈{E,F}G\in\{E,F\}G∈{E,F} admits finitely many matrices KjK_jKj​ satisfying G(X)=∑jKjXKj†G(X)=\sum_jK_jXK_j^\daggerG(X)=∑j​Kj​XKj†​ for every XXX and ∑jKj†Kj=1\sum_jK_j^\dagger K_j=\mathbf1∑j​Kj†​Kj​=1. For coordinate unit vectors exe_xex​, set pG(y∣x)=Re⁡(G(exex†)y,y)p_G(y\mid x)=\operatorname{Re}(G(e_xe_x^\dagger)_{y,y})pG​(y∣x)=Re(G(ex​ex†​)y,y​) and qG(x,y)=pG(y∣x)/dq_G(x,y)=p_G(y\mid x)/dqG​(x,y)=pG​(y∣x)/d. Define (JG)(a,b),(a′,b′)=1dG(eaea′†)b,b′(J_G)_{(a,b),(a',b')}=\frac1dG(e_ae_{a'}^\dagger)_{b,b'}(JG​)(a,b),(a′,b′)​=d1​G(ea​ea′†​)b,b′​, ∥M∥1=Re⁡tr⁡M†M\|M\|_1=\operatorname{Re}\operatorname{tr}\sqrt{M^\dagger M}∥M∥1​=RetrM†M​, and F(A,B)=(Re⁡tr⁡A B A)2\mathcal F(A,B)=\bigl(\operatorname{Re}\operatorname{tr}\sqrt{\sqrt A\,B\,\sqrt A}\bigr)^2F(A,B)=(RetrA​BA​​)2. Then

12∑x,y∈I∣qE(x,y)−qF(x,y)∣≤12∥JE−JF∥1,1−∑x,y∈IqE(x,y)qF(x,y)≤(1−F(JE,JF))2.\frac12\sum_{x,y\in I}|q_E(x,y)-q_F(x,y)| \le \frac12\|J_E-J_F\|_1, \qquad 1-\sum_{x,y\in I}\sqrt{q_E(x,y)q_F(x,y)} \le \left(\sqrt{1-\mathcal F(J_E,J_F)}\right)^2.21​x,y∈I∑​∣qE​(x,y)−qF​(x,y)∣≤21​∥JE​−JF​∥1​,1−x,y∈I∑​qE​(x,y)qF​(x,y)​≤(1−F(JE​,JF​)​)2.

Here all matrix square roots are positive semidefinite square roots, and d=1d=1d=1 is included.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 29, 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