Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Strict qutrit mixed-state family and an exact value

Open
QAlgorithms.Papers.Independent.Intakethird100.P83.qutritFamily

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

prove2quantum

For 0<α≤120<\alpha\le\tfrac120<α≤21​, define the qutrit state ρ(α)=13∑m=02∣ψm⟩⟨ψm∣\rho^{(\alpha)}=\tfrac13\sum_{m=0}^2|\psi_m\rangle\langle\psi_m|ρ(α)=31​∑m=02​∣ψm​⟩⟨ψm​∣, where ψ0=α∣01⟩+1−α∣10⟩\psi_0=\sqrt\alpha|01\rangle+\sqrt{1-\alpha}|10\rangleψ0​=α​∣01⟩+1−α​∣10⟩, ψ1=α∣02⟩+1−α∣20⟩\psi_1=\sqrt\alpha|02\rangle+\sqrt{1-\alpha}|20\rangleψ1​=α​∣02⟩+1−α​∣20⟩, and ψ2=α∣12⟩+1−α∣21⟩\psi_2=\sqrt\alpha|12\rangle+\sqrt{1-\alpha}|21\rangleψ2​=α​∣12⟩+1−α​∣21⟩. These are normalized states, and the PPT distillable rate EΓE_\GammaEΓ​, SDP measure EWE_WEW​, and logarithmic negativity ENE_NEN​ satisfy

EΓ(ρ(α))≤EW(ρ(α))≤log⁡2(1+α(1−α))<EN(ρ(α))=log⁡2(1+43α(1−α)).E_\Gamma(\rho^{(\alpha)})\le E_W(\rho^{(\alpha)})\le\log_2\bigl(1+\sqrt{\alpha(1-\alpha)}\bigr)<E_N(\rho^{(\alpha)})=\log_2\bigl(1+\tfrac43\sqrt{\alpha(1-\alpha)}\bigr).EΓ​(ρ(α))≤EW​(ρ(α))≤log2​(1+α(1−α)​)<EN​(ρ(α))=log2​(1+34​α(1−α)​).

In particular,

EΓ(ρ(1/2))=EW(ρ(1/2))=log⁡2(3/2)<log⁡2(5/3)=EN(ρ(1/2)).E_\Gamma(\rho^{(1/2)})=E_W(\rho^{(1/2)})=\log_2(3/2)<\log_2(5/3)=E_N(\rho^{(1/2)}).EΓ​(ρ(1/2))=EW​(ρ(1/2))=log2​(3/2)<log2​(5/3)=EN​(ρ(1/2)).

This gives a strict improvement on the negativity bound. The upper bound for general α\alphaα is not asserted to be attained.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P83
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder

open Filter

namespace QAlgorithms.Papers.Independent.Intakethird100.P83

open QAlgorithms.Papers.Independent.Support50.P11 (Loewner)

open QAlgorithms.Papers.Independent.Dependency50.P32 (partialTranspose)

open QAlgorithms.Papers.Independent.Information100.P34 (supportProjector)

variable {A B C D : Type*}

variable [Fintype A] [Fintype B] [Fintype C] [Fintype D]

variable [DecidableEq A] [DecidableEq B] [DecidableEq C] [DecidableEq D]

/-- Proposition 5 and its explicit bounds (11)–(12), PDF p.4.
The bound (12) is not asserted to be an equality for general alpha. -/
theorem qutritFamily (alpha : ℝ) (hpos : 0 < alpha) (hhalf : alpha ≤ 1/2) :
    IsDensityMatrix (rhoAlpha alpha) ∧
    entanglementGamma (rhoAlpha alpha) ≤ entanglementW (rhoAlpha alpha) ∧
    entanglementW (rhoAlpha alpha) ≤ Real.logb 2 (1 + Real.sqrt (alpha * (1-alpha))) ∧
    entanglementN (rhoAlpha alpha) = Real.logb 2 (1 + (4/3 : ℝ) * Real.sqrt (alpha * (1-alpha))) ∧
    entanglementW (rhoAlpha alpha) < entanglementN (rhoAlpha alpha) ∧
    entanglementGamma (rhoAlpha (1/2)) = Real.logb 2 (3/2) ∧
    entanglementW (rhoAlpha (1/2)) = Real.logb 2 (3/2) ∧
    entanglementN (rhoAlpha (1/2)) = Real.logb 2 (5/3) ∧
    Real.logb 2 (3/2) < Real.logb 2 (5/3) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P83

end
Source
Improved Semidefinite Programming Upper Bound on Distillable Entanglement, arXiv:1601.07940v4, PDF p. 4, Proposition 5: strict mixed-state family and an exact value
Read-back

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

