Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example 4: QC Pauli channels attain the bound and are tensor-power multiplicative

Open
QAlgorithms.Papers.Independent.Gap48.P36.qc_pauli_powers

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. Use X∣k⟩=∣k+1 mod d⟩X|k\rangle=|k+1\bmod d\rangleX∣k⟩=∣k+1modd⟩, Z∣k⟩=e2πik/d∣k⟩Z|k\rangle=e^{2\pi ik/d}|k\rangleZ∣k⟩=e2πik/d∣k⟩, Wjk=XjZkW_{jk}=X^jZ^kWjk​=XjZk, and labels (j,k)∈(Z/dZ)2(j,k)\in(\mathbb Z/d\mathbb Z)^2(j,k)∈(Z/dZ)2. Write νp(Φ)=sup⁡ρ∥Φ(ρ)∥p\nu_p(\Phi)=\sup_\rho\|\Phi(\rho)\|_pνp​(Φ)=supρ​∥Φ(ρ)∥p​ and Smin⁡(Φ)=inf⁡ρS(Φ(ρ))S_{\min}(\Phi)=\inf_\rho S(\Phi(\rho))Smin​(Φ)=infρ​S(Φ(ρ)), with density inputs, Schatten norm, and von Neumann entropy. Let ajk=aj≥0a_{jk}=a_j\ge0ajk​=aj​≥0 be independent of kkk and satisfy d∑jaj=1d\sum_j a_j=1d∑j​aj​=1. Then

Φ(ρ)=d∑jajXjρdiagX−j,νp(Φ)=(∑j(daj)p)1/p,νp(Φ⊗m)=νp(Φ)m(p≥1, m≥1).\begin{gathered}\Phi(\rho)=d\sum_j a_jX^j\rho_{\mathrm{diag}}X^{-j},\qquad\nu_p(\Phi)=\left(\sum_j(da_j)^p\right)^{1/p},\\\nu_p(\Phi^{\otimes m})=\nu_p(\Phi)^m\quad(p\ge1,\ m\ge1).\end{gathered}Φ(ρ)=dj∑​aj​Xjρdiag​X−j,νp​(Φ)=(j∑​(daj​)p)1/p,νp​(Φ⊗m)=νp​(Φ)m(p≥1, m≥1).​

The matrix ρdiag\rho_{\mathrm{diag}}ρdiag​ keeps the computational diagonal. The channel admits rank-one Kraus matrices, hence is entanglement breaking, and attains the sorted block bound for every labeled sorted arrangement. The factor ddd corrects the last expression of (71).

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]

/-- Example 4, PDF pp.24–25: normalized QC channel, sharp bound and all positive powers.
Correction to (71): summing the clock conjugations gives d times the diagonal. -/
theorem qc_pauli_powers (d : ℕ) [NeZero d] (a : ZMod d → ℝ)
    (ha : ∀ j, 0 ≤ a j) (hsum : (d : ℝ) * ∑ j, a j = 1)
    (p : ℝ) (hp : 1 ≤ p) :
    let Phi := randomUnitary (finWeyl d) (fun jk => a jk.1)
    (∀ rho, Phi rho = (d : ℂ) •
      (∑ j : ZMod d, (a j : ℂ) •
        (finWeyl d (1,0) ^ j.val * Matrix.diagonal (fun i => rho i i) * (finWeyl d (1,0) ^ j.val)ᴴ))) ∧
    nu (ENNReal.ofReal p) Phi = Real.rpow (∑ j, Real.rpow ((d : ℝ) * a j) p) (1 / p) ∧
    HasRankOneKraus Phi ∧
    (∀ e : (Fin d × Fin d) ≃ WeylLabel d, SortedRows (fun jk => a jk.1) e →
      nu (ENNReal.ofReal p) Phi = blockBound p (fun jk => a jk.1) e) ∧
    (∀ m : ℕ, 1 ≤ m → nu (ENNReal.ofReal p) (piSuperop (fun _ : Fin m => Phi)) =
      nu (ENNReal.ofReal p) Phi ^ m) := 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. 24, Example 4: QC Pauli channels attain the bound and are tensor-power multiplicative
Read-back

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

