Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section II, discounted ancillary correlation does not change total erasure cost

Open
QAlgorithms.Papers.Independent.Intakenext100.P47.discountedAncilla_erasure

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

prove2quantum

Fix a density matrix ρAB\rho_{AB}ρAB​ on finite nonzero complex spaces. Allow an arbitrary ancillary bipartite density matrix γCD\gamma_{CD}γCD​, with finite nonzero ancillary dimensions. Regroup ρ⊗γ\rho\otimes\gammaρ⊗γ as AC:BDAC:BDAC:BD and let CerC_{\rm er}Cer​ be the operational total-erasure rate computed from product-unitary noise ensembles. Every discounted cost has the same value, and hence

{Cer(ρ⊗γ)−Cer(γ):γCD as above}={I(A:B)ρ},inf⁡γ(Cer(ρ⊗γ)−Cer(γ))=I(A:B)ρ.\{C_{\rm er}(\rho\otimes\gamma)-C_{\rm er}(\gamma):\gamma_{CD}\text{ as above}\}=\{I(A:B)_\rho\},\qquad\inf_\gamma\bigl(C_{\rm er}(\rho\otimes\gamma)-C_{\rm er}(\gamma)\bigr)=I(A:B)_\rho.{Cer​(ρ⊗γ)−Cer​(γ):γCD​ as above}={I(A:B)ρ​},γinf​(Cer​(ρ⊗γ)−Cer​(γ))=I(A:B)ρ​.

The ancillary correlation is erased and its erasure cost discounted. This describes the ancillary-cost observation in Section II; no return of an unchanged catalyst is required.

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.5, ancillary-cost paragraph: erasing and discounting the ancillary correlation. -/
theorem discountedAncilla_erasure {A B : Type} [Fintype A] [Fintype B]
    [Nonempty A] [Nonempty B] (rho : Matrix (A × B) (A × B) ℂ)
    (hrho : IsDensityMatrix rho) :
    discountedCosts rho = {mutualInformation rho} ∧
    sInf (discountedCosts rho) = mutualInformation rho := 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. 5, Section II, discounted ancillary correlation does not change total erasure cost
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 any positive semidefinite matrix ρ\rhoρ on A×BA\times BA×B with trace 111, let E(X)=sup⁡ε>0lim sup⁡k→∞inf⁡Ck+1,ε(X)/(k+1)\mathcal E(X)=\sup_{\varepsilon>0}\limsup_{k\to\infty}\inf C_{k+1,\varepsilon}(X)/(k+1)E(X)=supε>0​limsupk→∞​infCk+1,ε​(X)/(k+1), where Cn,ε(X)C_{n,\varepsilon}(X)Cn,ε​(X) is the set of log⁡2r\log_2 rlog2​r for positive finite mixtures R(Y)=∑i=0r−1wi(Ui⊗Vi)Y(Ui⊗Vi)†\mathcal R(Y)=\sum_{i=0}^{r-1}w_i(U_i\otimes V_i)Y(U_i\otimes V_i)^\daggerR(Y)=∑i=0r−1​wi​(Ui​⊗Vi​)Y(Ui​⊗Vi​)†, with local unitaries and nonnegative weights summing to 111, such that R(Xn)\mathcal R(X_n)R(Xn​) is within trace norm ε\varepsilonε of a product of density matrices; here XnX_nXn​ is the nnn-fold tensor power with the two parties regrouped and ∥M∥1=Re⁡Tr⁡M†M\|M\|_1=\operatorname{Re}\operatorname{Tr}\sqrt{M^\dagger M}∥M∥1​=ReTrM†M​. Consider every pair of positive integers c,dc,dc,d and every density matrix γ\gammaγ on {0,…,c−1}×{0,…,d−1}\{0,\ldots,c-1\}\times\{0,\ldots,d-1\}{0,…,c−1}×{0,…,d−1}, and regroup ρ⊗γ\rho\otimes\gammaρ⊗γ so the first party holds A×{0,…,c−1}A\times\{0,\ldots,c-1\}A×{0,…,c−1} and the second holds B×{0,…,d−1}B\times\{0,\ldots,d-1\}B×{0,…,d−1}. The declaration asserts both

{E(ρ⊗γ)−E(γ):c,d>0, γ a density matrix}={I(ρ)},inf⁡{E(ρ⊗γ)−E(γ):c,d>0, γ a density matrix}=I(ρ),\{\mathcal E(\rho\otimes\gamma)-\mathcal E(\gamma):c,d>0,\ \gamma\text{ a density matrix}\} =\{I(\rho)\}, \qquad \inf\{\mathcal E(\rho\otimes\gamma)-\mathcal E(\gamma):c,d>0,\ \gamma\text{ a density matrix}\} =I(\rho),{E(ρ⊗γ)−E(γ):c,d>0, γ a density matrix}={I(ρ)},inf{E(ρ⊗γ)−E(γ):c,d>0, γ a density matrix}=I(ρ),

where I(ρ)=H(Tr⁡Bρ)+H(Tr⁡Aρ)−H(ρ)I(\rho)=H(\operatorname{Tr}_B\rho)+H(\operatorname{Tr}_A\rho)-H(\rho)I(ρ)=H(TrB​ρ)+H(TrA​ρ)−H(ρ), H(X)=−Re⁡Tr⁡[x↦xlog⁡2x](X)H(X)=-\operatorname{Re}\operatorname{Tr}[x\mapsto x\log_2x](X)H(X)=−ReTr[x↦xlog2​x](X), and each partial trace sums over its discarded index.

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