Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Balanced detector with vacuum trusted noise

Proved
QAlgorithms.Papers.Independent.Bridge50.P03.balancedVacuum

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

prove2quantum

Let 0≤η<10\le\eta<10≤η<1 be the channel transmissivity and let 1≤ω<∞1\le\omega<\infty1≤ω<∞ be the environment quadrature variance, with vacuum variance one. All logarithms and rates are in bits. Define the thermal entropy

h(x)=x+12log⁡2x+12−x−12log⁡2x−12,x≥1,h(x)=\frac{x+1}{2}\log_2\frac{x+1}{2}-\frac{x-1}{2}\log_2\frac{x-1}{2},\qquad x\ge1,h(x)=2x+1​log2​2x+1​−2x−1​log2​2x−1​,x≥1,

with 0log⁡20=00\log_2 0=00log2​0=0. For detector transmissivity d∈[0,1]d\in[0,1]d∈[0,1] and finite trusted thermal variance γ≥1\gamma\ge1γ≥1, write

R(η,ω,d,γ)=12log⁡2dω+(1−d)(1−η)γ(1−η)[d(1−η)ω+(1−d)γ]+h ⁣(ω[d+(1−η)(1−d)ωγ]dω+(1−η)(1−d)γ)−h(ω).R(\eta,\omega,d,\gamma)=\frac12\log_2\frac{d\omega+(1-d)(1-\eta)\gamma}{(1-\eta)[d(1-\eta)\omega+(1-d)\gamma]}+h\!\left(\sqrt{\frac{\omega[d+(1-\eta)(1-d)\omega\gamma]}{d\omega+(1-\eta)(1-d)\gamma}}\right)-h(\omega).R(η,ω,d,γ)=21​log2​(1−η)[d(1−η)ω+(1−d)γ]dω+(1−d)(1−η)γ​+h(dω+(1−η)(1−d)γω[d+(1−η)(1−d)ωγ]​​)−h(ω).

At d=0d=0d=0 this expression is zero. The symbol RRR denotes the signed expression, so a negative value is not asserted to be a positive achievable key yield.

A balanced detector with vacuum trusted noise satisfies

R(η,ω,1/2,1)=B(η,ω),R(\eta,\omega,1/2,1)=B(\eta,\omega),R(η,ω,1/2,1)=B(η,ω),

where

B(η,ω)=12log⁡2ω+1−η(1−η)[(1−η)ω+1]+h ⁣(ω[1+(1−η)ω]ω+1−η)−h(ω).B(\eta,\omega)=\frac12\log_2\frac{\omega+1-\eta}{(1-\eta)[(1-\eta)\omega+1]}+h\!\left(\sqrt{\frac{\omega[1+(1-\eta)\omega]}{\omega+1-\eta}}\right)-h(\omega).B(η,ω)=21​log2​(1−η)[(1−η)ω+1]ω+1−η​+h(ω+1−ηω[1+(1−η)ω]​​)−h(ω).

This specialization identifies the earlier balanced-detector comparison curve in the new family. The detector transmissivity is 1/21/21/2; the channel transmissivity remains η\etaη.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Bridge50_P03
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Bridge50.P03

/-- arXiv:1609.02169v1, PDF p.8, Section 4: balanced beam splitter with
vacuum detector noise. Corrects the printed residual gamma to 1; the
radical is retained. This correction requires independent moderation. -/
theorem balancedVacuum (eta omega : ℝ)
    (heta0 : 0 ≤ eta) (heta1 : eta < 1) (homega : 1 ≤ omega) :
    signedDetectorRate eta omega (1 / 2) 1 =
      balancedVacuumCurve eta omega := by sorry

end QAlgorithms.Papers.Independent.Bridge50.P03

end
Source
Secret key capacity of the thermal-loss channel: Improving the lower bound, arXiv:1609.02169v1, PDF p. 8, Section 4, unnumbered display
Read-back

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

For all real numbers η,ω\eta,\omegaη,ω satisfying 0≤η<10\le\eta<10≤η<1 and ω≥1\omega\ge1ω≥1, let

H(x)=x+12log⁡2 ⁣(x+12)−x−12log⁡2 ⁣(x−12).H(x)=\frac{x+1}{2}\log_2\!\left(\frac{x+1}{2}\right) -\frac{x-1}{2}\log_2\!\left(\frac{x-1}{2}\right).H(x)=2x+1​log2​(2x+1​)−2x−1​log2​(2x−1​).

The rate expression at d=12d=\tfrac12d=21​ and γ=1\gamma=1γ=1 satisfies

12log⁡2 ⁣(ω2+1−η2(1−η)((1−η)ω2+12))+H ⁣(ω(12+(1−η)ω2)ω2+1−η2)−H(ω)=12log⁡2 ⁣(ω+1−η(1−η)((1−η)ω+1))+H ⁣(ω(1+(1−η)ω)ω+1−η)−H(ω).\begin{aligned} &\frac12\log_2\!\left( \frac{\frac{\omega}{2}+\frac{1-\eta}{2}} {(1-\eta)\left(\frac{(1-\eta)\omega}{2}+\frac12\right)} \right) +H\!\left( \sqrt{\frac{\omega\left(\frac12+\frac{(1-\eta)\omega}{2}\right)} {\frac{\omega}{2}+\frac{1-\eta}{2}}} \right)-H(\omega)\\ &\qquad= \frac12\log_2\!\left( \frac{\omega+1-\eta}{(1-\eta)\bigl((1-\eta)\omega+1\bigr)} \right) +H\!\left( \sqrt{\frac{\omega\bigl(1+(1-\eta)\omega\bigr)}{\omega+1-\eta}} \right)-H(\omega). \end{aligned}​21​log2​​(1−η)(2(1−η)ω​+21​)2ω​+21−η​​​+H​2ω​+21−η​ω(21​+2(1−η)ω​)​​​−H(ω)=21​log2​((1−η)((1−η)ω+1)ω+1−η​)+H​ω+1−ηω(1+(1−η)ω)​​​−H(ω).​

The boundary cases η=0\eta=0η=0 and ω=1\omega=1ω=1 are included, with the logarithm at zero in H(1)H(1)H(1) defined to be zero.

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

    Confirmed by the moderator at approval.

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