Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered (31): a unitary orthogonal basis gives the completely noisy channel

Proved
QAlgorithms.Papers.Independent.Gap48.P36.orthogonal_basis_noise

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

prove2quantum

All Hilbert spaces have positive finite dimension. Channels are completely positive and trace preserving; conjugates use the same normalized pure-environment dilation. Let T=(Tm)T=(T_m)T=(Tm​) be a basis of d2d^2d2 unitaries on Cd\mathbb C^dCd, including III, with Tr⁡(Tm†Tn)=dδmn\operatorname{Tr}(T_m^\dagger T_n)=d\delta_{mn}Tr(Tm†​Tn​)=dδmn​. For every complex input matrix ρ\rhoρ,

1d2∑mTmρTm†=Tr⁡ρdId.\frac1{d^2}\sum_m T_m\rho T_m^\dagger=\frac{\operatorname{Tr}\rho}{d}I_d.d21​m∑​Tm​ρTm†​=dTrρ​Id​.

Thus each such basis generates the completely noisy channel. The identity includes nonstates and the case d=1d=1d=1.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P36
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap48.P36

open scoped BigOperators Matrix Kronecker ComplexConjugate ComplexOrder ENNReal

open QAlgorithms.Papers.Independent.Claimed50.P48

open QAlgorithms.Papers.Independent.Information100.P67 (receiverChannel complementaryChannel)

open QAlgorithms.Papers.Independent.Information100.P56 (entropy normalizedChoi)

open QAlgorithms.Papers.Independent.Information100.P50 (schattenNorm)

open QAlgorithms.Papers.Independent.Information100.P03 (convexRoof)

open QAlgorithms.Papers.Independent.Dependency50.P45 (holevoCapacity)

attribute [local instance] Classical.propDecidable Classical.decEq

variable {A B C D E K L A2 B2 C2 : Type*}

variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]

variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]

variable [Fintype E] [DecidableEq E] [Fintype K] [DecidableEq K]

variable [Fintype L] [DecidableEq L] [Fintype A2] [DecidableEq A2]

variable [Fintype B2] [DecidableEq B2] [Fintype C2] [DecidableEq C2]

/-- Unnumbered twirling identity (31), PDF p.14: every input matrix, including nonstates. -/
theorem orthogonal_basis_noise [Nonempty A] [Nonempty K] (T : UnitaryBasis A K) :
    ∀ rho : Matrix A A ℂ,
      ((Fintype.card A : ℂ)^2)⁻¹ • (∑ k, T.matrix k * rho * (T.matrix k)ᴴ) =
        (rho.trace / (Fintype.card A : ℂ)) • (1 : Matrix A A ℂ) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P36

end
Source
Properties of Conjugate Channels with Applications to Additivity and Multiplicativity, arXiv:quant-ph/0509126v3, PDF p. 14, Unnumbered (31): a unitary orthogonal basis gives the completely noisy channel
Read-back

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

For any finite nonempty index types A,KA,KA,K, each equipped with decidable equality, let T=(Tk)k∈KT=(T_k)_{k\in K}T=(Tk​)k∈K​ be complex matrices on AAA with a distinguished index k0k_0k0​ satisfying Tk0=IAT_{k_0}=I_ATk0​​=IA​, with ∣K∣=∣A∣2|K|=|A|^2∣K∣=∣A∣2, with Tk†Tk=IAT_k^\dagger T_k=I_ATk†​Tk​=IA​ for every kkk, and with tr⁡(Tj†Tk)=∣A∣\operatorname{tr}(T_j^\dagger T_k)=|A|tr(Tj†​Tk​)=∣A∣ when j=kj=kj=k and 000 otherwise. Then every complex matrix ρ\rhoρ on AAA, without any positivity or normalization hypothesis, satisfies

1∣A∣2∑k∈KTkρTk†=tr⁡ρ∣A∣ IA.\frac{1}{|A|^2}\sum_{k\in K}T_k\rho T_k^\dagger =\frac{\operatorname{tr}\rho}{|A|}\,I_A.∣A∣21​k∈K∑​Tk​ρTk†​=∣A∣trρ​IA​.

The nonemptiness assumption ensures ∣A∣>0|A|>0∣A∣>0; the case ∣A∣=1|A|=1∣A∣=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