Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Accessible equivocation bounds weak locking capacity from above

Open
QAlgorithms.Papers.Independent.Intakenext100.P63.schur_locking_upper

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let A,B,EA,B,EA,B,E be nonzero finite-dimensional Hilbert spaces, and let V:A→B⊗EV:A\to B\otimes EV:A→B⊗E be a normalized Stinespring isometry defining receiver channel N\mathcal NN and complementary channel Nc\mathcal N^cNc. Suppose that, in the specified computational basis of AAA, Nc(∣i⟩⟨j∣)=δijρi\mathcal N^c(|i\rangle\langle j|)=\delta_{ij}\rho_iNc(∣i⟩⟨j∣)=δij​ρi​, where every ρi\rho_iρi​ is a normalized density matrix on EEE. For a probability vector ppp, define Sacc(p;ρ)=min⁡QH(I∣J)S_{\rm acc}(p;\rho)=\min_Q H(I|J)Sacc​(p;ρ)=minQ​H(I∣J) using the joint law Pr⁡(I=i,J=j)=piTr⁡(ρiQj)\Pr(I=i,J=j)=p_i\operatorname{Tr}(\rho_iQ_j)Pr(I=i,J=j)=pi​Tr(ρi​Qj​), with QQQ ranging over all finite POVMs. Then

LW(N)≤max⁡pSacc(p;ρ).L_W(\mathcal N)\le\max_p S_{\rm acc}(p;\rho).LW​(N)≤pmax​Sacc​(p;ρ).

All entropies are in bits. The operational capacity uses uniform messages, an independent uniform secret of o(n)o(n)o(n) bits, and vanishing averaged reliability and full ℓ1\ell^1ℓ1 weak-locking errors, uniformly over Eve's measurements. This is an unconditional upper bound for complements of cq-channels.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P63
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P63

open QAlgorithms Filter

open QAlgorithms.Papers.Independent.Information100.P63 (Mat)

open QAlgorithms.Papers.Independent.Information100.P04 (Measurement)

open QAlgorithms.Papers.Independent.Information100.P27 (shannon labelInformation)

open QAlgorithms.Papers.Independent.Information100.P71 (channelPower dilationMap SupportIncluded)

open QAlgorithms.Papers.Independent.Bridge50.P47 (SymmetricIndex universalSymmetricDilation)

open QAlgorithms.Learning (IsDistribution)

open scoped Matrix ComplexConjugate ComplexOrder

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF p.5, Proposition 3: unconditional accessible-equivocation upper bound.
A normalized fixed Stinespring isometry specifies both channels. -/
theorem schur_locking_upper {A B E : Type} [Fintype A] [DecidableEq A] [Nonempty A]
    [Fintype B] [DecidableEq B] [Nonempty B] [Fintype E] [DecidableEq E] [Nonempty E]
    (V : Matrix (B × E) A ℂ) (hV : Vᴴ * V = 1) (rho : A → Mat E)
    (hCq : CqComplement (environment V) rho) :
    keyedCapacity (dilationMap V) (environment V) true ≤ optimizedEquivocation rho := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P63

end
Source
Weak locking capacity of quantum channels can be much larger than private capacity, arXiv:1403.6361v3, PDF p. 5, Proposition 3: accessible-equivocation upper bound
Read-back

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

For arbitrary finite, nonempty types A,B,EA,B,EA,B,E, each with decidable equality, let VVV be a complex matrix with rows indexed by B×EB\times EB×E and columns by AAA, satisfying V∗V=IAV^*V=I_AV∗V=IA​, and let (ρi)i∈A(\rho_i)_{i\in A}(ρi​)i∈A​ be matrices on EEE. Assume every ρi\rho_iρi​ is positive semidefinite of trace 111, and, for every i,j∈Ai,j\in Ai,j∈A,

