Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 6.2 / (91)–(93): Haar twirling turns mean fidelity into minimum fidelity

Open
QAlgorithms.Papers.Independent.Gap20.P07.twirl_meanToMinimum

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

prove2quantum

Let TTT be a CPTP endomorphism of a nonzero complex system of dimension ddd. With normalized Haar measure on the full unitary group, define

T~(X)=∫U(d)U∗T(UXU∗)U dU.\widetilde T(X)=\int_{U(d)}U^*T(UXU^*)U\,dU.T(X)=∫U(d)​U∗T(UXU∗)UdU.

This integral is a CPTP channel, and for every unit vector ψ\psiψ,

⟨ψ∣T~(∣ψ⟩⟨ψ∣)∣ψ⟩=Fav(T),Fmin⁡(T~)=Fav(T).\langle\psi|\widetilde T(|\psi\rangle\langle\psi|)|\psi\rangle=F_{\rm av}(T),\qquad F_{\min}(\widetilde T)=F_{\rm av}(T).⟨ψ∣T(∣ψ⟩⟨ψ∣)∣ψ⟩=Fav​(T),Fmin​(T)=Fav​(T).

The integral averages whole logical-block unitaries. This computes the channel realized by the source's continuous forward-message construction and equates its minimum fidelity to the original mean.

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)

section HaarTwirlNorm

open scoped Matrix.Norms.L2Operator

/-- PDF pp.24--25, (91)--(93): computed whole-logical-block Haar integral,
constant pure-state survival overlap, and equality of the minimum and mean. -/
theorem twirl_meanToMinimum (d : ℕ) (hd : 0 < d)
    (T : Superop (Fin d) (Fin d)) (hT : IsChannel T) :
    IsChannel (QuditFidelity.haarTwirl d hd T) ∧
    (∀ X, QuditFidelity.haarTwirl d hd T X =
      ∫ U : Matrix.unitaryGroup (Fin d) ℂ,
        conjSuperop (star (U : Matrix (Fin d) (Fin d) ℂ))
          (T (conjSuperop (U : Matrix (Fin d) (Fin d) ℂ) X)) ∂Schur.unitaryHaar d) ∧
    (∀ psi : EuclideanSpace ℂ (Fin d), IsState psi →
      effectProb (pureDensity psi) (QuditFidelity.haarTwirl d hd T (pureDensity psi)) =
        QuditFidelity.averageFidelity d hd T) ∧
    minimumFidelity d (QuditFidelity.haarTwirl d hd T) = QuditFidelity.averageFidelity d hd T := by sorry

end HaarTwirlNorm

end QAlgorithms.Papers.Independent.Gap20.P07

end
Source
Tema Con Variazioni: Quantum Channel Capacity, arXiv:quant-ph/0311037v1, PDF p. 24, Section 6.2 / (91)–(93): Haar twirling turns mean fidelity into minimum fidelity
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​, define

T~(X)=∫U(d)U†T(UXU†)U dHd(U),\widetilde T(X)=\int_{U(d)}U^\dagger T(UXU^\dagger)U\,dH_d(U),T(X)=∫U(d)​U†T(UXU†)UdHd​(U),

where HdH_dHd​ is Haar measure normalized to give U(d)U(d)U(d) mass 111. Let μd\mu_dμd​ be its pushforward under U↦Ue0U\mapsto Ue_0U↦Ue0​, put Pψ=ψψ†P_\psi=\psi\psi^\daggerPψ​=ψψ†, and set

Fav(T)=∫Re⁡tr⁡ ⁣(PψT(Pψ)) dμd(ψ).F_{\mathrm{av}}(T)= \int\operatorname{Re}\operatorname{tr}\!\bigl(P_\psi T(P_\psi)\bigr)\,d\mu_d(\psi).Fav​(T)=∫Retr(Pψ​T(Pψ​))dμd​(ψ).

Then T~\widetilde TT admits a finite Kraus representation with identity Kraus sum; its value on every complex matrix XXX equals the displayed Haar integral; every unit vector ψ∈Cd\psi\in\mathbb C^dψ∈Cd satisfies

Re⁡tr⁡ ⁣(PψT~(Pψ))=Fav(T);\operatorname{Re}\operatorname{tr}\!\bigl(P_\psi\widetilde T(P_\psi)\bigr) =F_{\mathrm{av}}(T);Retr(Pψ​T(Pψ​))=Fav​(T);

and consequently the explicitly asserted minimum-fidelity equality is

inf⁡ψ∈Cd∥ψ∥2=1Re⁡tr⁡ ⁣(PψT~(Pψ))=Fav(T).\inf_{\substack{\psi\in\mathbb C^d\\\|\psi\|_2=1}} \operatorname{Re}\operatorname{tr}\!\bigl(P_\psi\widetilde T(P_\psi)\bigr) =F_{\mathrm{av}}(T).ψ∈Cd∥ψ∥2​=1​inf​Retr(Pψ​T(Pψ​))=Fav​(T).

The dimension d=1d=1d=1 is included.

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