Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

An unconditional achievable locking rate for complements of cq-channels

Open
QAlgorithms.Papers.Independent.Intakenext100.P63.schur_locking_lower

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

prove2quantum

Let a normalized Stinespring isometry V:A→B⊗EV:A\to B\otimes EV:A→B⊗E on nonzero finite-dimensional spaces define N\mathcal NN and its complement. Assume Nc(∣i⟩⟨j∣)=δijρi\mathcal N^c(|i\rangle\langle j|)=\delta_{ij}\rho_iNc(∣i⟩⟨j∣)=δij​ρi​ in the fixed input basis, with normalized ρi\rho_iρi​. For any probability vector ppp, set ρˉ=∑ipiρi\bar\rho=\sum_ip_i\rho_iρˉ​=∑i​pi​ρi​ and Mi=ρˉ−1/2piρiρˉ−1/2M_i=\bar\rho^{-1/2}p_i\rho_i\bar\rho^{-1/2}Mi​=ρˉ​−1/2pi​ρi​ρˉ​−1/2. Regard these effects as a POVM on supp⁡ρˉ\operatorname{supp}\bar\rhosuppρˉ​. Then

LW(N)≥H^(M)=min⁡ψ density on supp⁡ρˉH({Tr⁡ψMi}i).L_W(\mathcal N)\ge\widehat H(M)=\min_{\psi\text{ density on }\operatorname{supp}\bar\rho}H(\{\operatorname{Tr}\psi M_i\}_i).LW​(N)≥H(M)=ψ density on suppρˉ​min​H({TrψMi​}i​).

The capacity allows a uniform independent preshared secret of o(n)o(n)o(n) bits and uniform messages. Decoding error is averaged over messages and key; the full classical ℓ1\ell^1ℓ1 weak-locking error tends to zero uniformly over all environment POVMs, with a message-independent reference law for each POVM. This is an unconditional rate, with no extractor-success or additivity hypothesis.

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 pp.10–11, Theorem 10: unconditional lower bound with a sublinear secret seed.
No extractor success, additivity conjecture, or invertibility is a hypothesis. -/
theorem schur_locking_lower {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) (p : A → ℝ) (hp : IsDistribution p) :
    associatedMinimum p rho ≤ keyedCapacity (dilationMap V) (environment V) true := 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. 10, Theorem 10: unconditional achievable locking rate for cq complements
Read-back

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

Let A,B,EA,B,EA,B,E be finite nonempty types with decidable equality, and let V:CA→CB×EV:\mathbb C^A\to\mathbb C^{B\times E}V:CA→CB×E satisfy V†V=IV^\dagger V=IV†V=I. Define N(X)=tr⁡E(VXV†)N(X)=\operatorname{tr}_E(VXV^\dagger)N(X)=trE​(VXV†) and Nc(X)=tr⁡B(VXV†)N^c(X)=\operatorname{tr}_B(VXV^\dagger)Nc(X)=trB​(VXV†). Let ρ:A→Mat⁡(E)\rho:A\to\operatorname{Mat}(E)ρ:A→Mat(E) satisfy that every ρa\rho_aρa​ is positive semidefinite with trace 111 and, for every matrix unit ∣a⟩⟨a′∣|a\rangle\langle a'|∣a⟩⟨a′∣,

Nc(∣a⟩⟨a′∣)={ρa,a=a′,0,a≠a′.N^c(|a\rangle\langle a'|)= \begin{cases}\rho_a,&a=a',\\0,&a\ne a'.\end{cases}Nc(∣a⟩⟨a′∣)={ρa​,0,​a=a′,a=a′.​

Let pa≥0p_a\ge0pa​≥0 sum to 111, set ρˉ=∑apaρa\bar\rho=\sum_a p_a\rho_aρˉ​=∑a​pa​ρa​, let S=f(ρˉ)S=f(\bar\rho)S=f(ρˉ​) for f(x)=(x)−1f(x)=(\sqrt{x})^{-1}f(x)=(x​)−1 under continuous functional calculus, with f(0)=0f(0)=0f(0)=0, and define

hassoc=inf⁡ω⪰0, tr⁡ω=1ker⁡ρˉ⊆ker⁡ω−∑aualog⁡2ua,ua=Re⁡tr⁡(S(paρa)S ω).h_{\mathrm{assoc}}= \inf_{\substack{\omega\succeq0,\ \operatorname{tr}\omega=1\\ \ker\bar\rho\subseteq\ker\omega}} -\sum_a u_a\log_2u_a, \qquad u_a=\operatorname{Re}\operatorname{tr}(S(p_a\rho_a)S\,\omega).hassoc​=ω⪰0, trω=1kerρˉ​⊆kerω​inf​−a∑​ua​log2​ua​,ua​=Retr(S(pa​ρa​)Sω).

Define Cw(N,Nc)C_{\mathrm w}(N,N^c)Cw​(N,Nc) as the real supremum of all R≥0R\ge0R≥0 admitting the following sequence of codes, one for each length ℓ=n+1\ell=n+1ℓ=n+1: positive integers mℓ,kℓm_\ell,k_\ellmℓ​,kℓ​, density matrices ωk,m\omega_{k,m}ωk,m​ on AℓA^\ellAℓ, and, for each key kkk, positive semidefinite decoding effects Dk,mD_{k,m}Dk,m​ on BℓB^\ellBℓ summing over mmm to the identity. The sequence must have log⁡2kℓ/ℓ→0\log_2k_\ell/\ell\to0log2​kℓ​/ℓ→0, average error

1kℓmℓ∑k,m[1−Re⁡tr⁡(Dk,mN⊗ℓ(ωk,m))]→0,\frac1{k_\ell m_\ell}\sum_{k,m} \left[1-\operatorname{Re}\operatorname{tr}(D_{k,m}N^{\otimes\ell}(\omega_{k,m}))\right]\to0,kℓ​mℓ​1​k,m∑​[1−Retr(Dk,m​N⊗ℓ(ωk,m​))]→0,

and, for every s>0s>0s>0, eventually log⁡2mℓ/ℓ≥R−s\log_2m_\ell/\ell\ge R-slog2​mℓ​/ℓ≥R−s. With ωˉm=kℓ−1∑kωk,m\bar\omega_m=k_\ell^{-1}\sum_k\omega_{k,m}ωˉm​=kℓ−1​∑k​ωk,m​, it must also satisfy, for every u>0u>0u>0, eventually the condition that every measurement QQQ on EℓE^\ellEℓ with a positive finite number of outcomes admits a nonnegative probability vector www on its outcomes such that

1mℓ∑m∑j∣Re⁡tr⁡(Qj(Nc)⊗ℓ(ωˉm))−wj∣≤u.\frac1{m_\ell}\sum_m\sum_j \left|\operatorname{Re}\operatorname{tr} \bigl(Q_j(N^c)^{\otimes\ell}(\bar\omega_m)\bigr)-w_j\right|\le u.mℓ​1​m∑​j∑​​Retr(Qj​(Nc)⊗ℓ(ωˉm​))−wj​​≤u.

Here tensor powers are the usual matrix tensor powers of the channel maps, and density matrices are positive semidefinite with trace 111. The asserted inequality is hassoc≤Cw(N,Nc)h_{\mathrm{assoc}}\le C_{\mathrm w}(N,N^c)hassoc​≤Cw​(N,Nc); zero weights in ppp are allowed.

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