Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered main result: Hadamard CQE single-letterization

Open
QAlgorithms.Papers.Independent.Gap20.P04.hadamardCQE

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

prove2quantum

Let N\mathcal NN be a CPTP channel on nonzero finite-dimensional registers, with receiver and environment obtained by tracing the same Stinespring isometry. Optimize over all finite classical labels XXX, probability distributions, and normalized pure conditional states on a finite reference AAA and input A′A'A′. For the resulting state, write χ=I(X;B)\chi=I(X;B)χ=I(X;B), q=I(A⟩BX)q=I(A\rangle BX)q=I(A⟩BX), a=H(A∣X)a=H(A|X)a=H(A∣X), and j=I(AX;B)j=I(AX;B)j=I(AX;B), with entropy in bits. Rates are nonnegative, and EEE denotes consumed ebits. The capacity regions are the closures of positive-blocklength scaled unions in Section III; their one-use unions have no added closure.

If the complementary channel is entanglement-breaking, then

CCQE(N)=CCQE(1)(N).\mathcal C_{CQE}(\mathcal N)=\mathcal C^{(1)}_{CQE}(\mathcal N).CCQE​(N)=CCQE(1)​(N).

Here a single common ensemble must satisfy all three constraints C+2Q≤jC+2Q\le jC+2Q≤j, Q≤q+EQ\le q+EQ≤q+E, and C+Q≤χ+q+EC+Q\le\chi+q+EC+Q≤χ+q+E. This identifies the full positive-consumption capacity region by one channel use.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P04
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap20.P04

open QAlgorithms

open QAlgorithms.Papers.Independent.Claimed50.P24
  (Dilation PhysicalDilation ChannelEB Hadamard EqualMax AdditiveMax
   dephasingDilation dephasingGamma cloningDilation)

open QAlgorithms.Papers.Independent.Information100.P67
  (receiverChannel complementaryChannel dilationPower)

open QAlgorithms.Papers.Independent.Information100.P32 (diagonal)

open QAlgorithms.Papers.Independent.Dependency50.P24 (ensembleHolevoBits)

open QAlgorithms.Papers.Independent.Gap48.P44 (cqTimeSharing ceTimeSharing)

open scoped BigOperators Matrix ComplexConjugate

attribute [local instance] Classical.propDecidable Classical.decEq

variable {I B E J D F : Type}

variable [Fintype I] [Fintype B] [Fintype E]

variable [Fintype J] [Fintype D] [Fintype F]

variable [DecidableEq I] [DecidableEq B] [DecidableEq E]

variable [DecidableEq J] [DecidableEq D] [DecidableEq F]

variable [Nonempty I] [Nonempty B] [Nonempty E]

variable [Nonempty J] [Nonempty D] [Nonempty F]

/-- PDF pp.1,9,11,16: Hadamard CQE single-letterization, consumption convention. -/
theorem hadamardCQE (U : Dilation I B E) (hU : PhysicalDilation U) (hH : Hadamard U) :
    capacityCQE U = oneCQE U := by sorry

end QAlgorithms.Papers.Independent.Gap20.P04

end
Source
Trade-off capacities of the quantum Hadamard channels, arXiv:1001.1732v2, PDF p. 1, Unnumbered main result: Hadamard CQE single-letterization
Read-back

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

