Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5: cq scenario equivalence

Open
QAlgorithms.Papers.Independent.Support50.P02.cq_scenarios

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 i=I,II,IIIi=I,II,IIIi=I,II,III, let CQi(N)CQ_i(\mathcal N)CQi​(N) be the closure of achievable cq rates for entanglement generation, entanglement transmission, and strong subspace transmission, respectively. The first two use uniform classical messages and average joint classical/Bell fidelity. The third requires the joint classical/quantum fidelity bound for every message and every pure reference/input state of Bob, permitting private stochastic classical encoding. Then

CQI(N)=CQII(N)=CQIII(N).CQ_I(\mathcal N)=CQ_{II}(\mathcal N)=CQ_{III}(\mathcal N).CQI​(N)=CQII​(N)=CQIII​(N).

This identifies the three operational tasks asymptotically, not their exact finite-code performances.

Formalization Note The strong task tests the original message, consistent with the inverse cyclic relabeling on p.25. Extra channel blocks used to establish random seeds count toward the blocklength; there is no free shared seed.

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]

/-- CQ scenario equivalence, PDF p.7 and §§5.2–5.4, pp.24–29.
The strong criterion tests m, with the p.25 inverse relabeling correction.
Shared seeds in the proof are generated by extra channel blocks and charged;
p.29 derandomization requires existence of a good seed, not every seed. -/
theorem cq_scenarios [Nonempty A] [Nonempty B] [Nonempty C]
    (N : Superop (A × B) C) (hN : IsChannel N) :
    cqMacCapacity N .generation = cqMacCapacity N .transmission ∧
    cqMacCapacity N .transmission = cqMacCapacity N .strong := 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. 7, §5: cq scenario equivalence
Read-back

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

For any nonempty finite types A,B,CA,B,CA,B,C with decidable equality and any channel N:A×B→CN:A\times B\to CN:A×B→C, the three classical–quantum operational regions satisfy

Cgeneration=Ctransmission,Ctransmission=Cstrong.\mathcal C_{\mathrm{generation}} =\mathcal C_{\mathrm{transmission}}, \qquad \mathcal C_{\mathrm{transmission}} =\mathcal C_{\mathrm{strong}}.Cgeneration​=Ctransmission​,Ctransmission​=Cstrong​.

Each region is the closure of the nonnegative rates (r1,r2)(r_1,r_2)(r1​,r2​) such that, for every ϵ,δ>0\epsilon,\delta>0ϵ,δ>0, every sufficiently large positive integer nnn admits positive integers m,km,km,k with log⁡2m/n≥r1−δ\log_2m/n\ge r_1-\deltalog2​m/n≥r1​−δ, log⁡2k/n≥r2−δ\log_2k/n\ge r_2-\deltalog2​k/n≥r2​−δ, and a code of the indicated kind. Set [v]=vv†[v]=vv^\dagger[v]=vv†, let EkE_kEk​ have entries 1/k1/k1/k between (i,i)(i,i)(i,i) and (j,j)(j,j)(j,j) and zero elsewhere, and use squared fidelity F(X,Y)=(Re⁡tr⁡X Y X)2F(X,Y)=\bigl(\operatorname{Re}\operatorname{tr}\sqrt{\sqrt X\,Y\,\sqrt X}\bigr)^2F(X,Y)=(RetrX​YX​​)2. A generation code supplies unit vectors αs\alpha_sαs​ on AnA^nAn, a unit vector β\betaβ on k×Bnk\times B^nk×Bn, and a decoding channel D:Cn→m×kD:C^n\to m\times kD:Cn→m×k; the average over s<ms<ms<m of the squared fidelity between ∣s⟩⟨s∣⊗Ek|s\rangle\langle s|\otimes E_k∣s⟩⟨s∣⊗Ek​ and the decoded output must be at least 1−ϵ1-\epsilon1−ϵ, where N⊗nN^{\otimes n}N⊗n acts on the two inputs, the reference is untouched, and entries between unequal decoded message labels are set to zero. A transmission code has the same condition, but Bob’s source is (id⁡k⊗E)(Ek)(\operatorname{id}_k\otimes E)(E_k)(idk​⊗E)(Ek​) for an encoding channel E:k→BnE:k\to B^nE:k→Bn. A strong code permits density matrices ρs\rho_sρs​ for Alice and requires encoding and decoding channels such that, for every message sss, every positive reference dimension ttt, and every unit vector ψ\psiψ on t×kt\times kt×k, the corresponding dephased decoded output has squared fidelity at least 1−ϵ1-\epsilon1−ϵ with ∣s⟩⟨s∣⊗[ψ]|s\rangle\langle s|\otimes[\psi]∣s⟩⟨s∣⊗[ψ], using input ρs⊗(id⁡t⊗E)([ψ])\rho_s\otimes(\operatorname{id}_t\otimes E)([\psi])ρs​⊗(idt​⊗E)([ψ]). Coordinates are regrouped to place references first. All density matrices are positive semidefinite with trace one, and every channel mentioned, including NNN, has a finite Kraus representation with Kraus operators LjL_jLj​ satisfying ∑jLj†Lj=I\sum_jL_j^\dagger L_j=I∑j​Lj†​Lj​=I.

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