Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7.1: controlled erasure MAC cq capacity

Open
QAlgorithms.Papers.Independent.Support50.P02.erasure_cq

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

prove2quantum

Let d≥1d\ge1d≥1. Alice has a qubit, Bob a ddd-dimensional register, and Charlie a d+1d+1d+1-dimensional register with an orthogonal erasure flag ∣e⟩|e\rangle∣e⟩. The controlled-erasure MAC measures Alice in the computational basis: outcome 000 discards Bob's input and outputs the flag; outcome 111 transfers Bob's input coherently to the nonflag subspace. Thus, for density operators τ,ρ\tau,\rhoτ,ρ,

Ed(τ⊗ρ)=τ00∣e⟩⟨e∣+τ11ρ.\mathcal E_d(\tau\otimes\rho)=\tau_{00}|e\rangle\langle e|+\tau_{11}\rho.Ed​(τ⊗ρ)=τ00​∣e⟩⟨e∣+τ11​ρ.

With nonnegative cq operational rates, squared joint fidelity, and entropy in bits,

CQ(Ed)={(r,S)≥0:∃q∈[0,1/2], r≤H2(q), S≤(1−2q)log⁡2d}=CQ(1)(Ed).CQ(\mathcal E_d)=\{(r,S)\ge0:\exists q\in[0,1/2],\ r\le H_2(q),\ S\le(1-2q)\log_2d\}=CQ^{(1)}(\mathcal E_d).CQ(Ed​)={(r,S)≥0:∃q∈[0,1/2], r≤H2​(q), S≤(1−2q)log2​d}=CQ(1)(Ed​).

Here H2H_2H2​ is binary entropy and the single-letter region uses non-strict boundaries. This is the complete capacity equality, not just an achievable Bell-input point.

Formalization Note The printed Kraus family on p.32 is corrected to agree with the prose and displayed product-input action; transfer coherences are preserved.

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]

/-- Boundary-inclusive erasure cq formula, PDF p.8 and §7.1 pp.32–33.
The channel follows the corrected prose-defined Kraus family, not the erroneous
printed family. At d=1 this still includes the full classical bit interval. -/
theorem erasure_cq (d : ℕ) (hd : 0 < d) :
    cqMacCapacity (controlledErasure d) =
      {r | Nonnegative r ∧ ∃ q : ℝ, 0 ≤ q ∧ q ≤ 1 / 2 ∧
        r.1 ≤ binEntropy2 q ∧ r.2 ≤ (1 - 2 * q) * Real.logb 2 d} ∧
    cqMacCapacity (controlledErasure d) = cqOne (controlledErasure d) none := 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, §7.1: controlled erasure MAC cq capacity
Read-back

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

For every natural number d>0d>0d>0, let Ed\mathcal E_dEd​ be the matrix map that sends the trace of the false-control diagonal block to an extra output index ⊥\bot⊥, retains the true-control block on {0,…,d−1}\{0,\ldots,d-1\}{0,…,d−1}, and sets the mixed ⊥\bot⊥ entries to zero. Its classical–quantum generation capacity region is asserted to satisfy both

Ccq(Ed)={(r1,r2)∈R2:r1,r2≥0, ∃q∈[0,12], r1≤h2(q), r2≤(1−2q)log⁡2d}=R1(Ed).\mathcal C_{\mathrm{cq}}(\mathcal E_d) =\left\{(r_1,r_2)\in\mathbb R^2: r_1,r_2\ge0,\ \exists q\in[0,\tfrac12],\ r_1\le h_2(q),\ r_2\le(1-2q)\log_2 d\right\} =\mathcal R_1(\mathcal E_d).Ccq​(Ed​)={(r1​,r2​)∈R2:r1​,r2​≥0, ∃q∈[0,21​], r1​≤h2​(q), r2​≤(1−2q)log2​d}=R1​(Ed​).

