Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Universal output-entanglement cap for phase-insensitive channels

Open
QAlgorithms.Papers.Independent.Intakethird100.P89.universalOutputEntanglementCap

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

prove2quantum

Let r≥0r\ge0r≥0, τ≥0\tau\ge0τ≥0, and let Φ\PhiΦ be a zero-displacement phase-insensitive Gaussian channel on a complete oscillator, with noise y≥∣1−τ∣y\ge|1-\tau|y≥∣1−τ∣. For every normalized trace-class two-oscillator input ρ\rhoρ, apply Φ\PhiΦ to the first oscillator and the identity to the second. Partial transpose is taken in the number basis, and the trace norm has values in [0,∞][0,\infty][0,∞]. Then

y≥e−2r(1+τ)⟺∀ρ, ∥[(Φ⊗id)(ρ)]Γ∥1≤e2r.y\ge e^{-2r}(1+\tau)\quad\Longleftrightarrow\quad\forall\rho,\ \bigl\|[(\Phi\otimes\mathrm{id})(\rho)]^\Gamma\bigr\|_1\le e^{2r}.y≥e−2r(1+τ)⟺∀ρ, ​[(Φ⊗id)(ρ)]Γ​1​≤e2r.

Equivalently, membership in the physical closed region defined by (3) and (8) is precisely this universal cap. At r=0r=0r=0 its scalar threshold becomes y≥1+τy\ge1+\tauy≥1+τ, the entanglement-breaking threshold (4).

This statement tests all input densities, including non-Gaussian and infinite-energy ones. The closed region includes ideal boundary limits; it is not asserted to be the finite-energy realization set.

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.3, (8): universal output cap on ALL normalized two-mode states,
not just Gaussian tests. Infinity of partial-transpose trace norm is preserved.
At r=0 the same condition is the entanglement-breaking noise threshold (4). -/
theorem universalOutputEntanglementCap (r tau y : ℝ) (Phi : OscillatorChannel)
    (hr : 0 ≤ r) (htau : 0 ≤ tau) (hPhi : PhaseInsensitive Phi tau y) :
    (Real.exp (-2 * r) * (1 + tau) ≤ y ↔
      ∀ rho : State (ℕ × ℕ),
        traceSize (partialTransposeFirst (tensorApply Phi rho.coefficients)) ≤
          ENNReal.ofReal (Real.exp (2 * r))) ∧
    ((tau, y) ∈ entanglementAccessibleRegion r ↔
      ∀ rho : State (ℕ × ℕ),
        traceSize (partialTransposeFirst (tensorApply Phi rho.coefficients)) ≤
          ENNReal.ofReal (Real.exp (2 * r))) ∧
    (Real.exp (-2 * (0 : ℝ)) * (1 + tau) ≤ y ↔ 1 + tau ≤ y) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P89

end
Source
Optimal continuous variable quantum teleportation with limited resources, arXiv:1705.03017v5, PDF p. 3, Implementable channels and universal output-entanglement cap, Eq. (8)
Read-back

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

Let r,τ,y∈Rr,\tau,y\in\mathbb Rr,τ,y∈R with r≥0r\ge0r≥0 and τ≥0\tau\ge0τ≥0, and let Φ\PhiΦ be a function on complex kernels on N\mathbb NN. A trace-class kernel on III means one with an expansion Xij=∑kuk(i)vk(j)‾X_{ij}=\sum_k u_k(i)\overline{v_k(j)}Xij​=∑k​uk​(i)vk​(j)​, uk,vk∈ℓ2(I;C)u_k,v_k\in\ell^2(I;\mathbb C)uk​,vk​∈ℓ2(I;C), and ∑k∥uk∥∥vk∥<∞\sum_k\|u_k\|\|v_k\|<\infty∑k​∥uk​∥∥vk​∥<∞; a density kernel additionally has real nonnegative finite quadratic forms, a summable real diagonal, and real diagonal sum one. Assume Φ\PhiΦ preserves trace-class kernels, is additive and complex homogeneous on them, and preserves density kernels under every finite ampliation on its first factor, including the vacuous ancillary-dimension-zero test. Assume also ∣τ−1∣≤y|\tau-1|\le y∣τ−1∣≤y and, for every one-mode density kernel SSS and every z∈Cz\in\mathbb Cz∈C,

χΦ(S)(z)=χS(τz)e−y∣z∣2/2,χX(z)=∑m∑nXmnDnm(z),Dmn(z)=e−∣z∣2/2m!n!∑j=0min⁡(m,n)zm−j(−z‾)n−jj!(m−j)!(n−j)!.\chi_{\Phi(S)}(z)=\chi_S(\sqrt\tau z)e^{-y|z|^2/2}, \quad \chi_X(z)=\sum_m\sum_nX_{mn}D_{nm}(z), \quad D_{mn}(z)=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)!}.χΦ(S)​(z)=χS​(τ​z)e−y∣z∣2/2,χX​(z)=m∑​n∑​Xmn​Dnm​(z),Dmn​(z)=e−∣z∣2/2m!n!​j=0∑min(m,n)​j!(m−j)!(n−j)!zm−j(−z)n−j​.

For any kernel XXX, let N(X)N(X)N(X) be the infimum, in [0,∞][0,\infty][0,∞], of ∑k∥uk∥∥vk∥\sum_k\|u_k\|\|v_k\|∑k​∥uk​∥∥vk​∥ over its expansions just specified, with value ∞\infty∞ if there are none. For each two-mode density kernel RRR, set

Z(i,a),(j,b)=Φ((R(k,a),(ℓ,b))k,ℓ)ij,Z(i,a),(j,b)Γ=Z(j,a),(i,b).Z_{(i,a),(j,b)} =\Phi\bigl((R_{(k,a),(\ell,b)})_{k,\ell}\bigr)_{ij}, \qquad Z^\Gamma_{(i,a),(j,b)}=Z_{(j,a),(i,b)}.Z(i,a),(j,b)​=Φ((R(k,a),(ℓ,b)​)k,ℓ​)ij​,Z(i,a),(j,b)Γ​=Z(j,a),(i,b)​.

Then e−2r(1+τ)≤ye^{-2r}(1+\tau)\le ye−2r(1+τ)≤y holds if and only if N(ZΓ)≤[e2r]+N(Z^\Gamma)\le[e^{2r}]_+N(ZΓ)≤[e2r]+​ for every such RRR; equivalently, the three conditions τ≥0\tau\ge0τ≥0, ∣1−τ∣≤y|1-\tau|\le y∣1−τ∣≤y, and e−2r(1+τ)≤ye^{-2r}(1+\tau)\le ye−2r(1+τ)≤y hold if and only if that same universal bound holds. This quantification imposes no energy or Gaussian condition on RRR. The statement also includes

e−2⋅0(1+τ)≤y⟺1+τ≤y.e^{-2\cdot0}(1+\tau)\le y\quad\Longleftrightarrow\quad1+\tau\le y.e−2⋅0(1+τ)≤y⟺1+τ≤y.
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