Unnumbered Eqs.(87)–(88): conditional exact singlet bound
OpenQAlgorithms.Papers.Independent.Intakenext100.P42.exact_distillation_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.
Let , , and let be a density matrix. Assume across the grouped cut. Suppose a complete product-Kraus channel sends the entire input exactly to , where is a separable normalized residual state. Then
The channel may depend on . This is the conditional exact fixed-output idealization, with no dropped success probability or approximate asymptotic capacity claim.
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.30–32, Eqs.(87)–(88): conditional exact fixed-output singlet bound.
Additivity for the input copies is assumed, and the COMPLETE map produces the exact
Bell target with separable residual output. In nats the bound is m ln 2, not m. -/
theorem exact_distillation_bound {I J A B K : Type}
[Fintype I] [Fintype J] [Fintype A] [Fintype B] [Fintype K]
[DecidableEq I] [DecidableEq J] [DecidableEq A] [DecidableEq B]
[Nonempty I] [Nonempty J] [Nonempty A] [Nonempty B]
(sigma : Matrix (I × J) (I × J) ℂ) (hsigma : IsDensityMatrix sigma)
(n m : ℕ) (hn : 1 ≤ n) (hm : m ≤ n)
(hadd : relativeEntanglementNats (copies sigma n) = (n : EReal) * relativeEntanglementNats sigma)
(residual : Matrix (A × B) (A × B) ℂ) (hresidual : IsSeparableDensity residual)
(L : K → Matrix (Qubits m × A) (Fin n → I) ℂ)
(R : K → Matrix (Qubits m × B) (Fin n → J) ℂ)
(hcomplete : ProductComplete L R)
(hout : krausApply (fun k => Matrix.kronecker (L k) (R k)) (copies sigma n) =
groupedProduct (pureDensity (maxEntangled m)) residual) :
((m : ℝ) * Real.log 2 : EReal) ≤ (n : EReal) * 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
Let be finite nonempty types with decidable equality, and let be any finite type, with no nonemptiness or decidable-equality assumption on . Let be a positive semidefinite trace-one matrix on , let be natural numbers with and , and define its grouped -copy matrix by . For a bipartite matrix , let be the extended-real infimum of over separable density matrices , meaning finite convex combinations of products of positive semidefinite trace-one matrices; here when , and otherwise, with natural logarithms defined by functional calculus and . Assume explicitly that . Let be a separable density matrix on , and let and be matrices indexed by , where , such that
where and the grouped product on the right has entry at row and column . Then
in the extended reals. The case is included. Although may formally be empty, the completeness equation cannot hold for empty because the input space is nonzero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.