Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6: optimized qq sum-information additivity

Open
QAlgorithms.Papers.Independent.Support50.P02.degradable_sum_additive

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

prove2quantum

Let N:A′B′→C\mathcal N:A'B'\to CN:A′B′→C be a completely positive, trace-preserving channel between finite, positive-dimensional complex quantum registers. Alice and Bob control separate inputs. Codes use independent sender preparations, local encoders, one joint memoryless channel and one joint decoder, with external references untouched and no free shared resources. Fidelity is squared Uhlmann fidelity, trace distance is the full trace norm, and entropies are in bits. Write CQ(N)CQ(\mathcal N)CQ(N) and Q(N)Q(\mathcal N)Q(N) for the closed operational classical–quantum and quantum–quantum capacity regions, using joint output fidelity and nonnegative rates.

For independent pure states Ψ1AA′\Psi_1^{AA'}Ψ1AA′​ and Ψ2BB′\Psi_2^{BB'}Ψ2BB′​, let σABC=(id⁡AB⊗N)(Ψ1⊗Ψ2)\sigma^{ABC}=(\operatorname{id}_{AB}\otimes\mathcal N)(\Psi_1\otimes\Psi_2)σABC=(idAB​⊗N)(Ψ1​⊗Ψ2​). Every information quantity in a fixed set of inequalities is evaluated on this same state. Here Ic(U⟩V)=H(V)−H(UV)I_c(U\rangle V)=H(V)-H(UV)Ic​(U⟩V)=H(V)−H(UV) and HHH is entropy in bits.

Suppose N\mathcal NN is degradable: for an isometric extension U:A′B′→CEU:A'B'\to CEU:A′B′→CE there is a CPTP map D:C→E\mathcal D:C\to ED:C→E with Nc=D∘N\mathcal N^c=\mathcal D\circ\mathcal NNc=D∘N, using the complement of that same extension. Define J(M)=max⁡Ψ1⊗Ψ2Ic(AB⟩C)σJ(\mathcal M)=\max_{\Psi_1\otimes\Psi_2}I_c(AB\rangle C)_\sigmaJ(M)=maxΨ1​⊗Ψ2​​Ic​(AB⟩C)σ​. For every positive integer kkk,

J(N⊗k)=kJ(N).J(\mathcal N^{\otimes k})=kJ(\mathcal N).J(N⊗k)=kJ(N).

The optimization retains product inputs between senders and allows correlations across uses within either sender. This concerns the optimized information sum, not single-letterization of the full region.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P02
Formal statement
noncomputable section

open scoped BigOperators Matrix ComplexConjugate

namespace QAlgorithms.Papers.Independent.Support50.P02

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

open QAlgorithms.Papers.Independent.Information100.P21 (Op)

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

open QAlgorithms.Papers.Independent.Dependency50.P19 (epr)

attribute [local instance] Classical.propDecidable Classical.decEq

variable {A B C E R S I J : Type*}

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

variable [Fintype C] [DecidableEq C] [Fintype E] [DecidableEq E]

variable [Fintype R] [DecidableEq R] [Fintype S] [DecidableEq S]

variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]

/-- Optimized qq sum-information additivity, PDF p.30, repeated uses of ONE
channel. Degradability uses the receiver and complement of the SAME dilation;
no joint entangled sender input or signed capacity conclusion is asserted. -/
theorem degradable_sum_additive [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty E]
    (U : Matrix (C × E) (A × B) ℂ) (hU : IsDegradable U) (n : ℕ) (hn : 0 < n) :
    optimizedSum (macPower (receiverChannel U) n) = (n : ℝ) * optimizedSum (receiverChannel U) := by sorry

end QAlgorithms.Papers.Independent.Support50.P02

end
Source
Capacity Theorems for Quantum Multiple Access Channels: Classical-Quantum and Quantum-Quantum Capacity Regions, arXiv:quant-ph/0501045v3, PDF p. 30, §6: optimized qq sum-information additivity
Read-back

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

Let A,B,C,EA,B,C,EA,B,C,E be nonempty finite types with decidable equality, and let UUU be a complex matrix from A×BA\times BA×B to C×EC\times EC×E. Assume U†U=IU^\dagger U=IU†U=I and that there is a channel D:C→ED:C\to ED:C→E such that, for every matrix XXX on A×BA\times BA×B,

Tr⁡C(UXU†)=D ⁣(Tr⁡E(UXU†)).\operatorname{Tr}_C(UXU^\dagger) =D\!\left(\operatorname{Tr}_E(UXU^\dagger)\right).TrC​(UXU†)=D(TrE​(UXU†)).

Here a channel has a finite Kraus representation D(Y)=∑jLjYLj†D(Y)=\sum_jL_jYL_j^\daggerD(Y)=∑j​Lj​YLj†​ with ∑jLj†Lj=I\sum_jL_j^\dagger L_j=I∑j​Lj†​Lj​=I. Define N(X)=Tr⁡E(UXU†)N(X)=\operatorname{Tr}_E(UXU^\dagger)N(X)=TrE​(UXU†), and for any channel T:P×Q→ZT:P\times Q\to ZT:P×Q→Z define

Qsum(T)=sup⁡a,b∈N, a,b>0α∈Ca×P, ∥α∥=1β∈Cb×Q, ∥β∥=1[S(ωZ)−S(ω)],ω=(id⁡a×b⊗T)([α]⊗[β]),Q_{\mathrm{sum}}(T)= \sup_{\substack{a,b\in\mathbb N,\ a,b>0\\ \alpha\in\mathbb C^{a\times P},\ \|\alpha\|=1\\ \beta\in\mathbb C^{b\times Q},\ \|\beta\|=1}} \left[S(\omega_Z)-S(\omega)\right], \quad \omega=(\operatorname{id}_{a\times b}\otimes T) ([\alpha]\otimes[\beta]),Qsum​(T)=a,b∈N, a,b>0α∈Ca×P, ∥α∥=1β∈Cb×Q, ∥β∥=1​sup​[S(ωZ​)−S(ω)],ω=(ida×b​⊗T)([α]⊗[β]),

where references are grouped before inputs, [v]=vv†[v]=vv^\dagger[v]=vv†, ωZ\omega_ZωZ​ is the partial trace over both references, and S(X)=−Re⁡tr⁡f(X)S(X)=-\operatorname{Re}\operatorname{tr}f(X)S(X)=−Retrf(X) with f(x)=xlog⁡2xf(x)=x\log_2xf(x)=xlog2​x applied by continuous functional calculus. Then, for every natural number n>0n>0n>0,

Qsum(N⊗n)=n Qsum(N),Q_{\mathrm{sum}}(N^{\otimes n})=n\,Q_{\mathrm{sum}}(N),Qsum​(N⊗n)=nQsum​(N),

where the block channel has inputs An×BnA^n\times B^nAn×Bn and output CnC^nCn. In the supremum on the left, each sender’s unit vector may involve its whole block and an arbitrary positive reference dimension. The assertion excludes n=0n=0n=0.

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

    Confirmed by the moderator at approval.

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