Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Zero private capacity and positive weak locking capacity for the symmetric channel

Open
QAlgorithms.Papers.Independent.Intakenext100.P63.symmetric_private_zero_locking_positive

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

prove2quantum

For an integer d≥1d\ge1d≥1, let V:Sym⁡2(Cd)↪Cd⊗CdV:\operatorname{Sym}^2(\mathbb C^d)\hookrightarrow\mathbb C^d\otimes\mathbb C^dV:Sym2(Cd)↪Cd⊗Cd be the canonical isometric inclusion. Its orthonormal input basis consists of ∣ii⟩|ii\rangle∣ii⟩ and (∣ij⟩+∣ji⟩)/2(|ij\rangle+|ji\rangle)/\sqrt2(∣ij⟩+∣ji⟩)/2​ for i<ji<ji<j. Define Sd\mathcal S_dSd​ by tracing out the second output factor; its complement traces out the first. Then

P(Sd)=0,LW(Sd)≥12log⁡2d.P(\mathcal S_d)=0,\qquad L_W(\mathcal S_d)\ge\tfrac12\log_2d.P(Sd​)=0,LW​(Sd​)≥21​log2​d.

These are operational capacities with uniform messages and a uniform independent preshared secret of o(n)o(n)o(n) bits, vanishing averaged decoding error, and the full trace-norm or full classical ℓ1\ell^1ℓ1 security criterion. The two marginal channels coincide on the entire symmetric input space. This does not assert independent cloning of arbitrary inputs; the locking advantage uses the allowed sublinear secret.

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.12, Theorem 13: the entire symmetric subspace channel, not just product inputs.
The normalized inclusion defines equal marginals. A sublinear secret remains allowed. -/
theorem symmetric_private_zero_locking_positive (d : ℕ) (hd : 0 < d) :
    keyedCapacity (dilationMap (universalSymmetricDilation d)) (environment (universalSymmetricDilation d)) false = 0 ∧
    (1 / 2 : ℝ) * Real.logb 2 d ≤
      keyedCapacity (dilationMap (universalSymmetricDilation d)) (environment (universalSymmetricDilation d)) 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. 12, Theorem 13: symmetric subspace channel has zero private and positive locking capacity
Read-back

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

For every natural number d>0d>0d>0, let Ad={(i,j)∈{0,…,d−1}2:i≤j}A_d=\{(i,j)\in\{0,\ldots,d-1\}^2:i\le j\}Ad​={(i,j)∈{0,…,d−1}2:i≤j} and define Ud:CAd→Cd⊗CdU_d:\mathbb C^{A_d}\to\mathbb C^d\otimes\mathbb C^dUd​:CAd​→Cd⊗Cd by

Ud∣i,i⟩=∣i,i⟩,Ud∣i,j⟩=∣i,j⟩+∣j,i⟩2(i<j).U_d|i,i\rangle=|i,i\rangle,\qquad U_d|i,j\rangle=\frac{|i,j\rangle+|j,i\rangle}{\sqrt2}\quad(i<j).Ud​∣i,i⟩=∣i,i⟩,Ud​∣i,j⟩=2​∣i,j⟩+∣j,i⟩​(i<j).

Put N(X)=tr⁡2(UdXUd†)N(X)=\operatorname{tr}_2(U_dXU_d^\dagger)N(X)=tr2​(Ud​XUd†​) and Nc(X)=tr⁡1(UdXUd†)N^c(X)=\operatorname{tr}_1(U_dXU_d^\dagger)Nc(X)=tr1​(Ud​XUd†​). Define two capacities as real suprema of nonnegative rates RRR attainable by sequences of keyed codes of every length ℓ=n+1\ell=n+1ℓ=n+1: such a code has positive message and key counts mℓ,kℓm_\ell,k_\ellmℓ​,kℓ​, density matrices ωk,m\omega_{k,m}ωk,m​ on AdℓA_d^\ellAdℓ​, and for each key kkk a measurement (Dk,m)m(D_{k,m})_m(Dk,m​)m​ on (Cd)⊗ℓ(\mathbb C^d)^{\otimes\ell}(Cd)⊗ℓ, with positive semidefinite effects summing to the identity. Both capacities require log⁡2kℓ/ℓ→0\log_2k_\ell/\ell\to0log2​kℓ​/ℓ→0, average decoding 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. Write ωˉm=kℓ−1∑kωk,m\bar\omega_m=k_\ell^{-1}\sum_k\omega_{k,m}ωˉm​=kℓ−1​∑k​ωk,m​. The private capacity CpC_{\mathrm p}Cp​ additionally requires, for every u>0u>0u>0, eventually the existence of a density matrix Ω\OmegaΩ on the environment output such that mℓ−1∑m∥(Nc)⊗ℓ(ωˉm)−Ω∥tr≤um_\ell^{-1}\sum_m\|(N^c)^{\otimes\ell}(\bar\omega_m)-\Omega\|_{\mathrm{tr}}\le umℓ−1​∑m​∥(Nc)⊗ℓ(ωˉm​)−Ω∥tr​≤u, where ∥X∥tr=Re⁡tr⁡X†X\|X\|_{\mathrm{tr}}=\operatorname{Re}\operatorname{tr}\sqrt{X^\dagger X}∥X∥tr​=RetrX†X​. The weak capacity CwC_{\mathrm w}Cw​ instead requires, for every u>0u>0u>0, eventually that every measurement QQQ on the environment output with a positive finite number of outcomes admit a probability vector www satisfying

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

A density matrix is positive semidefinite with trace 111. The declaration asserts

Cp(N,Nc)=0,12log⁡2d≤Cw(N,Nc).C_{\mathrm p}(N,N^c)=0, \qquad \frac12\log_2d\le C_{\mathrm w}(N,N^c).Cp​(N,Nc)=0,21​log2​d≤Cw​(N,Nc).

The case d=1d=1d=1 is included, making the displayed lower bound 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