Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Classical teleportation, reduced excess noise, and no information advantage

Open
QAlgorithms.Papers.Independent.Intakethird100.P02.classicalTeleportation

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

prove2quantum

In classical teleportation (CT), the rescaled simultaneous-quadrature measurement result zzz for coherent input α\alphaα has density e−∣z−α∣2/πe^{-|z-\alpha|^2}/\pie−∣z−α∣2/π. Eve retains zzz and resends the coherent state ∣z⟩|z\rangle∣z⟩. After optional vacuum loss of intensity 0<η≤10<\eta\le10<η≤1, the measure–prepare output equals

ρCT,η(α)=1πη∫Ce−∣β∣2/η∣ηα+β⟩⟨ηα+β∣ d2β.\rho_{\mathrm{CT},\eta}(\alpha)=\frac1{\pi\eta}\int_{\mathbb C}e^{-|\beta|^2/\eta} |\sqrt\eta\alpha+\beta\rangle\langle\sqrt\eta\alpha+\beta|\,d^2\beta.ρCT,η​(α)=πη1​∫C​e−∣β∣2/η∣η​α+β⟩⟨η​α+β∣d2β.

All matrix coefficient integrals exist, and the output is a positive trace-class operator of trace one. Each quadrature has a Gaussian law of mean η\sqrt\etaη​ times the input quadrature, finite second moment, and variance

vobs=(1+2η)v,v=1/4,δ=vobs/v−1=2η.v_{\mathrm{obs}}=(1+2\eta)v,\qquad v=1/4,\qquad \delta=v_{\mathrm{obs}}/v-1=2\eta.vobs​=(1+2η)v,v=1/4,δ=vobs​/v−1=2η.

In particular, at η=1\eta=1η=1 this is Eq.(13), with variance 3v3v3v.

For any probability ensemble of classical symbols AAA and measurable amplitude encoding, generate Eve's result ZZZ by this simultaneous measurement. Let Bob's record BBB have any normalized measurable conditional law depending only on the resent amplitude ηZ\sqrt\eta Zη​Z. Then the classical Shannon mutual information, defined by relative entropy and measured in bits with infinity allowed, obeys

I(A;B)≤I(A;Z).I(A;B)\le I(A;Z).I(A;B)≤I(A;Z).

This states the source's absence of information advantage. Its printed strict inequality is corrected to a non-strict inequality, since a one-symbol ensemble gives equality. The separate universal public-discussion security converse is deferred.

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 pp.3–4, (13)–(14): actual intercept–resend mixture, the reduced
quadrature excess after vacuum loss, and no information advantage. The printed
strict I_AB<I_E is corrected to <=, since deterministic Alice symbols or a
constant receiver give equality. This is a data-processing statement; the
universal operational public-discussion converse is separately deferred. -/
theorem classicalTeleportation (eta : ℝ) (heta : 0 < eta) (hetaOne : eta ≤ 1) :
    (∀ (alpha : ℂ) (k : Bool),
      (∀ j l, Integrable
        (fun z : ℂ => coherentDensity ((Real.sqrt eta : ℂ) * z) j l)
          (complexNormal 1 alpha)) ∧
      classicalTeleportationOutput eta alpha =
        displacedCoherent ((Real.sqrt eta : ℂ) * alpha) eta ∧
      IsDensity (classicalTeleportationOutput eta alpha) ∧
      classicalTeleportationHomodyne eta alpha k =
        gaussianReal (Real.sqrt eta * coherentAmplitudeQuadrature k alpha)
          ⟨(1 + 2 * eta) * (1 / 4 : ℝ), by
              positivity⟩ ∧
      MemLp (fun x : ℝ => x) 2 (classicalTeleportationHomodyne eta alpha k) ∧
      variance (fun x : ℝ => x) (classicalTeleportationHomodyne eta alpha k) =
        (1 + 2 * eta) * (1 / 4 : ℝ)) ∧
    normalizedExcess ((1 + 2 * eta) * (1 / 4 : ℝ)) = 2 * eta ∧
    (∀ (A O : Type) [MeasurableSpace A] [MeasurableSpace O]
      (mu : Measure A) [IsProbabilityMeasure mu]
      (amplitude : A → ℂ), Measurable amplitude →
      ∀ (receiver : Kernel ℂ O) [IsMarkovKernel receiver],
        mutualInformationBits (aliceBobLaw mu amplitude eta receiver) ≤
          mutualInformationBits (aliceEveLaw mu amplitude)) := 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. 4, Eqs.(13)–(14)
Read-back

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

