Exact entanglement of the qutrit antisymmetric state
OpenQAlgorithms.Papers.Independent.Intakethird100.P83.antisymmetricValuesLet be the swap operator on , defined by , and define the normalized antisymmetric state . Then
Here is the vanishing-error PPT rate, is the logarithm of SDP (7), and is logarithmic negativity. This contrasts with the symmetric-support example in Proposition 5.
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]
/-- Remark, PDF p.4: exact PPT entanglement values of the constructed
normalized qutrit antisymmetric state. -/
theorem antisymmetricValues :
IsDensityMatrix qutritAntisymmetricState ∧
entanglementGamma qutritAntisymmetricState = Real.logb 2 (5/3) ∧
entanglementW qutritAntisymmetricState = Real.logb 2 (5/3) ∧
entanglementN qutritAntisymmetricState = 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
Let be the swap matrix on , defined by , and put . For a bipartite matrix , define , , and let be the Euclidean operator norm. Let be the real supremum of over satisfying , , and , with denoting positive semidefinite difference. Let be the real supremum of all real , without a nonnegativity restriction, such that ; the zeroth tensor power is the scalar . Set , with Hermitian, , and , and set . Then is positive semidefinite with trace , and
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.