Unnumbered Eq.(73): optimized Werner lower bound
OpenQAlgorithms.Papers.Independent.Intakenext100.P42.optimized_werner_lower_boundAll 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.
For any two-qubit density matrix , let be its maximum overlap with a maximally entangled unit vector. The maximum is attained by a local-unitary image of . Let . Then
This is the optimized Werner lower bound for every input density matrix.
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
/-- PDF p.25, corrected Eq.(73): attained optimized Werner lower bound for EVERY input.
For F≤1/2 the Werner value is zero; the printed positive expression fails on I/4. -/
theorem optimized_werner_lower_bound (sigma : Matrix (Bool × Bool) (Bool × Bool) ℂ)
(hsigma : IsDensityMatrix sigma) :
let f := twoQubitMaxEntangledFraction sigma
(∃ U V : Matrix.unitaryGroup Bool ℂ,
effectProb (pureDensity (localBell U V)) sigma = f) ∧
relativeEntanglementNats (singletWernerState f) = (wernerValue f : EReal) ∧
relativeEntanglementNats (singletWernerState f) ≤ relativeEntanglementNats sigma := 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 positive semidefinite trace-one matrix on , let and define
Let and . For any matrix , let be the extended-real infimum over separable density matrices of , where if , and otherwise; separable density matrices are finite convex combinations of tensor products of positive semidefinite trace-one matrices. The assertion is that some pair of unitaries attains the displayed supremum, and
The piecewise real value is embedded into the extended reals. Logarithms are natural, matrix logarithms use functional calculus, and the total logarithm has .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.