Example 3: maximally correlated two-qubit family
OpenQAlgorithms.Papers.Independent.Intakenext100.P42.example_threeAll local registers are nonzero and finite-dimensional. Density matrices are positive semidefinite with trace one. Entropies use natural logarithms, , and Umegaki relative entropy is on failure of support inclusion. The relative entropy of entanglement is , where separability is across the specified Alice:Bob cut.
Let and satisfy . Put and . Then is a separable minimizer and, for ,
Complex phases, zero coherence and pure endpoints are included.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P42
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder ENNReal Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P42
open QAlgorithms QAlgorithms.Entanglement
open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy)
open QAlgorithms.Papers.Independent.Information100.P56 (entropy)
open QAlgorithms.Papers.Independent.Information100.P04 (copies)
open QAlgorithms.Papers.Independent.Bridge50.P49 (groupedProduct)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Example 3, PDF p.24, Eqs.(63)–(66): the corrected discriminant has +4|B|^2.
Complex phases, zero coherence, and pure endpoints are all retained. -/
theorem example_three (a : ℝ) (b : ℂ) (ha : a ∈ Set.Icc 0 1)
(hb : Complex.normSq b ≤ a*(1-a)) :
IsMinimizer (correlated a b) (correlatedMinimum a) ∧
relativeEntanglementNats (correlated a b) =
((correlatedEigenvalue a b true * Real.log (correlatedEigenvalue a b true) +
correlatedEigenvalue a b false * Real.log (correlatedEigenvalue a b false) -
a*Real.log a - (1-a)*Real.log (1-a) : ℝ) : EReal) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P42
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real and complex satisfying , define, in the standard two-qubit basis,
and . Define to be when , and otherwise, and let be its infimum over separable density matrices . A separable density matrix means a finite convex combination of products of positive semidefinite trace-one matrices. The assertion is that is separable and for every separable density matrix , and that
with the right side embedded into the extended reals. All logarithms are natural, matrix functions use functional calculus, and in these total definitions. Equality in is allowed, as are and , each of which forces .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.