Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

One-ebit cost and asymptotic PPT relative entropy of rho_v

Open
QAlgorithms.Papers.Independent.Intakethird100.P90.rhoV_cost_relative_entropy

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All systems are finite-dimensional complex Hilbert spaces with fixed orthonormal product bases and positive local dimensions. A state is a positive semidefinite operator of trace one. All logarithms are base two and all operational rates are measured in standard Bell pairs (ebits) per input copy, with deterministic operations and error tending to zero. Write ED,ECE_D,E_CED​,EC​ for distillable entanglement and entanglement cost under completely PPT-preserving CPTP operations; an explicit LOCC subscript denotes unrestricted two-way local operations and classical communication.

Put ∣v1⟩=(∣01⟩−∣10⟩)/2|v_1\rangle=(|01\rangle-|10\rangle)/\sqrt2∣v1​⟩=(∣01⟩−∣10⟩)/2​, ∣v2⟩=(∣02⟩−∣20⟩)/2|v_2\rangle=(|02\rangle-|20\rangle)/\sqrt2∣v2​⟩=(∣02⟩−∣20⟩)/2​, and ρv=(∣v1⟩⟨v1∣+∣v2⟩⟨v2∣)/2\rho_v=(|v_1\rangle\langle v_1|+|v_2\rangle\langle v_2|)/2ρv​=(∣v1​⟩⟨v1​∣+∣v2​⟩⟨v2​∣)/2. Let ER∞E_R^\inftyER∞​ denote the positive-block regularization of relative entropy to normalized PPT states. Then

EC(ρv)=ER∞(ρv)=1.E_C(\rho_v)=E_R^\infty(\rho_v)=1.EC​(ρv​)=ER∞​(ρv​)=1.

Both values are exactly one ebit per copy; this statement does not replace PPT operations by LOCC.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P90
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder

namespace QAlgorithms.Papers.Independent.Intakethird100.P90

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms

open QAlgorithms.Papers.Independent.Dependency50.P36
  (relativeEntropy rains target canonicalMatrix allowed pptDistillable)

open QAlgorithms.Papers.Independent.Information100.P04 (gamma copies IsPPT)

open QAlgorithms.Papers.Independent.Next46.P42 (regroupProduct)

open QAlgorithms.Papers.Independent.Information100.P06 (supportProjection)

open QAlgorithms.Papers.Independent.Information100.P21 (FiniteLOCC)

open QAlgorithms.Papers.Independent.Gap48.P32 (antisymmetricQutrit)

/-- arXiv:1606.09421v3, PDF pp.3--4, Proposition 2: both printed equalities. -/
theorem rhoV_cost_relative_entropy :
    asymptoticEntanglementCost false rhoV = 1 ∧ regularizedPptRelativeEntropy rhoV = 1 := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P90

end
Source
Irreversibility of Asymptotic Entanglement Manipulation Under Quantum Operations Completely Preserving Positivity of Partial Transpose, arXiv:1606.09421v3, PDF p. 3, Proposition 2: PPT cost and regularized PPT relative entropy of rho_v
Read-back

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

Let vj=(∣0,j⟩−∣j,0⟩)/2v_j=(|0,j\rangle-|j,0\rangle)/\sqrt2vj​=(∣0,j⟩−∣j,0⟩)/2​ for j=1,2j=1,2j=1,2, where the kets are coordinate basis vectors on {0,1,2}×{0,1,2}\{0,1,2\}\times\{0,1,2\}{0,1,2}×{0,1,2}, and set ρV=12(v1v1†+v2v2†)\rho_V=\tfrac12(v_1v_1^\dagger+v_2v_2^\dagger)ρV​=21​(v1​v1†​+v2​v2†​), with (vv†)u,v=vuvv‾(vv^\dagger)_{u,v}=v_u\overline{v_v}(vv†)u,v​=vu​vv​​. The assertion is

CPPT(ρV)=1,EPPT∞(ρV)=1C_{\mathrm{PPT}}(\rho_V)=1,\qquad E_{\mathrm{PPT}}^\infty(\rho_V)=1CPPT​(ρV​)=1,EPPT∞​(ρV​)=1

as equalities in the extended real line. Here (ΓX)(a,b),(a′,b′)=X(a,b′),(a′,b)(\Gamma X)_{(a,b),(a',b')}=X_{(a,b'),(a',b)}(ΓX)(a,b),(a′,b′)​=X(a,b′),(a′,b)​, ∥X∥1=Re⁡Tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{Tr}\sqrt{X^\dagger X}∥X∥1​=ReTrX†X​, and a channel is a finite Kraus sum X↦∑jKjXKj†X\mapsto\sum_jK_jXK_j^\daggerX↦∑j​Kj​XKj†​ satisfying ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I. A PPT channel is a channel whose partial-transpose conjugate X↦ΓoutΛ(ΓinX)X\mapsto\Gamma_{\rm out}\Lambda(\Gamma_{\rm in}X)X↦Γout​Λ(Γin​X) is also a channel. The quantity CPPT(ρV)C_{\mathrm{PPT}}(\rho_V)CPPT​(ρV​) is the infimum of real r≥0r\ge0r≥0 such that, for every ε,δ>0\varepsilon,\delta>0ε,δ>0, all sufficiently large positive natural nnn admit m∈Nm\in\mathbb Nm∈N, including m=0m=0m=0, and a PPT channel with m≤n(r+δ)m\le n(r+\delta)m≤n(r+δ) and ∥Λ(Φ2m)−ρV⊗n^∥1≤ε\|\Lambda(\Phi_{2^m})-\widehat{\rho_V^{\otimes n}}\|_1\le\varepsilon∥Λ(Φ2m​)−ρV⊗n​​∥1​≤ε. The matrix Φk\Phi_kΦk​ has entry 1/k1/k1/k when both row and column have equal party indices, and 000 otherwise; tensor-power entries are products of the single-copy entries, with party registers grouped and then relabelled by the fixed finite-index bijections indicated by the hat. The other quantity is

EPPT∞(ρV)=inf⁡n≥11ninf⁡S≥0, Tr⁡S=1ΓS≥0D2(ρV⊗n∥S),E_{\mathrm{PPT}}^\infty(\rho_V)= \inf_{n\ge1}\frac1n\inf_{\substack{S\ge0,\ \operatorname{Tr}S=1\\\Gamma S\ge0}}D_2(\rho_V^{\otimes n}\|S),EPPT∞​(ρV​)=n≥1inf​n1​S≥0, TrS=1ΓS≥0​inf​D2​(ρV⊗n​∥S),

where D2(X∥S)=Re⁡Tr⁡(Xlog⁡X−Xlog⁡S)/log⁡2D_2(X\|S)=\operatorname{Re}\operatorname{Tr}(X\log X-X\log S)/\log2D2​(X∥S)=ReTr(XlogX−XlogS)/log2 when ker⁡S⊆ker⁡X\ker S\subseteq\ker XkerS⊆kerX, and D2(X∥S)=+∞D_2(X\|S)=+\inftyD2​(X∥S)=+∞ otherwise, with matrix logarithms interpreted by spectral functional calculus and log⁡0=0\log0=0log0=0.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me