Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§V (45)–(48): comparison with the Matthews–Wehner bound

Proved
QAlgorithms.Papers.Independent.Support50.P11.nonSignalling_le_matthewsWehner

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

prove2quantum

Let N:A′→B\mathcal N:A'\to BN:A′→B be finite CPTP and K≥1K\ge1K≥1. Write NNN for its unnormalized Choi matrix, and define B(N,M)B(\mathcal N,M)B(N,M) as the supremum of Re⁡Tr⁡(NTΛ)\operatorname{Re}\operatorname{Tr}(N^T\Lambda)ReTr(NTΛ) over density matrices ρ\rhoρ and operators satisfying

0⪯Λ⪯ρ⊗IB,Tr⁡A′Λ⪯IB/M.0\preceq\Lambda\preceq\rho\otimes I_B,\qquad\operatorname{Tr}_{A'}\Lambda\preceq I_B/M.0⪯Λ⪯ρ⊗IB​,TrA′​Λ⪯IB​/M.

Then

FEA(N,K)≤FNS(N,K)≤B(N,K2).F^{\mathrm{EA}}(\mathcal N,K)\le F^{\mathrm{NS}}(\mathcal N,K)\le B(\mathcal N,K^2).FEA(N,K)≤FNS(N,K)≤B(N,K2).

The relaxation is an operator inequality on the marginal, retaining the same full-transpose objective. This compares the NS bound with the Matthews–Wehner bound in the form used here.

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, (45)--(48): the NS optimum lies below the relaxed SDP whose
marginal equality is replaced by a Loewner inequality. The (47) class typo is EA. -/
theorem nonSignalling_le_matthewsWehner
    (N : Superop I O) (hN : IsChannel N) (K : ℕ) (hK : 0 < K) :
    optimalCodeFidelity .EA N K ≤ optimalCodeFidelity .NS N K ∧ optimalCodeFidelity .NS N K ≤ relaxedBound N (K * K) := 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, §V (45)–(48): comparison with the Matthews–Wehner bound
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, every channel N:Mat⁡I(C)→Mat⁡O(C)N:\operatorname{Mat}_I(\mathbb C)\to\operatorname{Mat}_O(\mathbb C)N:MatI​(C)→MatO​(C) and positive integer KKK satisfy

FEA(N,K)≤FNS(N,K)≤sup⁡{Re⁡Tr⁡(JNTL):ρ⪰0, Tr⁡ρ=1,0⪯L⪯ρ⊗1O,Tr⁡IL⪯K−21O}.F_{\mathrm{EA}}(N,K)\le F_{\mathrm{NS}}(N,K)\le \sup\left\{\operatorname{Re}\operatorname{Tr}(J_N^{\mathsf T}L): \begin{array}{l} \rho\succeq0,\ \operatorname{Tr}\rho=1,\quad 0\preceq L\preceq\rho\otimes1_O,\\ \operatorname{Tr}_I L\preceq K^{-2}1_O \end{array}\right\}.FEA​(N,K)≤FNS​(N,K)≤sup{ReTr(JNT​L):ρ⪰0, Trρ=1,0⪯L⪯ρ⊗1O​,TrI​L⪯K−21O​​}.

Here (JN)(i,o),(j,o′)=[N(Eij)]o,o′(J_N)_{(i,o),(j,o')}=[N(E_{ij})]_{o,o'}(JN​)(i,o),(j,o′)​=[N(Eij​)]o,o′​, and Fc(N,K)F_c(N,K)Fc​(N,K) is the real supremum of Re⁡Tr⁡[ΦK(id⁡K⊗LN,Z)(ΦK)]\operatorname{Re}\operatorname{Tr}[\Phi_K(\operatorname{id}_K\otimes\mathcal L_{N,Z})(\Phi_K)]ReTr[ΦK​(idK​⊗LN,Z​)(ΦK​)] over codes in class ccc, with ΦK\Phi_KΦK​ the projector onto K−1/2∑a∣a,a⟩K^{-1/2}\sum_a|a,a\rangleK−1/2∑a​∣a,a⟩ and

[LN,Z(H)]bc=∑a,a′,i,j,o,o′Haa′[N(Eij)]oo′[Z(E(a,o),(a′,o′))](i,b),(j,c).[\mathcal L_{N,Z}(H)]_{bc} =\sum_{a,a',i,j,o,o'}H_{aa'}[N(E_{ij})]_{oo'} [Z(E_{(a,o),(a',o')})]_{(i,b),(j,c)}.[LN,Z​(H)]bc​=a,a′,i,j,o,o′∑​Haa′​[N(Eij​)]oo′​[Z(E(a,o),(a′,o′)​)](i,b),(j,c)​.

Every code Z:Mat⁡K×O→Mat⁡I×KZ:\operatorname{Mat}_{K\times O}\to\operatorname{Mat}_{I\times K}Z:MatK×O​→MatI×K​ is a channel and has a channel EEE with Tr⁡KZ(H)=E(Tr⁡OH)\operatorname{Tr}_{K}Z(H)=E(\operatorname{Tr}_O H)TrK​Z(H)=E(TrO​H) for all HHH. The non-signalling class also requires a channel DDD with Tr⁡IZ(H)=D(Tr⁡KH)\operatorname{Tr}_I Z(H)=D(\operatorname{Tr}_{K}H)TrI​Z(H)=D(TrK​H). The entanglement-assisted class instead requires ZZZ to arise by adjoining a positive semidefinite trace-one state on finite positive-dimensional registers l,rl,rl,r, then applying local channels from K×lK\times lK×l to III and from O×rO\times rO×r to KKK. Channels have finite Kraus representations with ∑jAj†Aj=1\sum_jA_j^\dagger A_j=1∑j​Aj†​Aj​=1, and ⪯\preceq⪯ denotes positive semidefinite difference. The right-hand supremum uses the inequality Tr⁡IL⪯K−21O\operatorname{Tr}_I L\preceq K^{-2}1_OTrI​L⪯K−21O​, and K=1K=1K=1 is included.

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