Here h2(q)=binEntropy⁡(q)/log⁡2h_2(q)=\operatorname{binEntropy}(q)/\log 2h2​(q)=binEntropy(q)/log2, with binEntropy⁡(q)=−qlog⁡q−(1−q)log⁡(1−q)\operatorname{binEntropy}(q)=-q\log q-(1-q)\log(1-q)binEntropy(q)=−qlogq−(1−q)log(1−q). The region Ccq\mathcal C_{\mathrm{cq}}Ccq​ means the closure in R2\mathbb R^2R2 of the nonnegative pairs rrr such that, for every ϵ,δ>0\epsilon,\delta>0ϵ,δ>0, there is an integer n0>0n_0>0n0​>0 for which every n≥n0n\ge n_0n≥n0​ admits positive integers m,km,km,k, unit vectors αs\alpha_sαs​ on the nnn Boolean inputs for each s<ms<ms<m, a unit vector β\betaβ on a kkk-dimensional reference register and the nnn ddd-dimensional inputs, and a decoding channel from the nnn outputs to an mmm-dimensional classical register and a kkk-dimensional register, with

r1−δ≤log⁡2mn,r2−δ≤log⁡2kn,1−ϵ≤1m∑s<mF ⁣(∣s⟩⟨s∣⊗Φk, ω^s).r_1-\delta\le\frac{\log_2 m}{n},\qquad r_2-\delta\le\frac{\log_2 k}{n},\qquad 1-\epsilon\le\frac1m\sum_{s<m}F\!\left( |s\rangle\langle s|\otimes\Phi_k,\ \widehat\omega_s\right).r1​−δ≤nlog2​m​,r2​−δ≤nlog2​k​,1−ϵ≤m1​s<m∑​F(∣s⟩⟨s∣⊗Φk​, ωs​).

The state ω^s\widehat\omega_sωs​ results from applying Ed\mathcal E_dEd​ independently to the nnn input pairs in ∣αs⟩⟨αs∣⊗∣β⟩⟨β∣|\alpha_s\rangle\langle\alpha_s|\otimes|\beta\rangle\langle\beta|∣αs​⟩⟨αs​∣⊗∣β⟩⟨β∣, applying the decoder while retaining the reference, and deleting entries between distinct classical output labels; Φk\Phi_kΦk​ has entries 1/k1/k1/k between pairs of matching reference and output labels and zero elsewhere. A channel means a map X↦∑jKjXKj†X\mapsto\sum_jK_jXK_j^\daggerX↦∑j​Kj​XKj†​ for a finite family with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I. The squared fidelity is

F(X,Y)=(Re⁡tr⁡X YX)2.F(X,Y)=\left(\operatorname{Re}\operatorname{tr} \sqrt{\sqrt X\,Y\sqrt X}\right)^2.F(X,Y)=(RetrX​YX​​)2.

The region R1\mathcal R_1R1​ consists of nonnegative pairs obtained from some finite ensemble of unit vectors αx\alpha_xαx​ on the Boolean input, with weights wx≥0w_x\ge0wx​≥0 summing to one, and some unit vector β\betaβ on a positive-dimensional reference RRR and the ddd-dimensional input: writing ωx=(idR⊗Ed)(∣αx⟩⟨αx∣⊗∣β⟩⟨β∣)\omega_x=(\mathrm{id}_R\otimes\mathcal E_d)(|\alpha_x\rangle\langle\alpha_x|\otimes|\beta\rangle\langle\beta|)ωx​=(idR​⊗Ed​)(∣αx​⟩⟨αx​∣⊗∣β⟩⟨β∣), ωˉ=∑xwxωx\bar\omega=\sum_xw_x\omega_xωˉ=∑x​wx​ωx​, and ωxC=tr⁡Rωx\omega_x^C=\operatorname{tr}_R\omega_xωxC​=trR​ωx​, its bounds are

r1≤S(tr⁡Rωˉ)−∑xwxS(ωxC),r2≤∑xwx(S(ωxC)−S(ωx)).r_1\le S(\operatorname{tr}_R\bar\omega)-\sum_xw_xS(\omega_x^C), \qquad r_2\le\sum_xw_x\bigl(S(\omega_x^C)-S(\omega_x)\bigr).r1​≤S(trR​ωˉ)−x∑​wx​S(ωxC​),r2​≤x∑​wx​(S(ωxC​)−S(ωx​)).

Here S(X)=−Re⁡tr⁡[f(X)]S(X)=-\operatorname{Re}\operatorname{tr}[f(X)]S(X)=−Retr[f(X)], where f(t)=tlog⁡2tf(t)=t\log_2tf(t)=tlog2​t is applied by continuous functional calculus. There is no bound on the ensemble size in R1\mathcal R_1R1​. The case d=1d=1d=1 is included, in which the displayed region forces r2=0r_2=0r2​=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