Exact tangle and I-concurrence of two-qudit isotropic states
OpenQAlgorithms.Papers.Independent.Intakethird100.P21.isotropic_exactLet be an integer and . Put , , and . Let be the convex roof of pure I-concurrence , and let be the separate convex roof of its square. Define , , , and . Then is a density operator and
These are exact mixed-state entanglement formulas; in general the tangle is not the square of mixed-state concurrence.
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 p.13, (3.41)--(3.42), inheriting d>=3 from p.12:
exact mixed-state tangle and I-concurrence, over the full physical F interval. -/
theorem isotropic_exact (d : ℕ) (hd : 3 ≤ d) (F : ℝ) (hF : F ∈ Set.Icc (0 : ℝ) 1) :
IsDensityMatrix (isotropicDensityAtFidelity d F) ∧
tangle (isotropicDensityAtFidelity d F) = tangleFormula d F ∧
concurrence (isotropicDensityAtFidelity d F) = concurrenceFormula d F := 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 natural number and every real , let
For a vector , put , , and ; define and as the respective infima of and over all finite decompositions into unit vectors with nonnegative weights summing to . Then is positive semidefinite with trace , and, writing
its two infima satisfy
The endpoints , and are included according to the displayed non-strict inequalities.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.