Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 3: exact zero-communication conversion of maximally entangled states

Open
QAlgorithms.Papers.Independent.Intakenext100.P61.zero_communication_conversion

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For normalized finite-dimensional bipartite pure states ϕ,ψ\phi,\psiϕ,ψ, write rϕ,rψr_\phi,r_\psirϕ​,rψ​ for their positive Schmidt ranks, and Δαβ=Sα−Sβ\Delta^{\alpha\beta}=S_\alpha-S_\betaΔαβ=Sα​−Sβ​ for base-two Rényi gaps. Any exact deterministic zero-communication conversion obeys Δαβ(ψA)≤Δαβ(ϕA)\Delta^{\alpha\beta}(\psi_A)\le\Delta^{\alpha\beta}(\phi_A)Δαβ(ψA​)≤Δαβ(ϕA​) for every 0≤α<β≤∞0\le\alpha<\beta\le\infty0≤α<β≤∞. Moreover, if ϕA\phi_AϕA​ is flat on its positive support, then

ϕ⟶ψ with zero communication  ⟺  ψA is flat and rψ∣rϕ.\phi\longrightarrow\psi\text{ with zero communication}\quad\iff\quad \psi_A\text{ is flat and }r_\psi\mid r_\phi.ϕ⟶ψ with zero communication⟺ψA​ is flat and rψ​∣rϕ​.

Local ancillas and disposal are allowed. This characterizes the exact zero-communication conversions between maximally entangled states, including product targets.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P61
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P61

open scoped Matrix ComplexConjugate

open QAlgorithms.Papers.Independent.Information100.P63 (logTwo)

open QAlgorithms.Papers.Independent.Dependency50.P35 (supportRank)

open QAlgorithms.Papers.Independent.Bridge50.P40 (entropyInfinity)

open QAlgorithms.Papers.Independent.Information100.P53 (fidelity)

attribute [local instance] Classical.propDecidable

section Operational

variable {A B C D : Type} [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
    [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]

/-- PDF p.3, Remark 3: every Renyi gap is nonincreasing at zero communication;
from a flat input, the flat target's positive Schmidt rank must and may divide the input rank. -/
theorem zero_communication_conversion (phi : EuclideanSpace ℂ (A × B))
    (psi : EuclideanSpace ℂ (C × D)) (hphi : ‖phi‖ = 1) (hpsi : ‖psi‖ = 1) :
    (Quantum (pureDensity phi) (pureDensity psi) 0 →
      ∀ alpha beta : RenyiOrder, alpha < beta →
        renyiGap (aliceDensity psi) alpha beta ≤ renyiGap (aliceDensity phi) alpha beta) ∧
    (Flat (aliceDensity phi) →
      (Quantum (pureDensity phi) (pureDensity psi) 0 ↔
        Flat (aliceDensity psi) ∧ supportRank (aliceDensity psi) ∣ supportRank (aliceDensity phi))) := by sorry

end Operational

end QAlgorithms.Papers.Independent.Intakenext100.P61

end
Source
On the communication cost of entanglement transformations, arXiv:quant-ph/0204092v3, PDF p. 3, Remark 3: exact zero-communication conversion of maximally entangled states
Read-back

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

For finite register types A,B,C,DA,B,C,DA,B,C,D and unit vectors ϕ\phiϕ on A×BA\times BA×B and ψ\psiψ on C×DC\times DC×D, put ρϕ=tr⁡B(ϕϕ†)\rho_\phi=\operatorname{tr}_B(\phi\phi^\dagger)ρϕ​=trB​(ϕϕ†) and ρψ=tr⁡D(ψψ†)\rho_\psi=\operatorname{tr}_D(\psi\psi^\dagger)ρψ​=trD​(ψψ†). A quantum execution is generated, after finite-register relabeling, by identity steps and trace-preserving local Kraus maps at zero cost, transfers of positive integer dimensional tensor factors in either direction costing log⁡2m\log_2mlog2​m, and finite composition adding costs. The declaration asserts both that an execution from ϕϕ†\phi\phi^\daggerϕϕ† to ψψ†\psi\psi^\daggerψψ† of cost exactly zero implies

Hα(ρψ)−Hβ(ρψ)≤Hα(ρϕ)−Hβ(ρϕ)for every 0≤α<β≤∞,H_\alpha(\rho_\psi)-H_\beta(\rho_\psi) \le H_\alpha(\rho_\phi)-H_\beta(\rho_\phi) \quad\text{for every }0\le\alpha<\beta\le\infty,Hα​(ρψ​)−Hβ​(ρψ​)≤Hα​(ρϕ​)−Hβ​(ρϕ​)for every 0≤α<β≤∞,

and that, if all positive eigenvalues of ρϕ\rho_\phiρϕ​ are equal, such a zero-cost execution exists if and only if all positive eigenvalues of ρψ\rho_\psiρψ​ are equal and rank⁡ρψ\operatorname{rank}\rho_\psirankρψ​ divides rank⁡ρϕ\operatorname{rank}\rho_\phirankρϕ​. Here H0H_0H0​ is the base-two logarithm of the number of positive eigenvalues, H1=−∑iλilog⁡2λiH_1=-\sum_i\lambda_i\log_2\lambda_iH1​=−∑i​λi​log2​λi​, Ha=(1−a)−1log⁡2∑iλiaH_a=(1-a)^{-1}\log_2\sum_i\lambda_i^aHa​=(1−a)−1log2​∑i​λia​ for finite a>0a>0a>0, a≠1a\ne1a=1, and H∞=−log⁡2max⁡iλiH_\infty=-\log_2\max_i\lambda_iH∞​=−log2​maxi​λi​, with sums over positive eigenvalues counted with multiplicity.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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