Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 6.2 / (84): separable side channels are useless

Open
QAlgorithms.Papers.Independent.Gap20.P07.separableSideChannel_useless

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

prove2quantum

Let TTT and RRR be CPTP channels between nonzero complex Hilbert spaces. Suppose RRR factors operationally as measurement followed by preparation: a POVM with an arbitrary measurable outcome space has its actual probability law on every input state, and the output is the integrable barycenter of normalized prepared states. Then

Q(T⊗R)=Q(T).Q(T\otimes R)=Q(T).Q(T⊗R)=Q(T).

No finite or countable outcome restriction and no assumption of a product input is imposed. This is the separable-side-channel consequence of the forward-assistance theorem.

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 p.23, Corollary 6.2, (84): operational measurement--preparation side
channels with arbitrary outcome spaces; no countable-decomposition assumption. -/
theorem separableSideChannel_useless {I J K L : Type}
    [Nonempty I] [Nonempty J] [Nonempty K] [Nonempty L]
    (T : Operation I J) (R : Operation K L) (hT : IsTraceClassChannel T)
    (hR : IsTraceClassChannel R) (hseparable : MeasurePrepare R) :
    qubitReferenceCapacity (traceClassTensorMap T R) = qubitReferenceCapacity T := by sorry

end QAlgorithms.Papers.Independent.Gap20.P07

end
Source
Tema Con Variazioni: Quantum Channel Capacity, arXiv:quant-ph/0311037v1, PDF p. 23, Corollary 6.2 / (84): separable side channels are useless
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. Call a matrix trace class when it has an expansion Xij=∑rur(i)vr(j)‾X_{ij}=\sum_r u_r(i)\overline{v_r(j)}Xij​=∑r​ur​(i)vr​(j)​ with ur,vr∈ℓ2u_r,v_r\in\ell^2ur​,vr​∈ℓ2 and ∑r∥ur∥2∥vr∥2\sum_r\|u_r\|_2\|v_r\|_2∑r​∥ur​∥2​∥vr​∥2​ summable, and let ν(X)\nu(X)ν(X) be the infimum in [0,∞][0,\infty][0,∞] of the corresponding nonnegative expansion costs, with empty infimum +∞+\infty+∞. A density matrix is trace class, has real nonnegative finite principal quadratic forms, and has summable real diagonal with sum 111. Suppose TTT from matrices on III to matrices on JJJ, and RRR from matrices on KKK to matrices on LLL, preserve trace class matrices, are additive and complex homogeneous on them, and preserve densities under every finite ancillary block amplification. Suppose also that RRR has the following measurement and preparation representation: there exist a measurable outcome type XXX, bounded complex linear effects M(A)M(A)M(A) on ℓ2(K)\ell^2(K)ℓ2(K) for every set A⊆XA\subseteq XA⊆X, with M(X)=IM(X)=IM(X)=I and real nonnegative quadratic forms for measurable AAA, finite measures λu\lambda_uλu​ for all u∈ℓ2(K)u\in\ell^2(K)u∈ℓ2(K) satisfying λu(A)=ofReal⁡(Re⁡⟨u,M(A)u⟩)\lambda_u(A)=\operatorname{ofReal}(\operatorname{Re}\langle u,M(A)u\rangle)λu​(A)=ofReal(Re⟨u,M(A)u⟩) for measurable AAA, probability measures μρ\mu_\rhoμρ​ for every density matrix ρ\rhoρ on KKK, and output densities σx\sigma_xσx​ on LLL, such that all coordinates of σx\sigma_xσx​ are measurable,

μρ(A)=ofReal⁡ ⁣(Re⁡∑i∑jρij[M(A)]ji),R(ρ)ab=∫X(σx)ab dμρ(x),\mu_\rho(A)=\operatorname{ofReal}\!\left( \operatorname{Re}\sum_i\sum_j\rho_{ij}[M(A)]_{ji}\right), \qquad R(\rho)_{ab}=\int_X(\sigma_x)_{ab}\,d\mu_\rho(x),μρ​(A)=ofReal(Rei∑​j∑​ρij​[M(A)]ji​),R(ρ)ab​=∫X​(σx​)ab​dμρ​(x),

and every coordinate integrand in the latter equality is integrable; here [M(A)]ji[M(A)]_{ji}[M(A)]ji​ is the jjjth coordinate of M(A)eiM(A)e_iM(A)ei​. For a map AAA, set ∥A∥st=sup⁡q∈Nsup⁡Y trace class, ν(Y)≤1ν(A[q]Y)\|A\|_{\mathrm{st}}=\sup_{q\in\mathbb N}\sup_{Y\text{ trace class},\,\nu(Y)\le1}\nu(A^{[q]}Y)∥A∥st​=supq∈N​supY trace class,ν(Y)≤1​ν(A[q]Y), where amplification applies AAA to each ancillary block, and let Q(A)Q(A)Q(A) be the supremum in [0,∞][0,\infty][0,∞] of strictly positive real rrr such that every pair of positive-integer sequences na,man_a,m_ana​,ma​ with na→∞n_a\to\inftyna​→∞ and extended-real lim sup⁡a(ma/na)≤r\limsup_a(m_a/n_a)\le rlimsupa​(ma​/na​)≤r satisfies

inf⁡E,D∥DA⊗naE−id⁡[2]ma∥st⟶0,\inf_{E,D}\|DA^{\otimes n_a}E-\operatorname{id}_{[2]^{m_a}}\|_{\mathrm{st}}\longrightarrow0,E,Dinf​∥DA⊗na​E−id[2]ma​​∥st​⟶0,

where E,DE,DE,D range over trace class channels encoding the reference register [2]ma[2]^{m_a}[2]ma​ into the input and decoding the output back to it, tensor powers apply the map recursively to each coordinate, and an empty rate supremum is 000. Define the tensor map explicitly by

(T⊗R)(Y)(j,ℓ),(j′,ℓ′)=[T ⁣([R((Y(i,k),(i′,k′))k,k′)]ℓℓ′)i,i′]jj′.(T\otimes R)(Y)_{(j,\ell),(j',\ell')} = \left[T\!\left( \bigl[R((Y_{(i,k),(i',k')})_{k,k'})\bigr]_{\ell\ell'} \right)_{i,i'}\right]_{jj'}.(T⊗R)(Y)(j,ℓ),(j′,ℓ′)​=[T([R((Y(i,k),(i′,k′)​)k,k′​)]ℓℓ′​)i,i′​]jj′​.

Then Q(T⊗R)=Q(T)Q(T\otimes R)=Q(T)Q(T⊗R)=Q(T). No countability assumption is imposed on any of the four register types or on the measurement outcome type.

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