Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4.3 / (39): four dimension-independent error comparisons

Open
QAlgorithms.Papers.Independent.Gap20.P07.fourErrorComparisons

by Goku · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let TTT be a CPTP endomorphism of a finite-dimensional nonzero complex system. Let Fmin⁡(T)F_{\min}(T)Fmin​(T) be the minimum normalized pure-state fidelity, Fe,min⁡(T)F_{e,\min}(T)Fe,min​(T) the infimum of squared entanglement fidelity over density operators, a=∥T−id∥1→1a=\|T-\mathrm{id}\|_{1\to1}a=∥T−id∥1→1​, and b=∥T−id∥cbb=\|T-\mathrm{id}\|_{\rm cb}b=∥T−id∥cb​, with the full trace norm convention. Then

1−Fe,min⁡(T)≤41−Fmin⁡(T)≤4a≤4b≤8(1−Fe,min⁡(T))1/4.1-F_{e,\min}(T)\le4\sqrt{1-F_{\min}(T)}\le4\sqrt a\le4\sqrt b\le8(1-F_{e,\min}(T))^{1/4}.1−Fe,min​(T)≤41−Fmin​(T)​≤4a​≤4b​≤8(1−Fe,min​(T))1/4.

Every constant and the fourth root are dimension independent. This chain explains equivalence of these four error criteria near an ideal channel.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P07
Formal statement
noncomputable section

open Filter MeasureTheory

open scoped Topology ENNReal NNReal Matrix ComplexOrder ComplexConjugate

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus

namespace QAlgorithms.Papers.Independent.Gap20.P07

open QAlgorithms

open QAlgorithms.RealRegisters (Hilbert)

open QAlgorithms.Papers.Independent.Dependency50.P33
  (State IsTraceClass IsTraceClassChannel traceSize rankOne tensorApply)

open QAlgorithms.Papers.Independent.Frontier30.P14
  (Operation isometryCoeff conjugateKernel)

open QAlgorithms.Papers.Independent.Claimed50.P35
  (stabilizedTraceClassNorm traceClassTensorMap traceClassChannelPower
   transpose transposeBound TraceLinear tracePair MeasurePrepare)

open QAlgorithms.Papers.Independent.Gap48.P29 (fe FiniteCPMap)

/-- PDF pp.13--14, Proposition 4.3, (39): the complete four-inequality chain,
with constants 4,4,4,8 and the final fourth root. -/
theorem fourErrorComparisons (d : ℕ) (hd : 0 < d)
    (T : Superop (Fin d) (Fin d)) (hT : IsChannel T) :
    1 - minimumFe d T ≤ 4 * Real.sqrt (1 - minimumFidelity d T) ∧
    4 * Real.sqrt (1 - minimumFidelity d T) ≤ 4 * Real.sqrt (ordinaryNorm d (fun X => T X - X)) ∧
    4 * Real.sqrt (ordinaryNorm d (fun X => T X - X)) ≤ 4 * Real.sqrt (finiteCbNorm d (fun X => T X - X)) ∧
    4 * Real.sqrt (finiteCbNorm d (fun X => T X - X)) ≤
      8 * Real.rpow (1 - minimumFe d T) (1 / 4 : ℝ) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P07

end
Source
Tema Con Variazioni: Quantum Channel Capacity, arXiv:quant-ph/0311037v1, PDF p. 13, Proposition 4.3 / (39): four dimension-independent error comparisons
Read-back

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

For every positive integer ddd and every map T:Md(C)→Md(C)T:M_d(\mathbb C)\to M_d(\mathbb C)T:Md​(C)→Md​(C) with a finite Kraus representation T(X)=∑aKaXKa†T(X)=\sum_aK_aXK_a^\daggerT(X)=∑a​Ka​XKa†​ satisfying ∑aKa†Ka=Id\sum_aK_a^\dagger K_a=I_d∑a​Ka†​Ka​=Id​, put Pψ=ψψ†P_\psi=\psi\psi^\daggerPψ​=ψψ† and define

