Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 7: distillable entanglement lower bound

Open
QAlgorithms.Papers.Independent.Support50.P16.updated_relative_entropy_bounds_distillation

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ρAB\rho_{AB}ρAB​ be any normalized finite-dimensional bipartite state with nonzero local dimensions. Let EdE_dEd​ be its operational two-way LOCC distillable entanglement: the supremum of asymptotically achievable rates log⁡2dn/n\log_2 d_n/nlog2​dn​/n of normalized rank-dnd_ndn​ maximally entangled targets, with vanishing full trace-norm error for all sufficiently large positive block lengths. Let Er,→E_{r,\to}Er,→​ be the supremum, over LOCC operations with arbitrary finite quantum outputs, of one-way measured relative entropy of entanglement. Its regularization limit exists and

Er,→∞(ρAB)≥Ed(ρAB).E_{r,\to}^\infty(\rho_{AB})\ge E_d(\rho_{AB}).Er,→∞​(ρAB​)≥Ed​(ρAB​).

The supremum need not be attained by an optimum protocol sequence. This relates a measured-relative-entropy quantity to an operational distillation rate.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P16
Formal statement
namespace QAlgorithms.Papers.Independent.Support50.P16

noncomputable section

open QAlgorithms Filter

open scoped Matrix ComplexConjugate ComplexOrder ENNReal

attribute [local instance] Classical.propDecidable Classical.decEq

local notation "tau" => QAlgorithms.Papers.Independent.Information100.P76.maximallyMixed

local notation "RE" => QAlgorithms.Papers.Independent.Information100.P54.relativeEntanglement

local notation "RER" => QAlgorithms.Papers.Independent.Information100.P54.regularizedEntanglement

local notation "SQ" => QAlgorithms.Papers.Independent.Dependency50.P19.squashed

local notation "CMI" => QAlgorithms.Papers.Independent.Dependency50.P19.conditionalMutual

local notation "MI" => QAlgorithms.Papers.Independent.Dependency50.P19.mutualInformation

local notation "LOCC" => QAlgorithms.Papers.Independent.Information100.P21.FiniteLOCC

local notation "power" => QAlgorithms.Papers.Independent.Dependency50.P42.dimensionedPower

local notation "index" => QAlgorithms.Papers.Independent.Dependency50.P42.copyIndex

-- Accepted matrix coordinates (not P50.Bipartite, which is a vector space).

local notation "Bipartite" => QAlgorithms.Papers.Independent.Dependency50.P50.BipartiteMat

-- Positive outcome counts follow already from a POVM on a nonzero register.

local notation "FiniteMeasurement" => QAlgorithms.Papers.Independent.Information100.P04.Measurement

local notation "relative" =>
  ((fun _ _ rho => RE rho) : ExtendedEntanglementFunctional)

-- Reuse the accepted operational/variational quantity through a typed notation.

local notation "squashed" =>
  ((fun _ _ rho => ENNReal.ofReal (SQ rho)) : ExtendedEntanglementFunctional)

local notation "originalMarginal" => QAlgorithms.Papers.Independent.Information100.P04.principalMarginal

-- Exact accepted partial trace of the same AA'BB' extension.

local notation "ancillaryMarginal" => QAlgorithms.Papers.Independent.Information100.P04.ancillaryMarginal

local notation "distillable" =>
  ((fun _ _ rho => ENNReal.ofReal (QAlgorithms.Papers.Independent.Gap48.P32.twoWayDistillable rho)) : ExtendedEntanglementFunctional)

local notation "cost" =>
  ((fun _ _ rho => ENNReal.ofReal (QAlgorithms.Papers.Independent.Dependency50.P42.alternativeCost
    (fun _ _ X Y => traceNorm (X-Y)) rho)) : ExtendedEntanglementFunctional)

/-- Proposition 7, PDF p.14; proof pp.14--15. E_d is operational two-way LOCC. -/
theorem updated_relative_entropy_bounds_distillation {a b : ℕ+} (rho : Bipartite a b)
    (hrho : IsDensityMatrix rho) :
    Regularizes updated rho ∧ distillable a b rho ≤ regularized updated rho := by sorry

end

end QAlgorithms.Papers.Independent.Support50.P16
Source
Relative entropy and squashed entanglement, arXiv:1210.3181v2, PDF p. 14, Proposition 7: distillable entanglement lower bound
Read-back

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

For all positive integers a,ba,ba,b and every positive semidefinite trace-111 ρ\rhoρ of the supplied type Bipartite(a,b)\mathrm{Bipartite}(a,b)Bipartite(a,b), define U(ρ)U(\rho)U(ρ) as the supremum, over positive output dimensions c,dc,dc,d and maps L:AB→CDL:AB\to CDL:AB→CD satisfying the supplied predicate LOCC(L)\mathrm{LOCC}(L)LOCC(L), of

inf⁡σ∈Sepc,d sup⁡M∈M→(c,d)K(pM(L(ρ)),pM(σ)).\inf_{\sigma\in\mathrm{Sep}_{c,d}}\ \sup_{M\in\mathcal M_\to(c,d)} K(p_M(L(\rho)),p_M(\sigma)).σ∈Sepc,d​inf​ M∈M→​(c,d)sup​K(pM​(L(ρ)),pM​(σ)).

Here Sepc,d\mathrm{Sep}_{c,d}Sepc,d​ consists of finite convex mixtures of product positive semidefinite trace-111 matrices; M→(c,d)\mathcal M_\to(c,d)M→​(c,d) consists of measurement records with effects ∑f(i,j)=xAi⊗Bij\sum_{f(i,j)=x}A_i\otimes B_{ij}∑f(i,j)=x​Ai​⊗Bij​, where (Ai)(A_i)(Ai​) is an Alice POVM and (Bij)j(B_{ij})_j(Bij​)j​ is a Bob POVM for each iii; pM(X)x=Re⁡Tr⁡(MxX)p_M(X)_x=\operatorname{Re}\operatorname{Tr}(M_xX)pM​(X)x​=ReTr(Mx​X); and K(p,q)K(p,q)K(p,q) is +∞+\infty+∞ if px>0p_x>0px​>0 but qx≤0q_x\le0qx​≤0 for some xxx, and otherwise is max⁡{0,∑xpx(log⁡2px−log⁡2qx)}\max\{0,\sum_xp_x(\log_2p_x-\log_2q_x)\}max{0,∑x​px​(log2​px​−log2​qx​)}, using total real logarithms. Then

U(Pr+1(ρ))r+1⟶U‾(ρ):=lim inf⁡r→∞U(Pr+1(ρ))r+1,distillable⁡(a,b,ρ)≤U‾(ρ).\frac{U(P_{r+1}(\rho))}{r+1} \longrightarrow \overline U(\rho):=\liminf_{r\to\infty} \frac{U(P_{r+1}(\rho))}{r+1}, \qquad \operatorname{distillable}(a,b,\rho)\le\overline U(\rho).r+1U(Pr+1​(ρ))​⟶U(ρ):=r→∞liminf​r+1U(Pr+1​(ρ))​,distillable(a,b,ρ)≤U(ρ).

The convergence and inequality take place in the extended nonnegative reals. The supplied code does not define distillable, power (denoted PnP_nPn​), the map predicate LOCC, Bipartite, or FiniteMeasurement.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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