tr⁡B(VEijV∗)={ρi,i=j,0,i≠j,\operatorname{tr}_B(VE_{ij}V^*)= \begin{cases}\rho_i,&i=j,\\0,&i\ne j,\end{cases}trB​(VEij​V∗)={ρi​,0,​i=j,i=j,​

where EijE_{ij}Eij​ is the matrix unit. With N(X)=tr⁡E(VXV∗)N(X)=\operatorname{tr}_E(VXV^*)N(X)=trE​(VXV∗) and Nc(X)=tr⁡B(VXV∗)N_c(X)=\operatorname{tr}_B(VXV^*)Nc​(X)=trB​(VXV∗), the theorem asserts

Cweak(N,Nc)≤sup⁡pi≥0∑ipi=1inf⁡Q[−∑j,iPijlog⁡2 ⁣(Pij∑hPhj)],Pij=piRe⁡tr⁡(Qjρi).C_{\mathrm{weak}}(N,N_c) \le \sup_{\substack{p_i\ge0\\\sum_i p_i=1}} \inf_Q\left[-\sum_{j,i}P_{ij}\log_2\!\left(\frac{P_{ij}}{\sum_hP_{hj}}\right)\right], \qquad P_{ij}=p_i\operatorname{Re}\operatorname{tr}(Q_j\rho_i).Cweak​(N,Nc​)≤pi​≥0∑i​pi​=1​sup​Qinf​[−j,i∑​Pij​log2​(∑h​Phj​Pij​​)],Pij​=pi​Retr(Qj​ρi​).

The infimum ranges over measurements on EEE with a finite, strictly positive number of positive semidefinite effects summing to identity. The left side is the total real supremum of nonnegative rates RRR admitting a sequence of codes of lengths ℓ=n+1\ell=n+1ℓ=n+1: each has positive message and key counts Mn,KnM_n,K_nMn​,Kn​, input density matrices σu,m\sigma_{u,m}σu,m​, and decoding measurements (Du,m)m(D_{u,m})_m(Du,m​)m​, with

log⁡2Knℓ→0,1KnMn∑u,m(1−Re⁡tr⁡(Du,mN[ℓ](σu,m)))→0,∀s>0, eventually log⁡2Mnℓ≥R−s.\frac{\log_2K_n}{\ell}\to0,\qquad \frac1{K_nM_n}\sum_{u,m}\left(1-\operatorname{Re}\operatorname{tr}(D_{u,m}N^{[\ell]}(\sigma_{u,m}))\right)\to0, \quad \forall s>0,\ \text{eventually }\frac{\log_2M_n}{\ell}\ge R-s.ℓlog2​Kn​​→0,Kn​Mn​1​u,m∑​(1−Retr(Du,m​N[ℓ](σu,m​)))→0,∀s>0, eventually ℓlog2​Mn​​≥R−s.

Moreover, for every ε>0\varepsilon>0ε>0, eventually every finite measurement FFF on EℓE^\ellEℓ with a strictly positive number of outcomes admits a probability vector wjw_jwj​ satisfying

1Mn∑m,j∣Re⁡tr⁡ ⁣(FjNc[ℓ] ⁣(Kn−1∑uσu,m))−wj∣≤ε.\frac1{M_n}\sum_{m,j} \left|\operatorname{Re}\operatorname{tr}\!\left(F_jN_c^{[\ell]}\!\left(K_n^{-1}\sum_u\sigma_{u,m}\right)\right)-w_j\right| \le\varepsilon.Mn​1​m,j∑​​Retr(Fj​Nc[ℓ]​(Kn−1​u∑​σu,m​))−wj​​≤ε.

The map powers mean G[ℓ](X)y,y′=∑x,x′Xx,x′∏t<ℓG(Ext,xt′)yt,yt′G^{[\ell]}(X)_{y,y'}=\sum_{x,x'}X_{x,x'}\prod_{t<\ell}G(E_{x_t,x'_t})_{y_t,y'_t}G[ℓ](X)y,y′​=∑x,x′​Xx,x′​∏t<ℓ​G(Ext​,xt′​​)yt​,yt′​​. Density matrices have trace 111 and are positive semidefinite; every decoding measurement has positive semidefinite effects summing to identity. The prior ppp may have zero entries, and all logarithms and divisions in the right side are total, including log⁡20=0\log_2 0=0log2​0=0 and division by zero equal to zero.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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