Strict qutrit mixed-state family and an exact value
OpenQAlgorithms.Papers.Independent.Intakethird100.P83.qutritFamilyFor , define the qutrit state , where , , and . These are normalized states, and the PPT distillable rate , SDP measure , and logarithmic negativity satisfy
In particular,
This gives a strict improvement on the negativity bound. The upper bound for general is not asserted to be attained.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P83
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real with , let , , be the standard basis of , put for , and define , where has entries . For a bipartite matrix , write , write , and let be its Euclidean operator norm. Define , for real , as the real supremum of over matrices satisfying , , and , where means that the difference is positive semidefinite. Define as the real supremum of all such that as ; there is no additional condition , and the tensor power at is the scalar . Define , where ranges over Hermitian matrices with and , and define . Then is positive semidefinite with trace , and
Moreover, including at the allowed endpoint ,
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.