For every natural number d≠0d\ne0d=0, every function a:Z/dZ→Ra:\mathbb Z/d\mathbb Z\to\mathbb Ra:Z/dZ→R satisfying aj≥0a_j\ge0aj​≥0 and d∑jaj=1d\sum_j a_j=1d∑j​aj​=1, and every real p≥1p\ge1p≥1, define Wj,ℓ=SjrepZℓrepW_{j,\ell}=S^{j_{\mathrm{rep}}}Z^{\ell_{\mathrm{rep}}}Wj,ℓ​=Sjrep​Zℓrep​, where Su,v=1S_{u,v}=1Su,v​=1 if u=v+1u=v+1u=v+1 modulo ddd and 000 otherwise, Zu,v=δu,ve2πiurep/dZ_{u,v}=\delta_{u,v}e^{2\pi i u_{\mathrm{rep}}/d}Zu,v​=δu,v​e2πiurep​/d, and these matrices are reindexed from residues to {0,…,d−1}\{0,\ldots,d-1\}{0,…,d−1} by their standard representatives; set Φ(X)=∑j,ℓajWj,ℓXWj,ℓ†\Phi(X)=\sum_{j,\ell}a_jW_{j,\ell}XW_{j,\ell}^\daggerΦ(X)=∑j,ℓ​aj​Wj,ℓ​XWj,ℓ†​. For a square complex matrix YYY, write ∥Y∥p=(Re⁡tr⁡((Y†Y)p/2))1/p\|Y\|_p=(\operatorname{Re}\operatorname{tr}((Y^\dagger Y)^{p/2}))^{1/p}∥Y∥p​=(Retr((Y†Y)p/2))1/p, with matrix powers defined by continuous functional calculus, and write νp(Λ)=sup⁡{∥Λ(ρ)∥p:ρ is positive semidefinite,tr⁡ρ=1}\nu_p(\Lambda)=\sup\{\|\Lambda(\rho)\|_p:\rho\text{ is positive semidefinite},\operatorname{tr}\rho=1\}νp​(Λ)=sup{∥Λ(ρ)∥p​:ρ is positive semidefinite,trρ=1}. Then every complex d×dd\times dd×d matrix ρ\rhoρ satisfies

Φ(ρ)=d∑j∈Z/dZajSjrepdiag⁡(ρ00,…,ρd−1,d−1)(Sjrep)†,νp(Φ)=(∑j(daj)p)1/p.\Phi(\rho)=d\sum_{j\in\mathbb Z/d\mathbb Z}a_jS^{j_{\mathrm{rep}}}\operatorname{diag}(\rho_{00},\ldots,\rho_{d-1,d-1})(S^{j_{\mathrm{rep}}})^\dagger, \qquad \nu_p(\Phi)=\left(\sum_j(da_j)^p\right)^{1/p}.Φ(ρ)=dj∈Z/dZ∑​aj​Sjrep​diag(ρ00​,…,ρd−1,d−1​)(Sjrep​)†,νp​(Φ)=(j∑​(daj​)p)1/p.

There also exist a natural number rrr and vectors us,vs∈Cdu_s,v_s\in\mathbb C^dus​,vs​∈Cd, with no normalization requirements, such that Φ(X)=∑s<r(vsus†)X(vsus†)†\Phi(X)=\sum_{s<r}(v_su_s^\dagger)X(v_su_s^\dagger)^\daggerΦ(X)=∑s<r​(vs​us†​)X(vs​us†​)† for every XXX. For every bijection e:{0,…,d−1}2→(Z/dZ)2e:\{0,\ldots,d-1\}^2\to(\mathbb Z/d\mathbb Z)^2e:{0,…,d−1}2→(Z/dZ)2 such that di+j≤di′+j′di+j\le di'+j'di+j≤di′+j′ implies aπ1(e(i′,j′))≤aπ1(e(i,j))a_{\pi_1(e(i',j'))}\le a_{\pi_1(e(i,j))}aπ1​(e(i′,j′))​≤aπ1​(e(i,j))​, one has

νp(Φ)=(∑i<d(∑j<daπ1(e(i,j)))p)1/p.\nu_p(\Phi)=\left(\sum_{i<d}\left(\sum_{j<d}a_{\pi_1(e(i,j))}\right)^p\right)^{1/p}.νp​(Φ)=​i<d∑​​j<d∑​aπ1​(e(i,j))​​p​1/p.

Finally, for every natural number m≥1m\ge1m≥1, νp(Φ⊗m)=νp(Φ)m\nu_p(\Phi^{\otimes m})=\nu_p(\Phi)^mνp​(Φ⊗m)=νp​(Φ)m, where the tensor power is defined on arbitrary matrices by

(Φ⊗m(X))y,z=∑x,x′Xx,x′∏i<m(Φ(Exi,xi′))yi,zi,(\Phi^{\otimes m}(X))_{y,z} =\sum_{x,x'}X_{x,x'}\prod_{i<m}\bigl(\Phi(E_{x_i,x'_i})\bigr)_{y_i,z_i},(Φ⊗m(X))y,z​=x,x′∑​Xx,x′​i<m∏​(Φ(Exi​,xi′​​))yi​,zi​​,

with Eu,vE_{u,v}Eu,v​ the matrix unit. The cases d=1d=1d=1 and p=1p=1p=1 are 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