Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Strict fixed-entanglement advantage over pure TMSS teleportation

Open
QAlgorithms.Papers.Independent.Intakethird100.P89.tmssEntanglementComparison

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

prove2quantum

Let λ>0\lambda>0λ>0 and r≥0r\ge0r≥0 be finite. Let F‾opt(λ,r)\overline F_{\rm opt}(\lambda,r)Fopt​(λ,r) be the closed-region Gaussian optimum, equal to the finite-energy BK fidelity supremum, and let F‾TMSS(λ,r)\overline F_{\rm TMSS}(\lambda,r)FTMSS​(λ,r) be the independently defined optimized-gain fidelity for a fixed pure TMSS of logarithmic negativity 2r2r2r. Then

F‾opt(λ,r)≥F‾TMSS(λ,r)≥F‾opt(λ,0).\overline F_{\rm opt}(\lambda,r)\ge\overline F_{\rm TMSS}(\lambda,r)\ge\overline F_{\rm opt}(\lambda,0).Fopt​(λ,r)≥FTMSS​(λ,r)≥Fopt​(λ,0).

Each equality holds if and only if r=0r=0r=0. Both inequalities are strict for r>0r>0r>0. For each fixed r≥0r\ge0r≥0,

lim⁡λ→0+[F‾opt(λ,r)−F‾TMSS(λ,r)]=0.\lim_{\lambda\to0^+}\left[\overline F_{\rm opt}(\lambda,r)-\overline F_{\rm TMSS}(\lambda,r)\right]=0.λ→0+lim​[Fopt​(λ,r)−FTMSS​(λ,r)]=0.

The advantage concerns shared logarithmic negativity, with no simultaneous fixed-energy constraint. In the first branch of (13), the larger optimum is a limiting supremum rather than a finite-energy attainable value. The broad-prior saturation is a limit of normalized ensembles.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P89
Formal statement
noncomputable section

open MeasureTheory Filter

open scoped BigOperators ENNReal Topology ComplexOrder

attribute [local instance] Classical.propDecidable Classical.decEq

namespace QAlgorithms.Papers.Independent.Intakethird100.P89

open QAlgorithms.Papers.Independent.Dependency50.P33
  (State IsDensity IsTraceClassChannel tensorApply traceSize)

open QAlgorithms.Papers.Independent.Dependency50.P39
  (coherentKet coherentCoefficient operatorOfMatrix husimiQ HasFockMatrix CoherentRealized)

open QAlgorithms.Papers.Independent.Frontier30.P14 (weylCharacteristic)

open QAlgorithms.Papers.Independent.Claimed50.P19
  (Cov FockIndex DensityKernel PhysicalCovariance CharacteristicSummable
   multimodeWeylTrace covarianceCharacteristicValue standardFormCovariance)

open QAlgorithms.Papers.Independent.Frontier30.P08 (QuadratureIndex)

open QAlgorithms.Papers.Independent.Gap48.P26 (PhaseInsensitive coherentKernel)

open QAlgorithms.Entanglement (partialTransposeFirst)

/-- PDF p.4, after (16): strict entanglement advantage at finite nonzero prior
width and r>0; both equality cases are r=0. The first gap vanishes as lambda->0+.
This compares fixed entanglement, without asserting equal resource energies. -/
theorem tmssEntanglementComparison (lambda r : ℝ) (hlambda : 0 < lambda) (hr : 0 ≤ r) :
    tmssOptimum lambda r ≤ scalarOptimum lambda r ∧
    scalarOptimum lambda 0 ≤ tmssOptimum lambda r ∧
    (scalarOptimum lambda r = tmssOptimum lambda r ↔ r = 0) ∧
    (tmssOptimum lambda r = scalarOptimum lambda 0 ↔ r = 0) ∧
    (0 < r → tmssOptimum lambda r < scalarOptimum lambda r ∧
      scalarOptimum lambda 0 < tmssOptimum lambda r) ∧
    Tendsto (fun ell => scalarOptimum ell r - tmssOptimum ell r)
      (nhdsWithin 0 (Set.Ioi 0)) (𝓝 0) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P89

end
Source
Optimal continuous variable quantum teleportation with limited resources, arXiv:1705.03017v5, PDF p. 4, Strict resource-entanglement advantage over TMSS teleportation
Read-back

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

