Unnumbered supporting fact: separable singlet overlap
OpenQAlgorithms.Papers.Independent.Intakenext100.P42.separable_singlet_overlapAll 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 , let be any normalized state separable across the full cut, and write . Then
This is a joint-overlap bound, without an independence assumption on marginal pairs. At zero pairs it is the scalar unit bound.
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 pp.31,38: JOINT overlap of m Bell pairs with a state separable across the
full Alice:Bob cut, rather than a product of marginal overlap estimates. -/
theorem separable_singlet_overlap (m : ℕ)
(rho : Matrix (Qubits m × Qubits m) (Qubits m × Qubits m) ℂ)
(hrho : IsSeparableDensity rho) :
effectProb (pureDensity (maxEntangled m)) rho ≤ 1 / (2 : ℝ)^m := 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 natural number , let and let be a matrix on that can be written as a finite convex combination , with , , and all positive semidefinite of trace . Define . Then
The quantifier includes , when consists of the single empty bit string and the upper bound is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.