Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5: qq scenario equivalence

Open
QAlgorithms.Papers.Independent.Support50.P02.qq_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.

Let QI,QII,QIIIQ_I,Q_{II},Q_{III}QI​,QII​,QIII​ denote the closed qq rate regions for entanglement generation, entanglement transmission, and strong subspace transmission. Generation starts from independent pure reference/input preparations. Transmission applies separate local CPTP encoders to halves of independent Bell states. Strong transmission must preserve every pair of independent pure reference/input states, with arbitrary finite reference dimensions. In every case success uses one joint fidelity to the product target. Then

QI(N)=QII(N)=QIII(N).Q_I(\mathcal N)=Q_{II}(\mathcal N)=Q_{III}(\mathcal N).QI​(N)=QII​(N)=QIII​(N).

This permits the same closed region to describe all three tasks, without adding free shared randomness.

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]

/-- QQ scenario equivalence, PDF p.7 and §§5.2–5.4, pp.24–29.
Arbitrary references stay independent across senders; equality concerns CLOSED regions. -/
theorem qq_scenarios [Nonempty A] [Nonempty B] [Nonempty C]
    (N : Superop (A × B) C) (hN : IsChannel N) :
    qqMacCapacity N .generation = qqMacCapacity N .transmission ∧
    qqMacCapacity N .transmission = qqMacCapacity 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: qq 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 quantum–quantum operational regions satisfy

Qgeneration=Qtransmission,Qtransmission=Qstrong.\mathcal Q_{\mathrm{generation}} =\mathcal Q_{\mathrm{transmission}}, \qquad \mathcal Q_{\mathrm{transmission}} =\mathcal Q_{\mathrm{strong}}.Qgeneration​=Qtransmission​,Qtransmission​=Qstrong​.

Each is the closure of the nonnegative rates (r1,r2)(r_1,r_2)(r1​,r2​) for which, for every ϵ,δ>0\epsilon,\delta>0ϵ,δ>0, every sufficiently large positive blocklength nnn admits positive integers a,ba,ba,b with log⁡2a/n≥r1−δ\log_2a/n\ge r_1-\deltalog2​a/n≥r1​−δ, log⁡2b/n≥r2−δ\log_2b/n\ge r_2-\deltalog2​b/n≥r2​−δ, and an appropriate code. Write [v]=vv†[v]=vv^\dagger[v]=vv†, let EdE_dEd​ have entries 1/d1/d1/d between (i,i)(i,i)(i,i) and (j,j)(j,j)(j,j) and zero elsewhere, and let 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. Generation uses unit vectors α\alphaα on a×Ana\times A^na×An, β\betaβ on b×Bnb\times B^nb×Bn, and a decoding channel D:Cn→a×bD:C^n\to a\times bD:Cn→a×b, requiring squared fidelity at least 1−ϵ1-\epsilon1−ϵ between Ea⊗EbE_a\otimes E_bEa​⊗Eb​ and the output obtained by applying N⊗nN^{\otimes n}N⊗n and DDD while leaving both references untouched. Transmission instead uses encoding channels EA:a→AnE_A:a\to A^nEA​:a→An, EB:b→BnE_B:b\to B^nEB​:b→Bn, with source (id⁡a⊗EA)(Ea)⊗(id⁡b⊗EB)(Eb)(\operatorname{id}_a\otimes E_A)(E_a)\otimes(\operatorname{id}_b\otimes E_B)(E_b)(ida​⊗EA​)(Ea​)⊗(idb​⊗EB​)(Eb​), and imposes the same fidelity condition. Strong transmission uses such encoding and decoding channels and requires, for every positive pair of reference dimensions q,tq,tq,t and every pair of unit vectors ψ\psiψ on q×aq\times aq×a, ϕ\phiϕ on t×bt\times bt×b, squared fidelity at least 1−ϵ1-\epsilon1−ϵ between [ψ]⊗[ϕ][\psi]\otimes[\phi][ψ]⊗[ϕ] and its encoded, transmitted, and decoded output. In all these expressions coordinates are regrouped so that references precede channel inputs or outputs. Every channel mentioned is a map X↦∑jLjXLj†X\mapsto\sum_jL_jXL_j^\daggerX↦∑j​Lj​XLj†​ for a finite family 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