Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Asymptotically reversible conversion of pure states

Open
QAlgorithms.Papers.Independent.Support50.P42.pure_state_interconversion

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

prove2quantum

Let ψ\psiψ and ϕ\phiϕ be normalized shared pure states on positive finite local dimensions. Call RRR achievable if, for every error and rate slack, all sufficiently large numbers nnn of input copies admit finite local protocols producing mmm target copies with vanishing global error and m/n≥Rm/n\ge Rm/n≥R up to that slack. If E(ϕ)>0E(\phi)>0E(ϕ)>0, then

R is achievable⟺0≤R≤E(ψ)E(ϕ).R\text{ is achievable}\quad\Longleftrightarrow\quad 0\le R\le\frac{E(\psi)}{E(\phi)}.R is achievable⟺0≤R≤E(ϕ)E(ψ)​.

If E(ϕ)=0E(\phi)=0E(ϕ)=0, every nonnegative rate is achievable by local preparation. Thus equal positive entropies permit unit-rate interconversion, while a product input cannot achieve a positive rate to an entangled target. The source's printed reciprocal ratio is interpreted as input cost; the displayed ratio counts output copies per input copy.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P42
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P42

open scoped BigOperators Matrix ComplexConjugate

open MeasureTheory ProbabilityTheory

attribute [local instance] Classical.propDecidable Classical.decEq

-- Reuse the exact accepted objects, without introducing same-name aliases.

open Information100.P21 (Op Vec FiniteLOCC)

open Dependency50.P42 (dimensionedPower singlets)

open Dependency50.P48 (pureFidelity)

open Gap48.P32 (pairOfState)

open Next46.P39 (rectAct)

/-- PDF p.16: full pure-state conversion rates. The printed reciprocal yield
is corrected to E(input)/E(output) for output dimensionedPower per input copy, as fixed
by concentration and dilution. Product targets require only local preparation. -/
theorem pure_state_interconversion (s t : Shared) (hs : IsPureShared s) (ht : IsPureShared t) :
    (0<ent t → ∀ R : ℝ, ConversionRate s t R ↔ 0≤R ∧ R≤ent s/ent t) ∧
    (ent t=0 → ∀ R : ℝ, 0≤R → ConversionRate s t R) := by sorry

end QAlgorithms.Papers.Independent.Support50.P42

end
Source
Concentrating Partial Entanglement by Local Operations, arXiv:quant-ph/9511030v1, PDF p. 16, §V: asymptotically reversible pure-state conversion
Read-back

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

Let s,ts,ts,t be bipartite states with positive finite local dimensions, positive semidefinite trace-one matrices ρs,ρt\rho_s,\rho_tρs​,ρt​, and unit vectors v,wv,wv,w such that ρs=vv†\rho_s=vv^\daggerρs​=vv† and ρt=ww†\rho_t=ww^\daggerρt​=ww†. Put Es=S(tr⁡Aρs)E_s=S(\operatorname{tr}_A\rho_s)Es​=S(trA​ρs​) and Et=S(tr⁡Aρt)E_t=S(\operatorname{tr}_A\rho_t)Et​=S(trA​ρt​), where S(X)=−tr⁡(Xlog⁡2X)S(X)=-\operatorname{tr}(X\log_2X)S(X)=−tr(Xlog2​X), with zero eigenvalues contributing zero. For a real number RRR, say that RRR is a conversion rate here precisely when R≥0R\ge0R≥0 and, for every ϵ,δ>0\epsilon,\delta>0ϵ,δ>0, there is a natural NNN such that every natural n>Nn>Nn>N admits a natural mmm and a finite recursive LOCC map LLL from the local dimensions of ρs[n]\rho_s^{[n]}ρs[n]​ to those of ρt[m]\rho_t^{[m]}ρt[m]​, satisfying

(R−δ)n≤m,12∥L(ρs[n])−ρt[m]∥1≤ϵ.(R-\delta)n\le m, \qquad \frac12\|L(\rho_s^{[n]})-\rho_t^{[m]}\|_1\le\epsilon.(R−δ)n≤m,21​∥L(ρs[n]​)−ρt[m]​∥1​≤ϵ.

The tensor powers are reindexed by the fixed equivalences between local strings and finite indices, and ∥X∥1=Re⁡tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{tr}\sqrt{X^\dagger X}∥X∥1​=RetrX†X​. The allowed LOCC maps are generated by identities and complete finite local Kraus measurements on either party, followed by outcome-dependent recursive continuations and summation over outcomes. If Et>0E_t>0Et​>0, then, for every real RRR, being such a conversion rate is equivalent to 0≤R≤Es/Et0\le R\le E_s/E_t0≤R≤Es​/Et​. If Et=0E_t=0Et​=0, every real R≥0R\ge0R≥0 is such a conversion rate. The output copy number mmm may be zero, and no upper bound on mmm is imposed.

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