Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Exact PPT yield and regularized Rains value of rho_v

Open
QAlgorithms.Papers.Independent.Intakethird100.P90.rhoV_distillation_rains

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.

Let ρv\rho_vρv​ be the equal mixture of (∣01⟩−∣10⟩)/2(|01\rangle-|10\rangle)/\sqrt2(∣01⟩−∣10⟩)/2​ and (∣02⟩−∣20⟩)/2(|02\rangle-|20\rangle)/\sqrt2(∣02⟩−∣20⟩)/2​. Define R(ρ)=inf⁡{S(ρ∥σ):σ≥0, ∥σTB∥1≤1}R(\rho)=\inf\{S(\rho\Vert\sigma):\sigma\ge0,\ \|\sigma^{T_B}\|_1\le1\}R(ρ)=inf{S(ρ∥σ):σ≥0, ∥σTB​∥1​≤1} and R∞(ρ)=inf⁡n≥1R(ρ⊗n)/nR^\infty(\rho)=\inf_{n\ge1}R(\rho^{\otimes n})/nR∞(ρ)=infn≥1​R(ρ⊗n)/n. Then

ED(ρv)=R∞(ρv)=log⁡2(1+1/2).E_D(\rho_v)=R^\infty(\rho_v)=\log_2(1+1/\sqrt2).ED​(ρv​)=R∞(ρv​)=log2​(1+1/2​).

The operational yield is strictly below one ebit. No identification of the continuous one-copy SDP with an unrounded integer Bell rank is used.

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 p.4, Proposition 3, Eq.(7): both quantitative equalities. -/
theorem rhoV_distillation_rains :
    pptDistillable rhoV = (Real.logb 2 (1 + 1 / Real.sqrt 2) : EReal) ∧
    regularizedRains rhoV = (Real.logb 2 (1 + 1 / Real.sqrt 2) : EReal) := 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. 4, Proposition 3: PPT distillable entanglement and regularized Rains value 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, with coordinate basis kets on {0,1,2}×{0,1,2}\{0,1,2\}\times\{0,1,2\}{0,1,2}×{0,1,2}, and let ρV=12(v1v1†+v2v2†)\rho_V=\tfrac12(v_1v_1^\dagger+v_2v_2^\dagger)ρV​=21​(v1​v1†​+v2​v2†​), where a vector’s outer product has entries vuvv‾v_u\overline{v_v}vu​vv​​. Then, in the extended real line,

DPPT(ρV)=log⁡2(1+12),R∞(ρV)=log⁡2(1+12).D_{\mathrm{PPT}}(\rho_V)=\log_2\left(1+\frac1{\sqrt2}\right), \qquad R^\infty(\rho_V)=\log_2\left(1+\frac1{\sqrt2}\right).DPPT​(ρV​)=log2​(1+2​1​),R∞(ρV​)=log2​(1+2​1​).

Write (Γ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)​ and ∥X∥1=Re⁡Tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{Tr}\sqrt{X^\dagger X}∥X∥1​=ReTrX†X​. A channel is a finite Kraus sum X↦∑jKjXKj†X\mapsto\sum_jK_jXK_j^\daggerX↦∑j​Kj​XKj†​ with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I; a PPT channel is one whose input-output partial-transpose conjugate is also a channel. The quantity DPPT(ρV)D_{\mathrm{PPT}}(\rho_V)DPPT​(ρV​) is the supremum of real r≥0r\ge0r≥0 such that, for every ε>0\varepsilon>0ε>0, every sufficiently large natural nnn admits a PPT channel satisfying ∥Λ(ρV⊗n^)−Φ⌈2nr⌉∥1≤ε\|\Lambda(\widehat{\rho_V^{\otimes n}})-\Phi_{\lceil2^{nr}\rceil}\|_1\le\varepsilon∥Λ(ρV⊗n​​)−Φ⌈2nr⌉​∥1​≤ε. Tensor powers have entries given by products, with each party’s registers grouped; the hat means the fixed relabelling by finite initial segments. The matrix Φk\Phi_kΦk​ has entry 1/k1/k1/k if its row and column each have equal party indices, and 000 otherwise. Finally,

R∞(ρV)=inf⁡n≥11nR(ρV⊗n),R(X)=inf⁡S≥0∥ΓS∥1≤1D2(X∥S),R^\infty(\rho_V)=\inf_{n\ge1}\frac1nR(\rho_V^{\otimes n}), \qquad R(X)=\inf_{\substack{S\ge0\\\|\Gamma S\|_1\le1}}D_2(X\|S),R∞(ρV​)=n≥1inf​n1​R(ρV⊗n​),R(X)=S≥0∥ΓS∥1​≤1​inf​D2​(X∥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 if ker⁡S⊆ker⁡X\ker S\subseteq\ker XkerS⊆kerX, and +∞+\infty+∞ otherwise. Matrix logarithms use spectral functional calculus with log⁡0=0\log0=0log0=0. The matrices SSS in this infimum are not required to have trace 111.

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