For every real α\alphaα with 0<α≤120<\alpha\le \tfrac120<α≤21​, let ∣ij⟩|ij\rangle∣ij⟩, i,j∈{0,1,2}i,j\in\{0,1,2\}i,j∈{0,1,2}, be the standard basis of C3⊗C3\mathbb C^3\otimes\mathbb C^3C3⊗C3, put ψij=α ∣ij⟩+1−α ∣ji⟩\psi_{ij}=\sqrt{\alpha}\,|ij\rangle+\sqrt{1-\alpha}\,|ji\rangleψij​=α​∣ij⟩+1−α​∣ji⟩ for i<ji<ji<j, and define ρα=13∑i<j∣ψij⟩⟨ψij∣\rho_\alpha=\tfrac13\sum_{i<j}|\psi_{ij}\rangle\langle\psi_{ij}|ρα​=31​∑i<j​∣ψij​⟩⟨ψij​∣, where ∣v⟩⟨v∣|v\rangle\langle v|∣v⟩⟨v∣ has entries vxvy‾v_x\overline{v_y}vx​vy​​. For a bipartite matrix XXX, write X(a,b),(a′,b′)Γ=X(a,b′),(a′,b)X^\Gamma_{(a,b),(a',b')}=X_{(a,b'),(a',b)}X(a,b),(a′,b′)Γ​=X(a,b′),(a′,b)​, write ∥X∥1=Re⁡tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{tr}\sqrt{X^\dagger X}∥X∥1​=RetrX†X​, and let ∥X∥op\|X\|_{\mathrm{op}}∥X∥op​ be its Euclidean operator norm. Define FX(k)F_X(k)FX​(k), for real kkk, as the real supremum of Re⁡tr⁡(XQ)\operatorname{Re}\operatorname{tr}(XQ)Retr(XQ) over matrices satisfying k>0k>0k>0, 0⪯Q⪯I0\preceq Q\preceq I0⪯Q⪯I, and −k−1I⪯QΓ⪯k−1I-k^{-1}I\preceq Q^\Gamma\preceq k^{-1}I−k−1I⪯QΓ⪯k−1I, where ⪯\preceq⪯ means that the difference is positive semidefinite. Define Γ(X)\Gamma(X)Γ(X) as the real supremum of all r∈Rr\in\mathbb Rr∈R such that FX⊗n(2nr)→1F_{X^{\otimes n}}(2^{nr})\to1FX⊗n​(2nr)→1 as n→∞n\to\inftyn→∞; there is no additional condition r≥0r\ge0r≥0, and the tensor power at n=0n=0n=0 is the scalar 111. Define W(X)=log⁡2sup⁡RRe⁡tr⁡(XΓR)W(X)=\log_2\sup_R\operatorname{Re}\operatorname{tr}(X^\Gamma R)W(X)=log2​supR​Retr(XΓR), where RRR ranges over Hermitian matrices with ∥R∥op≤1\|R\|_{\mathrm{op}}\le1∥R∥op​≤1 and RΓ⪰0R^\Gamma\succeq0RΓ⪰0, and define N(X)=log⁡2∥XΓ∥1N(X)=\log_2\|X^\Gamma\|_1N(X)=log2​∥XΓ∥1​. Then ρα\rho_\alphaρα​ is positive semidefinite with trace 111, and

Γ(ρα)≤W(ρα)≤log⁡2 ⁣(1+α(1−α)),N(ρα)=log⁡2 ⁣(1+43α(1−α)),W(ρα)<N(ρα).\Gamma(\rho_\alpha)\le W(\rho_\alpha) \le\log_2\!\left(1+\sqrt{\alpha(1-\alpha)}\right),\qquad N(\rho_\alpha)=\log_2\!\left(1+\tfrac43\sqrt{\alpha(1-\alpha)}\right),\qquad W(\rho_\alpha)<N(\rho_\alpha).Γ(ρα​)≤W(ρα​)≤log2​(1+α(1−α)​),N(ρα​)=log2​(1+34​α(1−α)​),W(ρα​)<N(ρα​).

Moreover, including at the allowed endpoint α=12\alpha=\tfrac12α=21​,

Γ(ρ1/2)=W(ρ1/2)=log⁡232,N(ρ1/2)=log⁡253,log⁡232<log⁡253.\Gamma(\rho_{1/2})=W(\rho_{1/2})=\log_2\tfrac32,\qquad N(\rho_{1/2})=\log_2\tfrac53,\qquad \log_2\tfrac32<\log_2\tfrac53.Γ(ρ1/2​)=W(ρ1/2​)=log2​23​,N(ρ1/2​)=log2​35​,log2​23​<log2​35​.
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