Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4, Eq. (8): common randomness dominates one-way distillation

Open
QAlgorithms.Papers.Independent.Gap48.P35.common_dominates_distillation

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 ρAB\rho_{AB}ρAB​ be any density state. Both displayed rates permit only communication B→AB\to AB→A.

ED←(ρAB)≤CD←(ρAB).E_D^{\leftarrow}(\rho_{AB})\le C_D^{\leftarrow}(\rho_{AB}).ED←​(ρAB​)≤CD←​(ρAB​).

This compares operational net common randomness with one-way EPR distillation on the same input.

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.4, Proposition 4, Eq.(8): net common randomness dominates distillation, both with B-to-A communication. -/
theorem common_dominates_distillation {A : Type} {B : Type}
    [Fintype A] [DecidableEq A] [Nonempty A] [Fintype B] [DecidableEq B] [Nonempty B]
    (rho : Op (A × B)) (hrho : IsDensityMatrix rho) :
    distillLeft rho ≤ commonLeft rho := by sorry

end

end QAlgorithms.Papers.Independent.Gap48.P35
Source
Monogamy of entanglement and other correlations, arXiv:quant-ph/0310037v1, PDF p. 4, Proposition 4, Eq. (8): common randomness dominates one-way distillation
Read-back

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

Let A,BA,BA,B be finite nonempty types with decidable equality and let ρ\rhoρ be a positive semidefinite complex matrix of trace 111 on A×BA\times BA×B. Define DB→A(ρ)D_{B\to A}(\rho)DB→A​(ρ) as the supremum of real rates rrr for which there is a protocol at every natural block length nnn, including n=0n=0n=0, with a positive output dimension mnm_nmn​, a positive number lnl_nln​ of BBB-party outcomes, Kraus matrices Bij:Bn→{0,…,mn−1}B_{ij}:B^n\to\{0,\ldots,m_n-1\}Bij​:Bn→{0,…,mn​−1} satisfying ∑i,jBij†Bij=I\sum_{i,j}B_{ij}^\dagger B_{ij}=I∑i,j​Bij†​Bij​=I, and, for each iii, Kraus matrices Aik:An→{0,…,mn−1}A_{ik}:A^n\to\{0,\ldots,m_n-1\}Aik​:An→{0,…,mn​−1} satisfying ∑kAik†Aik=I\sum_kA_{ik}^\dagger A_{ik}=I∑k​Aik†​Aik​=I, such that the output

ωn=∑i,j,k(Aik⊗Bij)ρ⊗n(Aik⊗Bij)†\omega_n=\sum_{i,j,k}(A_{ik}\otimes B_{ij})\rho^{\otimes n} (A_{ik}\otimes B_{ij})^\daggerωn​=i,j,k∑​(Aik​⊗Bij​)ρ⊗n(Aik​⊗Bij​)†

satisfies ⟨Φmn∣ωn∣Φmn⟩→1\langle\Phi_{m_n}|\omega_n|\Phi_{m_n}\rangle\to1⟨Φmn​​∣ωn​∣Φmn​​⟩→1 and log⁡2(mn)/n→r\log_2(m_n)/n\to rlog2​(mn​)/n→r, where ∣Φm⟩=m−1/2∑a=0m−1∣a,a⟩|\Phi_m\rangle=m^{-1/2}\sum_{a=0}^{m-1}|a,a\rangle∣Φm​⟩=m−1/2∑a=0m−1​∣a,a⟩; equivalently, one may keep the output order B,AB,AB,A, as in the definition’s swapped input. No explicit nonnegativity condition is imposed on the real rate in this supremum, and division by zero at n=0n=0n=0 is assigned zero. Define KB→A(ρ)=sup⁡R≥0(CR(ρ)−R)K_{B\to A}(\rho)=\sup_{R\ge0}(C_R(\rho)-R)KB→A​(ρ)=supR≥0​(CR​(ρ)−R), where CRC_RCR​ is the supremum of real hhh such that some c≥0c\ge0c≥0, for every ϵ,δ>0\epsilon,\delta>0ϵ,δ>0 and all sufficiently large positive nnn, permits a finite POVM EuE_uEu​ on BnB^nBn, maps f,gf,gf,g from its outcomes to positive finite message and key alphabets, and a finite POVM Df(u),jD_{f(u),j}Df(u),j​ on AnA^nAn, satisfying log⁡2∣range⁡f∣≤nR\log_2|\operatorname{range}f|\le nRlog2​∣rangef∣≤nR, key alphabet size at most 2cn2^{cn}2cn, disagreement at most ϵ\epsilonϵ, and key entropy at least n(h−δ)n(h-\delta)n(h−δ); each POVM consists of positive semidefinite effects summing to the identity, the joint law is p(u,j)=Re⁡tr⁡[(Df(u),j⊗Eu)ρ⊗n]p(u,j)=\operatorname{Re}\operatorname{tr}[(D_{f(u),j}\otimes E_u)\rho^{\otimes n}]p(u,j)=Retr[(Df(u),j​⊗Eu​)ρ⊗n], disagreement is ∑g(u)≠jp(u,j)\sum_{g(u)\ne j}p(u,j)∑g(u)=j​p(u,j), and key entropy is −∑kπklog⁡2πk-\sum_k\pi_k\log_2\pi_k−∑k​πk​log2​πk​ for πk=∑u:g(u)=k∑jp(u,j)\pi_k=\sum_{u:g(u)=k}\sum_jp(u,j)πk​=∑u:g(u)=k​∑j​p(u,j). Then

DB→A(ρ)≤KB→A(ρ).D_{B\to A}(\rho)\le K_{B\to A}(\rho).DB→A​(ρ)≤KB→A​(ρ).
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