Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Definitions for Additivity for a class of unital qubit channels

Definition
QAlgorithms_Papers_Independent_Support50_P13

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

prove2quantum

The objects the formalized statements of Additivity for a class of unital qubit channels (arXiv:quant-ph/0103156) are stated in. Each was checked against the paper by a blind read-back and a moderator.

  • ultimateCapacityNats: PDF p.4, Remark 2: operational unassisted classical capacity, converted from bits to nats. The accepted code model allows arbitrary block input states and collective POVMs, and provides no prior sender-receiver entanglement.
  • normalizedHolevoRate: PDF p.4, (8): normalized Holevo quantity of the actual n-use tensor channel. The n=0 extension is zero and is irrelevant to the ordinary limit at infinity.
Definition code
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P03
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P23
import Definitions.Def_QAlgorithms_Papers_Independent_Next46_P42

/-!
King, arXiv:quant-ph/0103156v2, Additivity for unital qubit channels.
Page numbers are PDF pages. Entropies and classical capacities are in nats.
Imports are pinned accepted libraries. All new definitions are paper-local.
Theorem 2 is an exact specialization of the accepted phaseDampingPNormBound;
its reuse record is in items.json, so it has no duplicate theorem here.
-/

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

/-- PDF p.4, Remark 2: operational unassisted classical capacity, converted from
bits to nats. The accepted code model allows arbitrary block input states and
collective POVMs, and provides no prior sender-receiver entanglement. -/
def ultimateCapacityNats {A B : Type} [Fintype A] [Fintype B]
    [DecidableEq A] [DecidableEq B] (Phi : Superop A B) : ℝ :=
  Real.log 2 * ordinaryClassicalCapacity Phi

/-- PDF p.4, (8): normalized Holevo quantity of the actual n-use tensor channel.
The n=0 extension is zero and is irrelevant to the ordinary limit at infinity. -/
def normalizedHolevoRate {A B : Type} [Fintype A] [Fintype B]
    [DecidableEq A] [DecidableEq B] (Phi : Superop A B) (n : ℕ) : ℝ :=
  holevoQuantity (piSuperop (fun _ : Fin n => Phi)) / (n : ℝ)

/-- Converting the operational capacity back from nats recovers the bit value. -/
example {A B : Type} [Fintype A] [Fintype B]
    [DecidableEq A] [DecidableEq B] (Phi : Superop A B) :
    ultimateCapacityNats Phi / Real.log 2 = ordinaryClassicalCapacity Phi := by
  have hlog : Real.log (2 : ℝ) ≠ 0 := ne_of_gt (Real.log_pos (by norm_num))
  unfold ultimateCapacityNats
  field_simp [hlog]

/-- The zero-length extension has the declared harmless value. -/
example {A B : Type} [Fintype A] [Fintype B]
    [DecidableEq A] [DecidableEq B] (Phi : Superop A B) :
    normalizedHolevoRate Phi 0 = 0 := by
  simp [normalizedHolevoRate]

end QAlgorithms.Papers.Independent.Support50.P13
Source
Additivity for a class of unital qubit channels, arXiv:quant-ph/0103156v2, https://arxiv.org/abs/quant-ph/0103156v2
Read-back

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

QAlgorithms.Papers.Independent.Support50.P13.normalizedHolevoRate

For any finite types A,BA,BA,B, each equipped with decidable equality, any function Φ:Mat⁡A(C)→Mat⁡B(C)\Phi:\operatorname{Mat}_A(\mathbb C)\to\operatorname{Mat}_B(\mathbb C)Φ:MatA​(C)→MatB​(C), and any natural number nnn, this defines

1nsup⁡e[H ⁣(∑ipiΦ[n](ρi))−∑ipiH ⁣(Φ[n](ρi))],H(X)=−Re⁡tr⁡(f(X)),f(t)=tlog⁡t.\frac1n\sup_e\left[ H\!\left(\sum_i p_i\Phi^{[n]}(\rho_i)\right) -\sum_i p_iH\!\left(\Phi^{[n]}(\rho_i)\right)\right], \qquad H(X)=-\operatorname{Re}\operatorname{tr}\bigl(f(X)\bigr),\quad f(t)=t\log t.n1​esup​[H(i∑​pi​Φ[n](ρi​))−i∑​pi​H(Φ[n](ρi​))],H(X)=−Retr(f(X)),f(t)=tlogt.

