Two-qutrit formulas, tangent point and optimal component types
OpenQAlgorithms.Papers.Independent.Intakethird100.P21.two_qutritsFor two qutrits and , let , and let be the raw constrained Schmidt-tangle profile. Then
Moreover and . The equation has exactly the solution on . An attaining tangle ensemble can have common pure tangle for , and pure tangles only in above . An attaining concurrence ensemble can use only normalized product or maximally entangled states. These restrictions concern positive-weight members and do not require both types at an endpoint.
This explicit worked dimension illustrates the general tangent construction.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P21
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P21
open scoped Matrix ComplexConjugate
open Filter
open QAlgorithms
open QAlgorithms.Papers.Independent.Information100.P03
(PureEnsemble convexRoof pureConcurrence concurrence SchmidtData schmidtVector)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF pp.10--11, (3.38)--(3.39): explicit qutrit formulas, tangent data,
and attaining ensembles. Sqrt(3) multiplies the full displacement.
Zero-weight components are unrestricted; at F=1 no product component is required. -/
theorem two_qutrits (F : ℝ) (hF : F ∈ Set.Icc (0 : ℝ) 1) :
tangle (isotropicDensityAtFidelity 3 F) =
(if F ≤ 1/3 then 0 else if F ≤ 8/9 then explicitQ 3 F else 3*(F-1)+4/3) ∧
concurrence (isotropicDensityAtFidelity 3 F) = (if F ≤ 1/3 then 0 else Real.sqrt 3 * (F-1/3)) ∧
explicitQ 3 (8/9) = 1 ∧ deriv (explicitQ 3) (8/9) = 3 ∧
(∀ x ∈ Set.Ioo (1/3 : ℝ) 1,
(deriv (explicitQ 3) x = (4/3 - explicitQ 3 x) / (1-x) ↔ x = 8/9)) ∧
(∃ e : PureEnsemble (Fin 3 × Fin 3), IsOptimalPureEnsemble pureTangle (isotropicDensityAtFidelity 3 F) e ∧
∀ k, 0 < e.weight k →
if F ≤ 8/9 then pureTangle (e.vector k) = tangle (isotropicDensityAtFidelity 3 F)
else pureTangle (e.vector k) = 1 ∨ pureTangle (e.vector k) = 4/3) ∧
(∃ e : PureEnsemble (Fin 3 × Fin 3), IsOptimalPureEnsemble pureConcurrence (isotropicDensityAtFidelity 3 F) e ∧
∀ k, 0 < e.weight k → IsPureProductState (e.vector k) ∨ IsMaximallyEntangled (e.vector k)) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P21
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real , let , , and . For a unit vector , put , , and ; let and be the infima of the respective average costs over finite ensembles of unit vectors with nonnegative weights summing to and average matrix , using . Define , , and . Then
Furthermore, , , and, for every , if and only if . There exists a finite ensemble attaining such that every positive-weight component has -cost when , and has -cost either or when . Separately, there exists a finite ensemble attaining such that every positive-weight component is either a tensor product of two unit vectors or a vector for orthonormal families and in . Each attaining ensemble has average matrix exactly ; zero-weight components are unrestricted by the stated component conditions.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.