Let I,B,EI,B,EI,B,E be finite nonempty types with decidable equality, and let UUU be a complex matrix with rows indexed by B×EB\times EB×E and columns indexed by III. Assume U†U=1U^\dagger U=1U†U=1, together with the explicit nonemptiness conditions on these three types. Define BU(ρ)=Tr⁡E(UρU†)\mathcal B_U(\rho)=\operatorname{Tr}_E(U\rho U^\dagger)BU​(ρ)=TrE​(UρU†) and EU(ρ)=Tr⁡B(UρU†)\mathcal E_U(\rho)=\operatorname{Tr}_B(U\rho U^\dagger)EU​(ρ)=TrB​(UρU†), where partial traces sum over the indicated coordinate. Assume also that EU\mathcal E_UEU​, after identifying its input and output types with finite index sets, has the following property: for every norm-one vector ϕ\phiϕ on a reference copy of III and III, the matrix (id⁡I⊗EU)(∣ϕ⟩⟨ϕ∣)(\operatorname{id}_I\otimes\mathcal E_U)(|\phi\rangle\langle\phi|)(idI​⊗EU​)(∣ϕ⟩⟨ϕ∣) is a finite convex combination ∑jwjAj⊗Dj\sum_j w_j A_j\otimes D_j∑j​wj​Aj​⊗Dj​, where wj≥0w_j\ge0wj​≥0, ∑jwj=1\sum_jw_j=1∑j​wj​=1, and every Aj,DjA_j,D_jAj​,Dj​ is positive semidefinite with trace one. For any such dilation VVV, define R(V)\mathcal R(V)R(V) as follows: a triple r=(r0,r1,r2)r=(r_0,r_1,r_2)r=(r0​,r1​,r2​) belongs to R(V)\mathcal R(V)R(V) precisely when all its coordinates are nonnegative and there exist positive integers L,RL,RL,R, probabilities px≥0p_x\ge0px​≥0 with ∑x=0L−1px=1\sum_{x=0}^{L-1}p_x=1∑x=0L−1​px​=1, and norm-one vectors ψx∈C{0,…,R−1}×IV\psi_x\in\mathbb C^{\{0,\ldots,R-1\}\times I_V}ψx​∈C{0,…,R−1}×IV​. Set ρx=Tr⁡{0,…,R−1}∣ψx⟩⟨ψx∣\rho_x=\operatorname{Tr}_{\{0,\ldots,R-1\}}|\psi_x\rangle\langle\psi_x|ρx​=Tr{0,…,R−1}​∣ψx​⟩⟨ψx​∣, ρˉ=∑xpxρx\bar\rho=\sum_xp_x\rho_xρˉ​=∑x​px​ρx​, and

Hin=∑xpxH(ρx),HB=H(BV(ρˉ)),HB∣X=∑xpxH(BV(ρx)),HE∣X=∑xpxH(EV(ρx)),H_{\rm in}=\sum_xp_xH(\rho_x),\quad H_B=H(\mathcal B_V(\bar\rho)),\quad H_{B|X}=\sum_xp_xH(\mathcal B_V(\rho_x)),\quad H_{E|X}=\sum_xp_xH(\mathcal E_V(\rho_x)),Hin​=x∑​px​H(ρx​),HB​=H(BV​(ρˉ​)),HB∣X​=x∑​px​H(BV​(ρx​)),HE∣X​=x∑​px​H(EV​(ρx​)),

where H(ρ)=−Re⁡Tr⁡[ ( x↦xlog⁡2x )(ρ) ]H(\rho)=-\operatorname{Re}\operatorname{Tr}[\,(\,x\mapsto x\log_2x\,)(\rho)\,]H(ρ)=−ReTr[(x↦xlog2​x)(ρ)], with the matrix function evaluated by continuous functional calculus and 0log⁡20=00\log_2 0=00log2​0=0. Writing χ=HB−HB∣X\chi=H_B-H_{B|X}χ=HB​−HB∣X​, C=HB∣X−HE∣XC=H_{B|X}-H_{E|X}C=HB∣X​−HE∣X​, and J=Hin+HB−HE∣XJ=H_{\rm in}+H_B-H_{E|X}J=Hin​+HB​−HE∣X​, the required inequalities are r0+2r1≤Jr_0+2r_1\le Jr0​+2r1​≤J, r1≤C+r2r_1\le C+r_2r1​≤C+r2​, and r0+r1≤χ+C+r2r_0+r_1\le\chi+C+r_2r0​+r1​≤χ+C+r2​. The theorem asserts

{r∈R3:∃n∈N, n>0, nr∈R(U[n])}‾=R(U),U(b,e),a[n]=∏i=0n−1U(bi,ei),ai.\overline{\left\{ r\in\mathbb R^3: \exists n\in\mathbb N,\ n>0,\ nr\in\mathcal R(U^{[n]}) \right\}} =\mathcal R(U), \qquad U^{[n]}_{(b,e),a}=\prod_{i=0}^{n-1}U_{(b_i,e_i),a_i}.{r∈R3:∃n∈N, n>0, nr∈R(U[n])}​=R(U),U(b,e),a[n]​=i=0∏n−1​U(bi​,ei​),ai​​.

The closure is in the usual topology, zero probabilities are permitted in the ensembles, and the union uses only positive block lengths.

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

    Confirmed by the moderator at approval.

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