Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section III.C: pure-state optimistic and pessimistic entanglement erasure

Open
QAlgorithms.Papers.Independent.Intakenext100.P47.pureState_entanglementErasure

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

prove2quantum

Let ∣ψ⟩∈A⊗B|\psi\rangle\in A\otimes B∣ψ⟩∈A⊗B be a normalized pure state on finite nonzero spaces, and let ψ=∣ψ⟩⟨ψ∣\psi=|\psi\rangle\langle\psi|ψ=∣ψ⟩⟨ψ∣. For n≥1n\ge1n≥1 and ϵ>0\epsilon>0ϵ>0, define N(n,ϵ)N(n,\epsilon)N(n,ϵ) as the least number of product-unitary terms in a COLUR ensemble whose output on ψ⊗n\psi^{\otimes n}ψ⊗n is within full trace norm ϵ\epsilonϵ of a normalized separable state. The feasible sizes are nonempty and their minimum is attained. The normalized logarithmic cost sequences and their outer error suprema are bounded. Define the optimistic and pessimistic entanglement-erasure rates using lim inf⁡\liminfliminf and lim sup⁡\limsuplimsup, respectively, followed by the supremum over ϵ>0\epsilon>0ϵ>0. Then

E‾er(ψ)=Eer(ψ)=S(ψA),Cer(ψ)=2S(ψA).\underline E_{\rm er}(\psi)=E_{\rm er}(\psi)=S(\psi_A),\qquad C_{\rm er}(\psi)=2S(\psi_A).E​er​(ψ)=Eer​(ψ)=S(ψA​),Cer​(ψ)=2S(ψA​).

This is the unconditional pure-state erasure theorem, including product states. The conjectured optimum for retained classical correlations is not used.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P47
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P47

open QAlgorithms Filter

open QAlgorithms.Papers.Independent.Gap48.P20 (Copies localProduct)

open QAlgorithms.Papers.Independent.Dependency50.P19 (mutualInformation first)

open QAlgorithms.Papers.Independent.Dependency50.P45 (entropyExchange)

open QAlgorithms.Papers.Independent.Information100.P27 (shannon Config)

open QAlgorithms.Papers.Independent.Information100.P71 (channelPower)

open QAlgorithms.Papers.Independent.Advance50.P05 (RectangularInstrument)

