Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 9, Eq. (14): two-way distillation versus joint entanglement cost

Open
QAlgorithms.Papers.Independent.Gap48.P35.two_way_distillation_cost_tradeoff

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

prove2quantum

All systems are finite nonzero-dimensional complex quantum systems. Density states are positive semidefinite with trace one, and SSS is von Neumann entropy in bits. Write EfE_fEf​ for formation, I←I^{\leftarrow}I← for maximal Holevo correlation measured on the second party, ECE_CEC​ for asymptotic singlet preparation cost, EDE_DED​ for EPR distillation rate, CDC_DCD​ for net common randomness, and KKK for secret-key rate. A left arrow means communication from the second legitimate party to the first. Key secrecy includes all public transcripts. Asymptotic tasks use independent copies, vanishing error and no extra initially shared resource.

Let ρABC\rho_{ABC}ρABC​ be any density state. Both distillation terms permit unrestricted two-way classical communication. The right side is singlet preparation cost across the grouped cut A:BCA:BCA:BC.

ED(ρAB)+ED(ρAC)≤EC(ρA:BC).E_D(\rho_{AB})+E_D(\rho_{AC})\le E_C(\rho_{A:BC}).ED​(ρAB​)+ED​(ρAC​)≤EC​(ρA:BC​).

This compares two-way yields to joint formation cost, without a purity restriction.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P35
Formal statement
namespace QAlgorithms.Papers.Independent.Gap48.P35

open scoped Matrix ComplexConjugate ComplexOrder

open Filter Topology

open Information100.P21 (Op)

open Information100.P08 (IsPure formation measuredCorrelation)

open Dependency50.P19 (marginalRA marginalRB)

noncomputable section

/-- PDF p.6, Corollary 9, Eq.(14): TWO-WAY distillation on the left and joint formation cost on the right, for arbitrary mixed states. -/
theorem two_way_distillation_cost_tradeoff {A : Type} {B : Type} {C : Type}
    [Fintype A] [DecidableEq A] [Nonempty A] [Fintype B] [DecidableEq B] [Nonempty B] [Fintype C] [DecidableEq C] [Nonempty C]
    (rho : Op (A × (B × C))) (hrho : IsDensityMatrix rho) :
    distillTwoWay (marginalRA rho) + distillTwoWay (marginalRB rho) ≤ finiteSystemPreparationCost rho := by sorry

end

end QAlgorithms.Papers.Independent.Gap48.P35
Source
Monogamy of entanglement and other correlations, arXiv:quant-ph/0310037v1, PDF p. 6, Corollary 9, Eq. (14): two-way distillation versus joint entanglement cost
Read-back

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

For all finite, nonempty A,B,CA,B,CA,B,C, each with decidable equality, and every positive semidefinite trace-one matrix ρ\rhoρ on A⊗B⊗CA\otimes B\otimes CA⊗B⊗C, writing ρAB=Tr⁡Cρ\rho_{AB}=\operatorname{Tr}_C\rhoρAB​=TrC​ρ and ρAC=Tr⁡Bρ\rho_{AC}=\operatorname{Tr}_B\rhoρAC​=TrB​ρ, one has

D↔(ρAB)+D↔(ρAC)≤Eprep(ρA:BC).D_{\leftrightarrow}(\rho_{AB})+D_{\leftrightarrow}(\rho_{AC}) \le E_{\mathrm{prep}}(\rho_{A:BC}).D↔​(ρAB​)+D↔​(ρAC​)≤Eprep​(ρA:BC​).

All systems are first reindexed by the fixed bijections with finite index sets used in the definitions. For a bipartite state σXY\sigma_{XY}σXY​, D↔(σ)D_{\leftrightarrow}(\sigma)D↔​(σ) is the supremum over real rrr for which there exist positive integers MnM_nMn​ and finite local-operations-and-classical-communication maps Λn:X⊗n⊗Y⊗n→CMn⊗CMn\Lambda_n:X^{\otimes n}\otimes Y^{\otimes n}\to\mathbb C^{M_n}\otimes\mathbb C^{M_n}Λn​:X⊗n⊗Y⊗n→CMn​⊗CMn​, for every natural nnn, such that

⟨ΦMn∣Λn(σ⊗n)∣ΦMn⟩→1,log⁡2Mnn→r,∣ΦM⟩=M−1/2∑j=0M−1∣jj⟩.\langle\Phi_{M_n}|\Lambda_n(\sigma^{\otimes n})|\Phi_{M_n}\rangle\to1, \qquad \frac{\log_2M_n}{n}\to r, \qquad |\Phi_M\rangle=M^{-1/2}\sum_{j=0}^{M-1}|jj\rangle.⟨ΦMn​​∣Λn​(σ⊗n)∣ΦMn​​⟩→1,nlog2​Mn​​→r,∣ΦM​⟩=M−1/2j=0∑M−1​∣jj⟩.

The quantity Eprep(σ)E_{\mathrm{prep}}(\sigma)Eprep​(σ) is the infimum over real eee such that, for every ϵ,δ>0\epsilon,\delta>0ϵ,δ>0, there exist natural numbers m,nm,nm,n, with n>0n>0n>0, and a finite local map Λ\LambdaΛ satisfying ∣e−m/n∣≤δ|e-m/n|\le\delta∣e−m/n∣≤δ and 12∥Λ(s⊗m)−σ⊗n∥1≤ϵ\frac12\|\Lambda(s^{\otimes m})-\sigma^{\otimes n}\|_1\le\epsilon21​∥Λ(s⊗m)−σ⊗n∥1​≤ϵ, where sss projects onto (∣01⟩−∣10⟩)/2(|01\rangle-|10\rangle)/\sqrt2(∣01⟩−∣10⟩)/2​ and ∥X∥1=Re⁡Tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{Tr}\sqrt{X^\dagger X}∥X∥1​=ReTrX†X​. In both definitions a finite local map is built recursively from identities by finite local Kraus measurements on either party, satisfying ∑iKi†Ki=I\sum_iK_i^\dagger K_i=I∑i​Ki†​Ki​=I, followed by outcome-dependent finite local maps and summation of the branches; no communication bound is imposed. Formation permits m=0m=0m=0 and chooses a block length separately for each pair of tolerances, whereas the distillation definition requires a sequence valid also at n=0n=0n=0, with its rate quotient defined as zero.

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

    Confirmed by the moderator at approval.

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