Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2: regularized qq capacity pentagons

Open
QAlgorithms.Papers.Independent.Support50.P02.qq_regularized

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.

Let P(M)\mathcal P(\mathcal M)P(M) be the union over these inputs of the nonnegative rate pairs satisfying all three inequalities

R≤Ic(A⟩BC)σ,S≤Ic(B⟩AC)σ,R+S≤Ic(AB⟩C)σ.R\le I_c(A\rangle BC)_\sigma,\qquad S\le I_c(B\rangle AC)_\sigma,\qquad R+S\le I_c(AB\rangle C)_\sigma.R≤Ic​(A⟩BC)σ​,S≤Ic​(B⟩AC)σ​,R+S≤Ic​(AB⟩C)σ​.

Then

Q(N)=⋃k≥11kP(N⊗k)‾.Q(\mathcal N)=\overline{\bigcup_{k\ge1}\frac1k\mathcal P(\mathcal N^{\otimes k})}.Q(N)=k≥1⋃​k1​P(N⊗k)​.

The product constraint applies between senders, while each sender may entangle inputs across channel uses.

Formalization Note The printed strict signs are corrected to non-strict signs before closure, preserving zero-rate faces.

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]

/-- Theorem 2, PDF p.8, proof pp.17–22: product sender inputs, all THREE
bounds on one state. Same explicit non-strict boundary correction as Theorem 1.
The p.18 one-use N tensor n notation is read as N before subsequent k-blocking. -/
theorem qq_regularized [Nonempty A] [Nonempty B] [Nonempty C]
    (N : Superop (A × B) C) (hN : IsChannel N) :
    qqMacCapacity N = closure (regularized (fun n => qqOne (macPower N n))) := 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. 8, Theorem 2: regularized qq capacity pentagons
Read-back

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

For nonempty finite types A,B,CA,B,CA,B,C with decidable equality and a channel N:A×B→CN:A\times B\to CN:A×B→C, where “channel” means a map with a finite Kraus representation N(X)=∑jLjXLj†N(X)=\sum_jL_jXL_j^\daggerN(X)=∑j​Lj​XLj†​, ∑jLj†Lj=I\sum_jL_j^\dagger L_j=I∑j​Lj†​Lj​=I, the default, generation, quantum–quantum capacity is the closure of the following set of pairs. Choose any positive blocklength nnn, positive reference dimensions dA,dBd_A,d_BdA​,dB​, and unit vectors α∈CdA×An\alpha\in\mathbb C^{d_A\times A^n}α∈CdA​×An, β∈CdB×Bn\beta\in\mathbb C^{d_B\times B^n}β∈CdB​×Bn, and form

ω=(id⁡dA×dB⊗N⊗n)([α]⊗[β]),\omega=(\operatorname{id}_{d_A\times d_B}\otimes N^{\otimes n}) ([\alpha]\otimes[\beta]),ω=(iddA​×dB​​⊗N⊗n)([α]⊗[β]),

grouping the references before the inputs. A pair (r1,r2)(r_1,r_2)(r1​,r2​) belongs to this set exactly when some such choices give

r1,r2≥0,nr1≤S(ωRBC)−S(ω),nr2≤S(ωRAC)−S(ω),n(r1+r2)≤S(ωC)−S(ω).r_1,r_2\ge0,\qquad nr_1\le S(\omega_{R_BC})-S(\omega),\qquad nr_2\le S(\omega_{R_AC})-S(\omega),\qquad n(r_1+r_2)\le S(\omega_C)-S(\omega).r1​,r2​≥0,nr1​≤S(ωRB​C​)−S(ω),nr2​≤S(ωRA​C​)−S(ω),n(r1​+r2​)≤S(ωC​)−S(ω).

Here [v]=vv†[v]=vv^\dagger[v]=vv†, RA,RBR_A,R_BRA​,RB​ are the chosen references, CCC in a subscript denotes the whole output CnC^nCn, partial traces define the marginals, 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. The capacity on the left is the closure of nonnegative rates such that, for every ϵ,δ>0\epsilon,\delta>0ϵ,δ>0, every sufficiently large positive blocklength jjj admits positive integers a,ba,ba,b, with log⁡2a/j≥r1−δ\log_2a/j\ge r_1-\deltalog2​a/j≥r1​−δ, log⁡2b/j≥r2−δ\log_2b/j\ge r_2-\deltalog2​b/j≥r2​−δ, unit vectors on a×Aja\times A^ja×Aj and b×Bjb\times B^jb×Bj, and a decoding channel Cj→a×bC^j\to a\times bCj→a×b, whose reference–decoded output has squared fidelity at least 1−ϵ1-\epsilon1−ϵ with Ea⊗EbE_a\otimes E_bEa​⊗Eb​, after the corresponding coordinate regrouping. The matrix EdE_dEd​ has entries 1/d1/d1/d between (i,i)(i,i)(i,i) and (j,j)(j,j)(j,j) and zero elsewhere, and squared fidelity means (Re⁡tr⁡X Y X)2\bigl(\operatorname{Re}\operatorname{tr}\sqrt{\sqrt X\,Y\,\sqrt X}\bigr)^2(RetrX​YX​​)2. The existential blocklength on the right is strictly positive; reference dimensions are otherwise unrestricted.

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