Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sections 7.1–7.2 / (94),(101): resource wasting and tensor blocking

Open
QAlgorithms.Papers.Independent.Gap20.P07.error_wastingAndBlocking

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

prove2quantum

Let T,ST,ST,S be arbitrary CPTP channels on nonzero complex Hilbert spaces and let Δ(n,m)\Delta(n,m)Δ(n,m) be their computed full-cb simulation error for positive integers n,mn,mn,m. Then

Δ(n+1,m)≤Δ(n,m)≤Δ(n,m+1),\Delta(n+1,m)\le\Delta(n,m)\le\Delta(n,m+1),Δ(n+1,m)≤Δ(n,m)≤Δ(n,m+1),

and for all positive n1,n2,m1,m2n_1,n_2,m_1,m_2n1​,n2​,m1​,m2​,

Δ(n1+n2,m1+m2)≤Δ(n1,m1)+Δ(n2,m2).\Delta(n_1+n_2,m_1+m_2)\le\Delta(n_1,m_1)+\Delta(n_2,m_2).Δ(n1​+n2​,m1​+m2​)≤Δ(n1​,m1​)+Δ(n2​,m2​).

These are consequences of wasting resources and tensor blocking, not hypotheses imposed on the physical channel. The reference SSS may be noisy.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P07
Formal statement
noncomputable section

open Filter MeasureTheory

open scoped Topology ENNReal NNReal Matrix ComplexOrder ComplexConjugate

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus

namespace QAlgorithms.Papers.Independent.Gap20.P07

open QAlgorithms

open QAlgorithms.RealRegisters (Hilbert)

open QAlgorithms.Papers.Independent.Dependency50.P33
  (State IsTraceClass IsTraceClassChannel traceSize rankOne tensorApply)

open QAlgorithms.Papers.Independent.Frontier30.P14
  (Operation isometryCoeff conjugateKernel)

open QAlgorithms.Papers.Independent.Claimed50.P35
  (stabilizedTraceClassNorm traceClassTensorMap traceClassChannelPower
   transpose transposeBound TraceLinear tracePair MeasurePrepare)

open QAlgorithms.Papers.Independent.Gap48.P29 (fe FiniteCPMap)

/-- PDF pp.26--27, (94),(101): resource wasting and blocking are conclusions
about the computed physical-channel error, including noisy references. -/
theorem error_wastingAndBlocking {I J K L : Type}
    [Nonempty I] [Nonempty J] [Nonempty K] [Nonempty L]
    (T : Operation I J) (S : Operation K L)
    (hT : IsTraceClassChannel T) (hS : IsTraceClassChannel S) :
    ErrorMonotone (blockError T S) ∧ ErrorSubadditive (blockError T S) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P07

end
Source
Tema Con Variazioni: Quantum Channel Capacity, arXiv:quant-ph/0311037v1, PDF p. 26, Sections 7.1–7.2 / (94),(101): resource wasting and tensor blocking
Read-back

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

Let I,J,K,LI,J,K,LI,J,K,L be arbitrary nonempty types and let TTT from matrices on III to matrices on JJJ, and SSS from matrices on KKK to matrices on LLL, be trace class channels in the following sense: a matrix XXX is trace class when Xij=∑rur(i)vr(j)‾X_{ij}=\sum_r u_r(i)\overline{v_r(j)}Xij​=∑r​ur​(i)vr​(j)​ for sequences in the corresponding ℓ2\ell^2ℓ2 spaces with summable ∥ur∥2∥vr∥2\|u_r\|_2\|v_r\|_2∥ur​∥2​∥vr​∥2​; a density matrix is trace class, has real nonnegative finite principal quadratic forms, and has summable real diagonal with sum 111; and a trace class channel preserves trace class matrices, is additive and complex homogeneous on them, and preserves densities after every finite ancillary block amplification. Let ν(X)\nu(X)ν(X) be the infimum of the nonnegative extended real costs of such expansions, with empty infimum +∞+\infty+∞, and define ∥A∥st=sup⁡q∈Nsup⁡X trace class, ν(X)≤1ν(A[q]X)\|A\|_{\mathrm{st}}=\sup_{q\in\mathbb N}\sup_{X\text{ trace class},\,\nu(X)\le1}\nu(A^{[q]}X)∥A∥st​=supq∈N​supX trace class,ν(X)≤1​ν(A[q]X), where A[q]A^{[q]}A[q] applies AAA separately to every block indexed by two ancillary labels in [q]={0,…,q−1}[q]=\{0,\ldots,q-1\}[q]={0,…,q−1}. For positive integers n,mn,mn,m, define

δ(n,m)=inf⁡E:Km→InD:Jn→LmE,D trace class channels∥D∘T⊗n∘E−S⊗m∥st,\delta(n,m)= \inf_{\substack{E:K^m\to I^n\\D:J^n\to L^m\\E,D\text{ trace class channels}}} \|D\circ T^{\otimes n}\circ E-S^{\otimes m}\|_{\mathrm{st}},δ(n,m)=E:Km→InD:Jn→LmE,D trace class channels​inf​∥D∘T⊗n∘E−S⊗m∥st​,

where arrows indicate maps between matrices on those label types, and tensor powers apply the map recursively to each coordinate, with the zeroth power acting on the singleton empty-coordinate matrix. Then, for every pair of positive integers n,mn,mn,m,

δ(n+1,m)≤δ(n,m)≤δ(n,m+1),\delta(n+1,m)\le\delta(n,m)\le\delta(n,m+1),δ(n+1,m)≤δ(n,m)≤δ(n,m+1),

and, for every four positive integers n,k,m,ℓn,k,m,\elln,k,m,ℓ,

δ(n+k,m+ℓ)≤δ(n,m)+δ(k,ℓ).\delta(n+k,m+\ell)\le\delta(n,m)+\delta(k,\ell).δ(n+k,m+ℓ)≤δ(n,m)+δ(k,ℓ).

All errors and inequalities take values in [0,∞][0,\infty][0,∞]; the block arguments in these conclusions exclude zero.

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