For every real λ>0\lambda>0λ>0 and every real r≥0r\geq0r≥0, define the following two real suprema. First, let

S(λ,r)=sup⁡τ,y∈R0≤τ, ∣1−τ∣≤ye−2r(1+τ)≤y2λ2(1−τ)2+λ(1+y+τ).S(\lambda,r)= \sup_{\substack{\tau,y\in\mathbb R\\ 0\leq\tau,\ |1-\tau|\leq y\\ e^{-2r}(1+\tau)\leq y}} \frac{2\lambda} {2(1-\sqrt{\tau})^2+\lambda(1+y+\tau)}.S(λ,r)=τ,y∈R0≤τ, ∣1−τ∣≤ye−2r(1+τ)≤y​sup​2(1−τ​)2+λ(1+y+τ)2λ​.

Second, let H=ℓ2(N;C)H=\ell^2(\mathbb N;\mathbb C)H=ℓ2(N;C), let eje_jej​ be its standard coordinate vector, and put

tr(a,b)={(−tanh⁡r)a/cosh⁡r,a=b,0,a≠b.t_r(a,b)= \begin{cases} (-\tanh r)^a/\cosh r,&a=b,\\ 0,&a\neq b. \end{cases}tr​(a,b)={(−tanhr)a/coshr,0,​a=b,a=b.​

Define T(λ,r)T(\lambda,r)T(λ,r) as the supremum of Fλ(Φ)F_\lambda(\Phi)Fλ​(Φ) over every state ρ\rhoρ indexed by N×N\mathbb N\times\mathbb NN×N, every real gain ggg, and every function Φ\PhiΦ from complex matrices indexed by N\mathbb NN to such matrices, satisfying the conditions below. Here a matrix XXX indexed by a set III is called trace class precisely when there exist sequences uj,vj∈ℓ2(I;C)u_j,v_j\in\ell^2(I;\mathbb C)uj​,vj​∈ℓ2(I;C) such that ∑j∥uj∥∥vj∥\sum_j\|u_j\|\|v_j\|∑j​∥uj​∥∥vj​∥ is summable and Xab=∑juj(a)vj(b)‾X_{ab}=\sum_j u_j(a)\overline{v_j(b)}Xab​=∑j​uj​(a)vj​(b)​ for every a,ba,ba,b. A state is a matrix of this kind for which, for every finite A⊆IA\subseteq IA⊆I and every z:I→Cz:I\to\mathbb Cz:I→C, the number ∑a,b∈Az(a)‾Xabz(b)\sum_{a,b\in A}\overline{z(a)}X_{ab}z(b)∑a,b∈A​z(a)​Xab​z(b) has imaginary part zero and nonnegative real part, and whose real diagonal entries form a summable family with sum 111. The required conditions on ρ,g,Φ\rho,g,\Phiρ,g,Φ are that ρuv=tr(u)tr(v)‾\rho_{uv}=t_r(u)\overline{t_r(v)}ρuv​=tr​(u)tr​(v)​ for all u,v∈N2u,v\in\mathbb N^2u,v∈N2, that g>0g>0g>0, and that Φ\PhiΦ sends trace-class matrices to trace-class matrices, is additive and complex homogeneous on trace-class inputs, and has the following finite-extension property: for every integer d≥0d\geq0d≥0 and every state RRR indexed by N×{0,…,d−1}\mathbb N\times\{0,\ldots,d-1\}N×{0,…,d−1}, the matrix

Φ~(R)(a,s),(b,t)=Φ((R(i,s),(j,t))i,j∈N)ab\widetilde\Phi(R)_{(a,s),(b,t)} =\Phi\bigl((R_{(i,s),(j,t)})_{i,j\in\mathbb N}\bigr)_{ab}Φ(R)(a,s),(b,t)​=Φ((R(i,s),(j,t)​)i,j∈N​)ab​

is a state. This includes d=0d=0d=0, for which there are no states on the empty index set. To state the remaining condition and the objective, define the matrices

Dz(m,n)=e−∣z∣2/2m! n!∑j=0min⁡(m,n)zm−j(−z‾)n−jj! (m−j)! (n−j)!,χX(z)=∑m∑nXmnDz(n,m).D_z(m,n)=e^{-|z|^2/2}\sqrt{m!\,n!} \sum_{j=0}^{\min(m,n)} \frac{z^{m-j}(-\overline z)^{n-j}} {j!\,(m-j)!\,(n-j)!}, \qquad \chi_X(z)=\sum_m\sum_n X_{mn}D_z(n,m).Dz​(m,n)=e−∣z∣2/2m!n!​j=0∑min(m,n)​j!(m−j)!(n−j)!zm−j(−z)n−j​,χX​(z)=m∑​n∑​Xmn​Dz​(n,m).

For every input state σ\sigmaσ indexed by N\mathbb NN and every z∈Cz\in\mathbb Cz∈C, require

χΦ(σ)(z)=χσ(gz)∑u∈N2∑v∈N2ρuv D−gz‾(v1,u1) Dz(v2,u2).\chi_{\Phi(\sigma)}(z) = \chi_\sigma(gz) \sum_{u\in\mathbb N^2}\sum_{v\in\mathbb N^2} \rho_{uv}\, D_{-g\overline z}(v_1,u_1)\, D_z(v_2,u_2).χΦ(σ)​(z)=χσ​(gz)u∈N2∑​v∈N2∑​ρuv​D−gz​(v1​,u1​)Dz​(v2​,u2​).

For a matrix KKK indexed by N\mathbb NN, let AKA_KAK​ be a chosen bounded complex-linear operator on HHH satisfying (AKen)m=Kmn(A_Ke_n)_m=K_{mn}(AK​en​)m​=Kmn​ for all m,nm,nm,n, if such an operator exists, and let AK=0A_K=0AK​=0 otherwise. Let cα∈Hc_\alpha\in Hcα​∈H be a chosen vector with coordinates

cα(j)=e−∣α∣2/2αjj!,c_\alpha(j)=e^{-|\alpha|^2/2}\frac{\alpha^j}{\sqrt{j!}},cα​(j)=e−∣α∣2/2j!​αj​,

if such a vector exists, and let it be zero otherwise; set Kmnα=cα(m)cα(n)‾K^\alpha_{mn}=c_\alpha(m)\overline{c_\alpha(n)}Kmnα​=cα​(m)cα​(n)​. The fidelity appearing in the definition of TTT is

Fλ(Φ)=∫Cλπe−λ∣α∣2Re⁡⟨cα,AΦ(Kα)cα⟩ dα,F_\lambda(\Phi)= \int_{\mathbb C}\frac{\lambda}{\pi}e^{-\lambda|\alpha|^2} \operatorname{Re} \left\langle c_\alpha, A_{\Phi(K^\alpha)}c_\alpha\right\rangle\,d\alpha,Fλ​(Φ)=∫C​πλ​e−λ∣α∣2Re⟨cα​,AΦ(Kα)​cα​⟩dα,

where dαd\alphadα is Lebesgue measure. The infinite sums and integral here use their total definitions; the optimization conditions impose no separate summability or integrability hypotheses on these expressions. Both suprema are the total real supremum operation, whose value is 000 for an empty set or a set unbounded above. With these definitions, the declaration asserts all of

T(λ,r)≤S(λ,r),S(λ,0)≤T(λ,r),T(\lambda,r)\leq S(\lambda,r), \qquad S(\lambda,0)\leq T(\lambda,r),T(λ,r)≤S(λ,r),S(λ,0)≤T(λ,r), S(λ,r)=T(λ,r)  ⟺  r=0,T(λ,r)=S(λ,0)  ⟺  r=0,S(\lambda,r)=T(\lambda,r)\iff r=0, \qquad T(\lambda,r)=S(\lambda,0)\iff r=0,S(λ,r)=T(λ,r)⟺r=0,T(λ,r)=S(λ,0)⟺r=0,

and

r>0 ⟹ S(λ,0)<T(λ,r)<S(λ,r).r>0\ \Longrightarrow\ S(\lambda,0)<T(\lambda,r)<S(\lambda,r).r>0 ⟹ S(λ,0)<T(λ,r)<S(λ,r).

Thus the endpoint r=0r=0r=0 is included, and at that endpoint both displayed equalities hold. Finally, for each such fixed rrr,

lim⁡ℓ→0+(S(ℓ,r)−T(ℓ,r))=0.\lim_{\ell\to0^+}\bigl(S(\ell,r)-T(\ell,r)\bigr)=0.ℓ→0+lim​(S(ℓ,r)−T(ℓ,r))=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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me