Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 9: arbitrary EPR assistance

Open
QAlgorithms.Papers.Independent.Intakenext100.P61.epr_assisted_lower

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

prove2quantum

Let ϕ,ψ\phi,\psiϕ,ψ be normalized bipartite pure states and let k≥0k\ge0k≥0 be any finite integer. A deterministic protocol starts with ϕ\phiϕ and kkk additional EPR pairs and has unconditional output of squared fidelity at least 1−ε1-\varepsilon1−ε to ψ\psiψ, where 0≤ε<1/40\le\varepsilon<1/40≤ε<1/4. With quantum cost C=∑ilog⁡2diC=\sum_i\log_2 d_iC=∑i​log2​di​, δ=(4ε)1/8\delta=(4\varepsilon)^{1/8}δ=(4ε)1/8 and joint spectral-subset smooth spread Δe\Delta_eΔe​,

2C≥Δδ(ψA)−Δ(ϕA)+2log⁡2(1−δ).2C\ge\Delta_\delta(\psi_A)-\Delta(\phi_A)+2\log_2(1-\delta).2C≥Δδ​(ψA​)−Δ(ϕA​)+2log2​(1−δ).

There is no upper bound on kkk, and the initial term is computed from ϕ\phiϕ alone. This permits finite EPR assistance without arbitrary catalysts.

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.5, Corollary 9: any finite number k of supplementary EPR pairs;
the right-hand side still uses phi alone. -/
theorem epr_assisted_lower (phi : EuclideanSpace ℂ (A × B))
    (psi : EuclideanSpace ℂ (C × D)) (hphi : ‖phi‖ = 1) (hpsi : ‖psi‖ = 1)
    (k : ℕ) (epsilon cost : ℝ) (hzero : 0 ≤ epsilon) (hsmall : epsilon < 1 / 4)
    (hprotocol : QuantumPrepares (tensorPureStates phi (eprPairs k)) psi epsilon cost) :
    2 * cost ≥ smoothSpread (aliceDensity psi) (smoothingError epsilon) -
      spread (aliceDensity phi) + 2 * logTwo (1 - smoothingError epsilon) := 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. 5, Corollary 9: arbitrary EPR assistance
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, unit vectors ϕ\phiϕ on A×BA\times BA×B and ψ\psiψ on C×DC\times DC×D, every natural number kkk, and real numbers 0≤ϵ<1/40\le\epsilon<1/40≤ϵ<1/4 and ccc, form the input vector with coordinates

ϕ~((a,i),(b,j))=ϕ(a,b){1/2k,i=j,0,i≠j,0≤i,j<2k.\widetilde\phi_{((a,i),(b,j))} =\phi_{(a,b)} \begin{cases} 1/\sqrt{2^k},&i=j,\\ 0,&i\ne j, \end{cases} \qquad 0\le i,j<2^k.ϕ​((a,i),(b,j))​=ϕ(a,b)​{1/2k​,0,​i=j,i=j,​0≤i,j<2k.

Suppose a quantum execution of cost exactly ccc takes ϕ~ϕ~†\widetilde\phi\widetilde\phi^\daggerϕ​ϕ​† to some matrix σ\sigmaσ whose squared root fidelity with ψψ†\psi\psi^\daggerψψ† is at least 1−ϵ1-\epsilon1−ϵ, where root fidelity is Re⁡tr⁡σ ψψ†σ\operatorname{Re}\operatorname{tr}\sqrt{\sqrt{\sigma}\,\psi\psi^\dagger\sqrt{\sigma}}Retrσ​ψψ†σ​​. Quantum executions are generated by identity and trace-preserving local Kraus maps at zero cost, transfers of positive integer dimensional factors in either direction costing log⁡2m\log_2mlog2​m, and finite composition adding costs, after finite-register relabeling. Put δ=(4ϵ)1/8\delta=(4\epsilon)^{1/8}δ=(4ϵ)1/8, ρϕ=tr⁡B(ϕϕ†)\rho_\phi=\operatorname{tr}_B(\phi\phi^\dagger)ρϕ​=trB​(ϕϕ†), and ρψ=tr⁡D(ψψ†)\rho_\psi=\operatorname{tr}_D(\psi\psi^\dagger)ρψ​=trD​(ψψ†). For positive eigenvalues λi\lambda_iλi​ counted with multiplicity, let S(ρ)=log⁡2rank⁡ρ+log⁡2λmax⁡(ρ)S(\rho)=\log_2\operatorname{rank}\rho+\log_2\lambda_{\max}(\rho)S(ρ)=log2​rankρ+log2​λmax​(ρ) and let Sδ(ρ)S_\delta(\rho)Sδ​(ρ) be the logarithm of the minimum of ∣J∣max⁡i∈Jλi|J|\max_{i\in J}\lambda_i∣J∣maxi∈J​λi​ over subsets of positive eigenvalue indices with total weight at least 1−δ1-\delta1−δ, without renormalizing them. Then

2c≥Sδ(ρψ)−S(ρϕ)+2log⁡2(1−δ).2c\ge S_\delta(\rho_\psi)-S(\rho_\phi)+2\log_2(1-\delta).2c≥Sδ​(ρψ​)−S(ρϕ​)+2log2​(1−δ).

This includes k=0k=0k=0 and ϵ=0\epsilon=0ϵ=0.

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