Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unital qubit channels: norm multiplicativity and entropy and Holevo additivity

Open
QAlgorithms.Papers.Independent.Support50.P13.unitalQubitAdditivity

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

prove2quantum

Let Φ:M2(C)→M2(C)\Phi:M_2(\mathbb C)\to M_2(\mathbb C)Φ:M2​(C)→M2​(C) be a completely positive trace-preserving linear map satisfying Φ(I2)=I2\Phi(I_2)=I_2Φ(I2​)=I2​. Let K≥1K\ge1K≥1 be an integer and let Ω:MK(C)→MK(C)\Omega:M_K(\mathbb C)\to M_K(\mathbb C)Ω:MK​(C)→MK​(C) be any completely positive trace-preserving linear map. A density matrix is positive semidefinite with trace one. For a positive matrix AAA and a finite real p≥1p\ge1p≥1, put ∥A∥p=(Tr⁡Ap)1/p\|A\|_p=(\operatorname{Tr}A^p)^{1/p}∥A∥p​=(TrAp)1/p and νp(Λ)=sup⁡ρ∥Λ(ρ)∥p\nu_p(\Lambda)=\sup_\rho\|\Lambda(\rho)\|_pνp​(Λ)=supρ​∥Λ(ρ)∥p​, where ρ\rhoρ ranges over every input density matrix. Write S(ρ)=−Tr⁡ρlog⁡ρS(\rho)=-\operatorname{Tr}\rho\log\rhoS(ρ)=−Trρlogρ, with natural logarithms and 0log⁡0=00\log0=00log0=0, and Smin⁡(Λ)=inf⁡ρS(Λ(ρ))S_{\min}(\Lambda)=\inf_\rho S(\Lambda(\rho))Smin​(Λ)=infρ​S(Λ(ρ)). The Holevo quantity χ∗(Λ)\chi^*(\Lambda)χ∗(Λ) is the supremum of S(∑iπiΛ(ρi))−∑iπiS(Λ(ρi))S(\sum_i\pi_i\Lambda(\rho_i))-\sum_i\pi_i S(\Lambda(\rho_i))S(∑i​πi​Λ(ρi​))−∑i​πi​S(Λ(ρi​)) over all finite ensembles of density matrices with nonnegative weights summing to one. Then

νp(Ω⊗Φ)=νp(Ω)νp(Φ)for every real p≥1,Smin⁡(Ω⊗Φ)=Smin⁡(Ω)+Smin⁡(Φ),χ∗(Ω⊗Φ)=χ∗(Ω)+χ∗(Φ).\begin{aligned} \nu_p(\Omega\otimes\Phi)&=\nu_p(\Omega)\nu_p(\Phi) &&\text{for every real }p\ge1,\\ S_{\min}(\Omega\otimes\Phi)&=S_{\min}(\Omega)+S_{\min}(\Phi),\\ \chi^*(\Omega\otimes\Phi)&=\chi^*(\Omega)+\chi^*(\Phi). \end{aligned}νp​(Ω⊗Φ)Smin​(Ω⊗Φ)χ∗(Ω⊗Φ)​=νp​(Ω)νp​(Φ)=Smin​(Ω)+Smin​(Φ),=χ∗(Ω)+χ∗(Φ).​for every real p≥1,

The product-channel optimizations include all entangled input density matrices. These equalities assert that entanglement between the two channel inputs does not improve these three optimized quantities.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P13
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder

open Filter

namespace QAlgorithms.Papers.Independent.Support50.P13

open QAlgorithms.Papers.Independent.Gap48.P03
  (productChannel maximumOutputPNorm holevoQuantity depolarizingNormFactor
    phaseChannel qubitPauli)

open QAlgorithms.Papers.Independent.Next46.P42 (minimumOutputEntropy)

open QAlgorithms.Papers.Independent.Information100.P63 (schatten)

open QAlgorithms.Papers.Independent.Dependency50.P23 (ordinaryClassicalCapacity)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- King quant-ph/0103156v2, PDF p.4, Theorem 1, (5)-(7).
Phi is an arbitrary unital qubit channel, with no standard-form restriction.
Omega is an arbitrary finite positive-dimensional CPTP endomap.
The imported minimumOutputEntropy takes values in the extended nonnegative reals;
on these finite-dimensional channels its values are finite and measured in nats. -/
theorem unitalQubitAdditivity
    (Phi : Superop (Fin 2) (Fin 2)) (hPhi : IsChannel Phi)
    (hPhiUnital : Phi 1 = 1)
    (K : ℕ) (hK : 0 < K)
    (Omega : Superop (Fin K) (Fin K)) (hOmega : IsChannel Omega) :
    (∀ p : ℝ, 1 ≤ p →
      maximumOutputPNorm (productChannel Omega Phi) p =
        maximumOutputPNorm Omega p * maximumOutputPNorm Phi p) ∧
    minimumOutputEntropy (productChannel Omega Phi) =
      minimumOutputEntropy Omega + minimumOutputEntropy Phi ∧
    holevoQuantity (productChannel Omega Phi) =
      holevoQuantity Omega + holevoQuantity Phi := by sorry

end QAlgorithms.Papers.Independent.Support50.P13

end
Source
Additivity for a class of unital qubit channels, arXiv:quant-ph/0103156v2, PDF p. 4, Theorem 1, equations (5)–(7)
Read-back

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

