Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Abstract main result; §V (49): non-signalling and entanglement-assisted quantum capacities coincide

Open
QAlgorithms.Papers.Independent.Support50.P11.nonSignalling_capacity_eq_entanglementAssisted

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

prove2quantum

Let N:A′→B\mathcal N:A'\to BN:A′→B be any CPTP channel between positive finite-dimensional systems with fixed computational bases. For assistance class Ω\OmegaΩ, let FΩ(N,K)F^\Omega(\mathcal N,K)FΩ(N,K) be the supremum of normalized entanglement fidelities of actual forward-assisted bipartite codes of size KKK. Define the operational memoryless capacity by

QΩ(N)=sup⁡{r≥0:lim⁡n→∞FΩ(N⊗n,⌊2nr⌋)=1}.Q^\Omega(\mathcal N)=\sup\{r\ge0:\lim_{n\to\infty}F^\Omega(\mathcal N^{\otimes n},\lfloor2^{nr}\rfloor)=1\}.QΩ(N)=sup{r≥0:n→∞lim​FΩ(N⊗n,⌊2nr⌋)=1}.

Here NS imposes non-signalling in both directions on the code, and EA permits arbitrary shared states and local operations. Then

QNS(N)=QEA(N).Q^{\mathrm{NS}}(\mathcal N)=Q^{\mathrm{EA}}(\mathcal N).QNS(N)=QEA(N).

The equality concerns parallel memoryless blocks and operational vanishing entanglement error, with rates in qubits per use.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P11
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder ENNReal

namespace QAlgorithms.Papers.Independent.Support50.P11

open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing permutationMatrix)

open QAlgorithms.Papers.Independent.Information100.P21 (pt)

open QAlgorithms.Papers.Independent.Dependency50.P09 (tensorAction)

open QAlgorithms.Papers.Independent.Information100.P76 (swapMatrix)

open QAlgorithms.Papers.Independent.Information100.P69 (replacer)

open QAlgorithms.Papers.Independent.Gap20.P19 (wernerIsometry)

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

section Statements

variable {I O : Type} [Fintype I] [Nonempty I] [Fintype O] [Nonempty O]

/-- PDF p.8, (49), abstract p.1: the two operational memoryless quantum capacities coincide. -/
theorem nonSignalling_capacity_eq_entanglementAssisted
    (N : Superop I O) (hN : IsChannel N) : quantumCodeCapacity .NS N = quantumCodeCapacity .EA N := by sorry

end Statements

end QAlgorithms.Papers.Independent.Support50.P11

end
Source
On the power of PPT-preserving and non-signalling codes, arXiv:1406.7142v2, PDF p. 8, Abstract main result; §V (49): non-signalling and entanglement-assisted quantum capacities coincide
Read-back

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

For finite input and output index types I,OI,OI,O, with the finite structures and decidable equality required by the definitions, let NNN be a channel from matrices on III to matrices on OOO: explicitly, there are finitely many matrices AjA_jAj​ such that N(X)=∑jAjXAj†N(X)=\sum_jA_jXA_j^\daggerN(X)=∑j​Aj​XAj†​ for every XXX and ∑jAj†Aj=I\sum_jA_j^\dagger A_j=I∑j​Aj†​Aj​=I. The assertion is equality of the following two extended nonnegative real capacities. To define them, a size-KKK forward code for a channel TTT is a channel ZZZ from {0,…,K−1}×O\{0,\ldots,K-1\}\times O{0,…,K−1}×O to I×{0,…,K−1}I\times\{0,\ldots,K-1\}I×{0,…,K−1} for which some channel EEE satisfies Tr⁡KZ(X)=E(Tr⁡OX)\operatorname{Tr}_{K}Z(X)=E(\operatorname{Tr}_{O}X)TrK​Z(X)=E(TrO​X) for every matrix XXX. In the non-signalling class, one additionally requires a channel DDD with Tr⁡IZ(X)=D(Tr⁡KX)\operatorname{Tr}_{I}Z(X)=D(\operatorname{Tr}_{K}X)TrI​Z(X)=D(TrK​X) for every XXX. In the entanglement-assisted class, one instead requires positive integers l,rl,rl,r, a positive semidefinite trace-one matrix σ\sigmaσ on registers L,RL,RL,R of sizes l,rl,rl,r, and channels E:K×L→IE:K\times L\to IE:K×L→I, D:O×R→KD:O\times R\to KD:O×R→K, such that ZZZ adjoins σ\sigmaσ, regroups the registers as (K,L),(O,R)(K,L),(O,R)(K,L),(O,R), and applies E⊗DE\otimes DE⊗D. For either class, form the linked map

LT,Z(X)bc=∑a,a′,i,j,β,γXaa′ T(Eij)βγ Z(E(a,β),(a′,γ))(i,b),(j,c).\mathcal L_{T,Z}(X)_{bc} = \sum_{a,a',i,j,\beta,\gamma} X_{aa'}\,T(E_{ij})_{\beta\gamma}\, Z(E_{(a,\beta),(a',\gamma)})_{(i,b),(j,c)}.LT,Z​(X)bc​=a,a′,i,j,β,γ∑​Xaa′​T(Eij​)βγ​Z(E(a,β),(a′,γ)​)(i,b),(j,c)​.

Its score for K>0K>0K>0 is Re⁡Tr⁡ ⁣[ΩKΩK†(id⁡K⊗LT,Z)(ΩKΩK†)]\operatorname{Re}\operatorname{Tr}\!\left[\Omega_K\Omega_K^\dagger(\operatorname{id}_K\otimes\mathcal L_{T,Z})(\Omega_K\Omega_K^\dagger)\right]ReTr[ΩK​ΩK†​(idK​⊗LT,Z​)(ΩK​ΩK†​)], where ΩK(a,b)=1a=b/K\Omega_K(a,b)=\mathbf1_{a=b}/\sqrt KΩK​(a,b)=1a=b​/K​; for K=0K=0K=0 the score is defined as zero. Let Fc(T,K)F_c(T,K)Fc​(T,K) be the real supremum of these scores over class-ccc forward codes. The class-ccc capacity is the extended nonnegative supremum of all real r≥0r\ge0r≥0 for which

Fc ⁣(N⊗n,⌊2nr⌋N)⟶1(n→∞).F_c\!\left(N^{\otimes n},\left\lfloor2^{nr}\right\rfloor_{\mathbb N}\right)\longrightarrow1 \quad(n\to\infty).Fc​(N⊗n,⌊2nr⌋N​)⟶1(n→∞).

Here the tensor map is defined on matrix units by tensoring their images, equivalently (N⊗nX)yz=∑x,x′Xxx′∏i<nN(Exixi′)yizi(N^{\otimes n}X)_{yz}=\sum_{x,x'}X_{xx'}\prod_{i<n}N(E_{x_i x_i'} )_{y_i z_i}(N⊗nX)yz​=∑x,x′​Xxx′​∏i<n​N(Exi​xi′​​)yi​zi​​; the sequence includes n=0n=0n=0, using empty products equal to 111. The theorem states that the capacity obtained from the non-signalling class equals that obtained from the entanglement-assisted class.

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

    Confirmed by the moderator at approval.

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