fmin⁡(T)=inf⁡∥ψ∥2=1Re⁡tr⁡ ⁣(PψT(Pψ)),emin⁡(T)=inf⁡ρ≥0tr⁡ρ=1Fe(ρ,T),f_{\min}(T)=\inf_{\|\psi\|_2=1}\operatorname{Re}\operatorname{tr}\!\bigl(P_\psi T(P_\psi)\bigr),\qquad e_{\min}(T)=\inf_{\substack{\rho\ge0\\ \operatorname{tr}\rho=1}}F_e(\rho,T),fmin​(T)=∥ψ∥2​=1inf​Retr(Pψ​T(Pψ​)),emin​(T)=ρ≥0trρ=1​inf​Fe​(ρ,T),

where, writing EjℓE_{j\ell}Ejℓ​ for a matrix unit,

Fe(ρ,T)=Re⁡∑i,j,k,ℓ=0d−1ρji ρℓk‾ [T(Ejℓ)]ik.F_e(\rho,T)= \operatorname{Re}\sum_{i,j,k,\ell=0}^{d-1} \rho_{ji}\,\overline{\rho_{\ell k}}\,[T(E_{j\ell})]_{ik}.Fe​(ρ,T)=Rei,j,k,ℓ=0∑d−1​ρji​ρℓk​​[T(Ejℓ​)]ik​.

For a map LLL define o(L)=sup⁡∥X∥1≤1∥L(X)∥1o(L)=\sup_{\|X\|_1\le1}\|L(X)\|_1o(L)=sup∥X∥1​≤1​∥L(X)∥1​, where ∥X∥1=Re⁡tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{tr}\sqrt{X^\dagger X}∥X∥1​=RetrX†X​. To define the other norm appearing in the statement, let ν(X)\nu(X)ν(X) be the infimum, in [0,∞][0,\infty][0,∞], of ofReal⁡(∑r∥ur∥2∥vr∥2)\operatorname{ofReal}(\sum_r\|u_r\|_2\|v_r\|_2)ofReal(∑r​∥ur​∥2​∥vr​∥2​) over sequences ur,vru_r,v_rur​,vr​ in the appropriate ℓ2\ell^2ℓ2 space such that ∑r∥ur∥2∥vr∥2\sum_r\|u_r\|_2\|v_r\|_2∑r​∥ur​∥2​∥vr​∥2​ is summable and Xij=∑rur(i)vr(j)‾X_{ij}=\sum_r u_r(i)\overline{v_r(j)}Xij​=∑r​ur​(i)vr​(j)​; a matrix is called trace class when such an expansion exists, and the infimum over no expansions is +∞+\infty+∞. Set

b(L)=(sup⁡q∈Nsup⁡X trace class on [d]×[q]ν(X)≤1ν(L[q]X))toReal,(L[q]X)(i,a),(j,b)=[L((X(r,a),(s,b))r,s)]ij,b(L)= \left( \sup_{q\in\mathbb N} \sup_{\substack{X\text{ trace class on }[d]\times[q]\\ \nu(X)\le1}} \nu(L^{[q]}X) \right)_{\mathrm{toReal}}, \qquad (L^{[q]}X)_{(i,a),(j,b)} =\bigl[L((X_{(r,a),(s,b)})_{r,s})\bigr]_{ij},b(L)=​q∈Nsup​X trace class on [d]×[q]ν(X)≤1​sup​ν(L[q]X)​toReal​,(L[q]X)(i,a),(j,b)​=[L((X(r,a),(s,b)​)r,s​)]ij​,

where [q]={0,…,q−1}[q]=\{0,\ldots,q-1\}[q]={0,…,q−1}, including the empty set for q=0q=0q=0, and conversion to a real number sends +∞+\infty+∞ to 000. With L(X)=T(X)−XL(X)=T(X)-XL(X)=T(X)−X, all four inequalities hold:

1−emin⁡(T)≤41−fmin⁡(T),41−fmin⁡(T)≤4o(L),4o(L)≤4b(L),4b(L)≤8(1−emin⁡(T))1/4.1-e_{\min}(T) \le4\sqrt{1-f_{\min}(T)},\qquad 4\sqrt{1-f_{\min}(T)} \le4\sqrt{o(L)},\qquad 4\sqrt{o(L)} \le4\sqrt{b(L)},\qquad 4\sqrt{b(L)} \le8\bigl(1-e_{\min}(T)\bigr)^{1/4}.1−emin​(T)≤41−fmin​(T)​,41−fmin​(T)​≤4o(L)​,4o(L)​≤4b(L)​,4b(L)​≤8(1−emin​(T))1/4.
Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 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