The supremum ranges over every finite ensemble e=(pi,ρi)i=0m−1e=(p_i,\rho_i)_{i=0}^{m-1}e=(pi​,ρi​)i=0m−1​, with arbitrary natural size mmm, real weights pi≥0p_i\ge0pi​≥0 summing to 111, and positive semidefinite matrices ρi\rho_iρi​ of trace 111 indexed by AnA^nAn; zero weights are allowed, while m=0m=0m=0 cannot satisfy the weight condition. The function f(X)f(X)f(X) is evaluated by continuous functional calculus, with the total real logarithm satisfying log⁡0=0\log0=0log0=0. Explicitly, for y,y′∈Bny,y'\in B^ny,y′∈Bn,

Φ[n](X)y,y′=∑x,x′∈AnXx,x′∏i=0n−1Φ(Exi,xi′)yi,yi′,\Phi^{[n]}(X)_{y,y'} =\sum_{x,x'\in A^n}X_{x,x'}\prod_{i=0}^{n-1} \Phi(E_{x_i,x_i'})_{y_i,y_i'},Φ[n](X)y,y′​=x,x′∈An∑​Xx,x′​i=0∏n−1​Φ(Exi​,xi′​​)yi​,yi′​​,

where Ea,a′E_{a,a'}Ea,a′​ is the corresponding matrix unit. No channel or linearity assumption is made on Φ\PhiΦ, and the finite types may be empty. At n=0n=0n=0 the defined rate is 000, because real division by zero gives 000. The real supremum is also total, giving 000 when its defining set is empty or unbounded above.

QAlgorithms.Papers.Independent.Support50.P13.ultimateCapacityNats

For any finite types A,BA,BA,B, each equipped with decidable equality, and any function Φ:Mat⁡A(C)→Mat⁡B(C)\Phi:\operatorname{Mat}_A(\mathbb C)\to\operatorname{Mat}_B(\mathbb C)Φ:MatA​(C)→MatB​(C), this defines the real number (log⁡2)Ccl(Φ)(\log 2)C_{\mathrm{cl}}(\Phi)(log2)Ccl​(Φ), where log⁡\loglog is the natural logarithm and Ccl(Φ)C_{\mathrm{cl}}(\Phi)Ccl​(Φ) is the supremum of all real r≥0r\ge0r≥0 satisfying the following condition: there is a sequence of positive integers MnM_nMn​ such that sn(Mn)→1s_n(M_n)\to1sn​(Mn​)→1 and, for every δ>0\delta>0δ>0, eventually r−δ≤log⁡2(Mn)/nr-\delta\le \log_2(M_n)/nr−δ≤log2​(Mn​)/n. Here

sn(M)=sup⁡ρ0,…,ρM−1 density matricesDj⪰0, ∑j=0M−1Dj=I1M∑j=0M−1Re⁡tr⁡ ⁣(DjΦ[n](ρj)),s_n(M)=\sup_{\substack{\rho_0,\ldots,\rho_{M-1}\text{ density matrices}\\ D_j\succeq0,\ \sum_{j=0}^{M-1}D_j=I}} \frac1M\sum_{j=0}^{M-1}\operatorname{Re}\operatorname{tr}\!\left(D_j\Phi^{[n]}(\rho_j)\right),sn​(M)=ρ0​,…,ρM−1​ density matricesDj​⪰0, ∑j=0M−1​Dj​=I​sup​M1​j=0∑M−1​Retr(Dj​Φ[n](ρj​)),

where the input matrices are indexed by AnA^nAn, the measurement matrices by BnB^nBn, a density matrix means a positive semidefinite matrix of trace 111, and the function Φ[n]\Phi^{[n]}Φ[n] is defined on every matrix XXX by

Φ[n](X)y,y′=∑x,x′∈AnXx,x′∏i=0n−1Φ(Exi,xi′)yi,yi′.\Phi^{[n]}(X)_{y,y'} =\sum_{x,x'\in A^n}X_{x,x'}\prod_{i=0}^{n-1} \Phi(E_{x_i,x_i'})_{y_i,y_i'}.Φ[n](X)y,y′​=x,x′∈An∑​Xx,x′​i=0∏n−1​Φ(Exi​,xi′​​)yi​,yi′​​.

The matrix Ea,a′E_{a,a'}Ea,a′​ has entry 111 at (a,a′)(a,a')(a,a′) and zero elsewhere, and log⁡2t=log⁡t/log⁡2\log_2 t=\log t/\log2log2​t=logt/log2. No channel, linearity, positivity, or nonemptiness assumption is imposed on Φ,A,B\Phi,A,BΦ,A,B. The sequences include n=0n=0n=0, with empty products equal to 111 and division by zero defined to give 000; all displayed real suprema use the total real supremum, which gives 000 for an empty set or a set unbounded above.

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