open scoped Matrix ComplexConjugate

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF p.8, III.C: unconditional pure-state erasure; no conjectural classical optimum is included. -/
theorem pureState_entanglementErasure {A B : Type} [Fintype A] [Fintype B]
    [Nonempty A] [Nonempty B] (psi : EuclideanSpace ℂ (A × B)) (hpsi : IsState psi) :
    (∀ eps > (0 : ℝ), ∀ n, 0 < n →
      (disentanglingSizes (pureDensity psi) n eps).Nonempty ∧
      minimumDisentanglingSize (pureDensity psi) n eps ∈
        disentanglingSizes (pureDensity psi) n eps) ∧
    (∀ eps > (0 : ℝ), BddBelow (Set.range (entanglementBlockRate (pureDensity psi) eps)) ∧
      BddAbove (Set.range (entanglementBlockRate (pureDensity psi) eps))) ∧
    (∀ pessimistic,
      BddAbove {v | ∃ eps > (0 : ℝ),
        v = rateLimit pessimistic (entanglementBlockRate (pureDensity psi) eps)} ∧
      entanglementErasure (pureDensity psi) pessimistic =
        vnEntropy (traceRight (pureDensity psi))) ∧
    totalErasure (pureDensity psi) .coordinated .size true =
      2 * vnEntropy (traceRight (pureDensity psi)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P47

end
Source
On the quantum, classical and total amount of correlations in a quantum state, arXiv:quant-ph/0410091v2, PDF p. 8, Section III.C: pure-state optimistic and pessimistic entanglement erasure
Read-back

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

For any finite nonempty types A,BA,BA,B and vector ψ∈CA×B\psi\in\mathbb C^{A\times B}ψ∈CA×B with Euclidean norm one, put ρ=∣ψ⟩⟨ψ∣\rho=|\psi\rangle\langle\psi|ρ=∣ψ⟩⟨ψ∣, where ρxy=ψ(x)ψ(y)‾\rho_{xy}=\psi(x)\overline{\psi(y)}ρxy​=ψ(x)ψ(y)​, and let ρ[n]\rho^{[n]}ρ[n] have entries ρ(a,b),(a′,b′)[n]=∏t<nρ(at,bt),(at′,bt′)\rho^{[n]}_{(a,b),(a',b')}=\prod_{t<n}\rho_{(a_t,b_t),(a'_t,b'_t)}ρ(a,b),(a′,b′)[n]​=∏t<n​ρ(at​,bt​),(at′​,bt′​)​. A random local-unitary operation on nnn copies means a positive finite number NNN of pairs of local unitaries, with nonnegative weights summing to one, acting by R(X)=∑i<Nwi(Ui⊗Vi)X(Ui⊗Vi)†\mathcal R(X)=\sum_{i<N}w_i(U_i\otimes V_i)X(U_i\otimes V_i)^\daggerR(X)=∑i<N​wi​(Ui​⊗Vi​)X(Ui​⊗Vi​)†; zero weights and repeated unitary pairs are permitted and still contribute to NNN. Let D(n,ε)\mathcal D(n,\varepsilon)D(n,ε) be the set of such counts NNN for which R(ρ[n])\mathcal R(\rho^{[n]})R(ρ[n]) is within trace norm ε\varepsilonε of a separable density matrix, meaning a finite convex combination of tensor products of positive semidefinite trace-one matrices. Write m(n,ε)=inf⁡D(n,ε)m(n,\varepsilon)=\inf\mathcal D(n,\varepsilon)m(n,ε)=infD(n,ε), with the infimum taken in the natural numbers, and

bε(k)=log⁡2m(k+1,ε)k+1.b_\varepsilon(k)=\frac{\log_2 m(k+1,\varepsilon)}{k+1}.bε​(k)=k+1log2​m(k+1,ε)​.

The theorem asserts that for every real ε>0\varepsilon>0ε>0 and every natural n>0n>0n>0, D(n,ε)\mathcal D(n,\varepsilon)D(n,ε) is nonempty and m(n,ε)m(n,\varepsilon)m(n,ε) belongs to it; for every ε>0\varepsilon>0ε>0, the range of bεb_\varepsilonbε​ is bounded both below and above; and, for either choice of ℓ\ellℓ as the real lim inf⁡k→∞\liminf_{k\to\infty}liminfk→∞​ or lim sup⁡k→∞\limsup_{k\to\infty}limsupk→∞​, the set {ℓ(bε):ε>0}\{\ell(b_\varepsilon):\varepsilon>0\}{ℓ(bε​):ε>0} is bounded above and

sup⁡ε>0ℓ(bε)=S(Tr⁡Bρ).\sup_{\varepsilon>0}\ell(b_\varepsilon)=S(\operatorname{Tr}_B\rho).ε>0sup​ℓ(bε​)=S(TrB​ρ).

It also asserts

sup⁡ε>0lim sup⁡k→∞inf⁡{log⁡2N: R(ρ[k+1]) is within trace norm ε of some σA⊗σB}k+1=2S(Tr⁡Bρ),\sup_{\varepsilon>0}\limsup_{k\to\infty} \frac{\inf\{\log_2N:\ \mathcal R(\rho^{[k+1]}) \text{ is within trace norm }\varepsilon \text{ of some }\sigma_A\otimes\sigma_B\}}{k+1} =2S(\operatorname{Tr}_B\rho),ε>0sup​k→∞limsup​k+1inf{log2​N: R(ρ[k+1]) is within trace norm ε of some σA​⊗σB​}​=2S(TrB​ρ),

where the infimum ranges over the random local-unitary families just described and over density matrices σA,σB\sigma_A,\sigma_BσA​,σB​; the two local choices may be coordinated through their common index. Here ∥X∥1=Re⁡tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{tr}\sqrt{X^\dagger X}∥X∥1​=RetrX†X​ and S(X)=−Re⁡tr⁡[(x↦xlog⁡2x)(X)]S(X)=-\operatorname{Re}\operatorname{tr}[(x\mapsto x\log_2x)(X)]S(X)=−Retr[(x↦xlog2​x)(X)]. The finite-block assertions exclude n=0n=0n=0, while ε\varepsilonε ranges over all positive reals without an upper restriction.

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