Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Optimal individual Rényi leakage for the split binary coherent signal

Open
QAlgorithms.Papers.Independent.Intakethird100.P02.eveRenyi_eq7

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let n>0n>0n>0 be the emitted mean photon number and let 0<η≤10<\eta\le10<η≤1 be the intensity transmissivity. Use quadratures with [x1,x2]=i/2[x_1,x_2]=i/2[x1​,x2​]=i/2, so the coherent-state variance is v=1/4v=1/4v=1/4. Conditioned on the announced basis of the equiprobable four-state protocol, Eve holds one of the equally likely coherent states ∣±(1−η)n⟩|\pm\sqrt{(1-\eta)n}\rangle∣±(1−η)n​⟩.

For any single-pulse POVM MMM, let P+P_+P+​ and P−P_-P−​ be its two outcome laws and let q=dP+/d(P++P−)q=dP_+/d(P_++P_-)q=dP+​/d(P+​+P−​). Its collision/Rényi information in bits is

IR(M)=log⁡2 ⁣∫(q(y)2+(1−q(y))2) d(P++P−)(y).I^R(M)=\log_2\!\int\bigl(q(y)^2+(1-q(y))^2\bigr)\,d(P_++P_-)(y).IR(M)=log2​∫(q(y)2+(1−q(y))2)d(P+​+P−​)(y).

The maximum over all POVMs, including arbitrary measurable outcome spaces, is attained and equals

IoptR(n,η)=log⁡2 ⁣(2−exp⁡ ⁣[−(1−η)nv]).I^R_{\mathrm{opt}}(n,\eta)=\log_2\!\left(2-\exp\!\left[-\frac{(1-\eta)n}{v}\right]\right).IoptR​(n,η)=log2​(2−exp[−v(1−η)n​]).

The same POVM acts on both signs. It may be chosen after the basis announcement, and no collective measurement is allowed. The formal statement also establishes the coefficient realization and unit norms of the two coherent vectors.

This evaluates the individual leakage used in the paper's privacy-amplification gain. Eq.(6) is a cited background result; Eq.(7) is this paper's coherent-signal specialization.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P02
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P02

open MeasureTheory ProbabilityTheory

open scoped ENNReal Topology

open QAlgorithms.Papers.Independent.Dependency50.P39
  (Fock FockOperator coherentKet coherentCoefficient)

open QAlgorithms.Papers.Independent.Frontier30.P21 (coherentDensity)

open QAlgorithms.Papers.Independent.Next46.P32 (complexNormal quadrature)

open QAlgorithms.Papers.Independent.Dependency50.P33 (IsDensity productCoeff)

/-- PDF p.2, (7): the optimal individual collision/Rényi leakage from the
binary split coherent signal, after learning the basis. -/
theorem eveRenyi_eq7 (n eta : ℝ) (hn : 0 < n) (heta : 0 < eta)
    (hetaOne : eta ≤ 1) :
    ReflectedPairRealized n eta ∧
    IsGreatest (leakageValues n eta)
      (Real.logb 2 (2 - Real.exp (-((1 - eta) * n) / (1 / 4 : ℝ)))) ∧
    optimalLeakage n eta =
      Real.logb 2 (2 - Real.exp (-((1 - eta) * n) / (1 / 4 : ℝ))) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P02

end
Source
A practical limitation for continuous-variable quantum cryptography using coherent states, arXiv:quant-ph/0403115v1, PDF p. 2, Eq.(7)
Read-back

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

For every real n>0n>0n>0 and every real 0<η≤10<\eta\leq10<η≤1, put a=(1−η)n∈Ca=\sqrt{(1-\eta)n}\in\mathbb Ca=(1−η)n​∈C. The selected vectors ca,c−a∈H=ℓ2(N;C)c_a,c_{-a}\in H=\ell^2(\mathbb N;\mathbb C)ca​,c−a​∈H=ℓ2(N;C) both have norm 111 and coordinates (cα)j=e−∣α∣2/2αj/j!(c_\alpha)_j=e^{-|\alpha|^2/2}\alpha^j/\sqrt{j!}(cα​)j​=e−∣α∣2/2αj/j!​ for every j∈Nj\in\mathbb Nj∈N and α∈{a,−a}\alpha\in\{a,-a\}α∈{a,−a}; these vectors are defined by selecting vectors with the stated coordinates when they exist, with zero as the fallback. Moreover,

L=log⁡2 ⁣(2−exp⁡ ⁣(−(1−η)n1/4))L=\log_2\!\left(2-\exp\!\left(-\frac{(1-\eta)n}{1/4}\right)\right)L=log2​(2−exp(−1/4(1−η)n​))

is the greatest of all measurement values log⁡2∫[p2+(1−p)2] d(μca+μc−a)\log_2\int[p^2+(1-p)^2]\,d(\mu_{c_a}+\mu_{c_{-a}})log2​∫[p2+(1−p)2]d(μca​​+μc−a​​). Here the measurements range over all types with all measurable-space structures and assignments of bounded complex-linear effects on HHH and finite laws: empty and total effects are 000 and IHI_HIH​, measurable effects have nonnegative real quadratic forms, disjoint measurable sequences are additive after pairing with any two vectors, and μu(S)=max⁡{Re⁡⟨u,E(S)u⟩,0}\mu_u(S)=\max\{\operatorname{Re}\langle u,E(S)u\rangle,0\}μu​(S)=max{Re⟨u,E(S)u⟩,0} on measurable sets; ppp is the selected derivative dμca/d(μca+μc−a)d\mu_{c_a}/d(\mu_{c_a}+\mu_{c_{-a}})dμca​​/d(μca​​+μc−a​​), converted to a real number with +∞↦0+\infty\mapsto0+∞↦0. Being greatest means that LLL is attained by some such measurement and every such value is at most LLL. The real supremum of these values is also equal to LLL. The endpoint η=1\eta=1η=1 is included: then a=0a=0a=0 and L=0L=0L=0.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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