For every real 0<η≤10<\eta\le10<η≤1, write cj(z)=e−∣z∣2/2zj/j!c_j(z)=e^{-|z|^2/2}z^j/\sqrt{j!}cj​(z)=e−∣z∣2/2zj/j!​, P(z)jl=cj(z)cl(z)‾P(z)_{jl}=c_j(z)\overline{c_l(z)}P(z)jl​=cj​(z)cl​(z)​, and let νV,m\nu_{V,m}νV,m​, for V>0V>0V>0, be the complex-plane probability measure with density e−∣z−m∣2/V/(πV)e^{-|z-m|^2/V}/(\pi V)e−∣z−m∣2/V/(πV). For every α∈C\alpha\in\mathbb Cα∈C and Boolean kkk, all functions z↦P(η z)jlz\mapsto P(\sqrt\eta\,z)_{jl}z↦P(η​z)jl​, for j,l∈Nj,l\in\mathbb Nj,l∈N, are integrable against ν1,α\nu_{1,\alpha}ν1,α​, and the matrix Tη,αT_{\eta,\alpha}Tη,α​ satisfies

Tη,α(j,l)=∫P(η z)jl dν1,α(z)=∫P(η α+β)jl dνη,0(β).T_{\eta,\alpha}(j,l) =\int P(\sqrt\eta\,z)_{jl}\,d\nu_{1,\alpha}(z) =\int P(\sqrt\eta\,\alpha+\beta)_{jl}\,d\nu_{\eta,0}(\beta).Tη,α​(j,l)=∫P(η​z)jl​dν1,α​(z)=∫P(η​α+β)jl​dνη,0​(β).

This matrix is a density kernel: there exist sequences uh,vh∈ℓ2(N;C)u_h,v_h\in\ell^2(\mathbb N;\mathbb C)uh​,vh​∈ℓ2(N;C) with ∑h∥uh∥∥vh∥<∞\sum_h\|u_h\|\|v_h\|<\infty∑h​∥uh​∥∥vh​∥<∞ and Tη,α(j,l)=∑huh(j)vh(l)‾T_{\eta,\alpha}(j,l)=\sum_hu_h(j)\overline{v_h(l)}Tη,α​(j,l)=∑h​uh​(j)vh​(l)​; every finite quadratic form ∑j,l∈Fzj‾Tη,α(j,l)zl\sum_{j,l\in F}\overline{z_j}T_{\eta,\alpha}(j,l)z_l∑j,l∈F​zj​​Tη,α​(j,l)zl​ is real and nonnegative; and its real diagonal is summable with sum 111. With qfalse(z)=Re⁡zq_{\mathrm{false}}(z)=\operatorname{Re}zqfalse​(z)=Rez and qtrue(z)=Im⁡zq_{\mathrm{true}}(z)=\operatorname{Im}zqtrue​(z)=Imz, the pushforward Hη,α,kH_{\eta,\alpha,k}Hη,α,k​ of ν1,α⊗N(0,1/4)\nu_{1,\alpha}\otimes\mathcal N(0,1/4)ν1,α​⊗N(0,1/4) under (z,t)↦η qk(z)+t(z,t)\mapsto\sqrt\eta\,q_k(z)+t(z,t)↦η​qk​(z)+t satisfies

Hη,α,k=N ⁣(η qk(α), 1+2η4).H_{\eta,\alpha,k} =\mathcal N\!\left(\sqrt\eta\,q_k(\alpha),\,\frac{1+2\eta}{4}\right).Hη,α,k​=N(η​qk​(α),41+2η​).

The identity function belongs to L2(Hη,α,k)L^2(H_{\eta,\alpha,k})L2(Hη,α,k​), its variance is (1+2η)/4(1+2\eta)/4(1+2η)/4, and this variance has normalized excess

(1+2η)/41/4−1=2η.\frac{(1+2\eta)/4}{1/4}-1=2\eta.1/4(1+2η)/4​−1=2η.

Finally, for every pair of types A,OA,OA,O with measurable-space structures, every probability measure μ\muμ on AAA, every measurable amplitude function a:A→Ca:A\to\mathbb Ca:A→C, and every Markov kernel R:C⇝OR:\mathbb C\rightsquigarrow OR:C⇝O, form λ=(x,z↦(x,a(x)+z))∗(μ⊗ν1,0)\lambda=(x,z\mapsto(x,a(x)+z))_*(\mu\otimes\nu_{1,0})λ=(x,z↦(x,a(x)+z))∗​(μ⊗ν1,0​), and form JJJ by adjoining to (x,z)(x,z)(x,z) an outcome with conditional law R(η z,⋅)R(\sqrt\eta\,z,\cdot)R(η​z,⋅), using the composition product, then retaining (x,o)(x,o)(x,o). The assertion is

DKL(J ∥ JA⊗JO)log⁡2≤DKL(λ ∥ λA⊗λC)log⁡2,\frac{D_{\mathrm{KL}}(J\,\|\,J_A\otimes J_O)}{\log 2} \le \frac{D_{\mathrm{KL}}(\lambda\,\|\,\lambda_A\otimes\lambda_{\mathbb C})}{\log 2},log2DKL​(J∥JA​⊗JO​)​≤log2DKL​(λ∥λA​⊗λC​)​,

where the subscripts denote pushforward marginals and both sides are extended nonnegative numbers, so finiteness is not required.

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