Let Φ:Mat⁡2(C)→Mat⁡2(C)\Phi:\operatorname{Mat}_2(\mathbb C)\to\operatorname{Mat}_2(\mathbb C)Φ:Mat2​(C)→Mat2​(C) be a channel satisfying Φ(I2)=I2\Phi(I_2)=I_2Φ(I2​)=I2​, let KKK be a positive natural number, and let Ω:Mat⁡K(C)→Mat⁡K(C)\Omega:\operatorname{Mat}_K(\mathbb C)\to\operatorname{Mat}_K(\mathbb C)Ω:MatK​(C)→MatK​(C) be a channel. Here being a channel means admitting a finite representation Λ(X)=∑jLjXLj†\Lambda(X)=\sum_j L_jXL_j^\daggerΛ(X)=∑j​Lj​XLj†​ with ∑jLj†Lj=I\sum_jL_j^\dagger L_j=I∑j​Lj†​Lj​=I. Define their product P\mathcal PP by

P(X)(b,d),(b′,d′)=∑a,a′=0K−1∑c,c′=01X(a,c),(a′,c′) Ω(Ea,a′)b,b′Φ(Ec,c′)d,d′.\mathcal P(X)_{(b,d),(b',d')} =\sum_{a,a'=0}^{K-1}\sum_{c,c'=0}^{1} X_{(a,c),(a',c')}\, \Omega(E_{a,a'})_{b,b'}\Phi(E_{c,c'})_{d,d'}.P(X)(b,d),(b′,d′)​=a,a′=0∑K−1​c,c′=0∑1​X(a,c),(a′,c′)​Ω(Ea,a′​)b,b′​Φ(Ec,c′​)d,d′​.

For a matrix YYY, write sp(Y)=(∑jλj(Y)p)1/ps_p(Y)=(\sum_j\lambda_j(Y)^p)^{1/p}sp​(Y)=(∑j​λj​(Y)p)1/p, where λj(Y)\lambda_j(Y)λj​(Y) lists its Hermitian eigenvalues in decreasing order with multiplicity; the underlying eigenvalue definition instead returns zeros when YYY is not Hermitian. Put νp(Λ)=sup⁡ρsp(Λ(ρ))\nu_p(\Lambda)=\sup_\rho s_p(\Lambda(\rho))νp​(Λ)=supρ​sp​(Λ(ρ)), with ρ\rhoρ ranging over positive semidefinite matrices of trace 111, and put

χ(Λ)=sup⁡m, pi≥0, ∑ipi=1ρi⪰0, tr⁡ρi=1[H ⁣(Λ ⁣(∑ipiρi))−∑ipiH(Λ(ρi))],H(Y)=−Re⁡tr⁡((t↦tlog⁡t)(Y)).\chi(\Lambda)=\sup_{\substack{m,\ p_i\ge0,\ \sum_i p_i=1\\ \rho_i\succeq0,\ \operatorname{tr}\rho_i=1}} \left[H\!\left(\Lambda\!\left(\sum_i p_i\rho_i\right)\right)-\sum_i p_iH(\Lambda(\rho_i))\right], \quad H(Y)=-\operatorname{Re}\operatorname{tr}\bigl((t\mapsto t\log t)(Y)\bigr).χ(Λ)=m, pi​≥0, ∑i​pi​=1ρi​⪰0, trρi​=1​sup​[H(Λ(i∑​pi​ρi​))−i∑​pi​H(Λ(ρi​))],H(Y)=−Retr((t↦tlogt)(Y)).

Finally, define hmin⁡(Λ)=inf⁡ρH∗(Λ(ρ))h_{\min}(\Lambda)=\inf_\rho H_*(\Lambda(\rho))hmin​(Λ)=infρ​H∗​(Λ(ρ)), where

H∗(Y)=sup⁡Smax⁡ ⁣{Re⁡tr⁡(YS)log⁡ ⁣(Re⁡tr⁡(YS))−Re⁡tr⁡(YSlog⁡YS), 0};H_*(Y)=\sup_{S} \max\!\left\{\operatorname{Re}\operatorname{tr}(Y_S)\log\!\bigl(\operatorname{Re}\operatorname{tr}(Y_S)\bigr) -\operatorname{Re}\operatorname{tr}(Y_S\log Y_S),\,0\right\};H∗​(Y)=Ssup​max{Retr(YS​)log(Retr(YS​))−Retr(YS​logYS​),0};

SSS ranges over all finite subsets of the output index set, including the empty subset, YSY_SYS​ is the corresponding principal submatrix, and matrix functions use continuous functional calculus. The infimum is over the coefficient states defined by a summable nuclear expansion, nonnegative finite quadratic forms, and summable real diagonal of sum 111, which in these finite dimensions are density matrices; its values lie in [0,∞][0,\infty][0,∞]. Then all three assertions hold:

∀p≥1,νp(P)=νp(Ω)νp(Φ),hmin⁡(P)=hmin⁡(Ω)+hmin⁡(Φ),χ(P)=χ(Ω)+χ(Φ).\forall p\ge1,\quad \nu_p(\mathcal P)=\nu_p(\Omega)\nu_p(\Phi), \qquad h_{\min}(\mathcal P)=h_{\min}(\Omega)+h_{\min}(\Phi), \qquad \chi(\mathcal P)=\chi(\Omega)+\chi(\Phi).∀p≥1,νp​(P)=νp​(Ω)νp​(Φ),hmin​(P)=hmin​(Ω)+hmin​(Φ),χ(P)=χ(Ω)+χ(Φ).

The entropy-minimum equality is an equality of extended nonnegative real numbers, including possible infinite values.

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

    Confirmed by the moderator at approval.

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