Lower and upper bounds in terms of CQMI
ProvedQAlgorithms.Papers.Independent.Support50.P43.alternative_boundsAll entropies are von Neumann entropies in bits, with zero eigenvalues contributing zero. For a normalized positive semidefinite state on nonzero finite-dimensional local complex spaces, write for the marginal entropy, , and . Define
For every such state, both inequalities hold:
These compare the two functionals while retaining the explicit dependence on the joint entropy and the number of parties.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P43
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P43
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
-- These accepted register types are definitionally the required finite tensor bases.
open QAlgorithms.Papers.Independent.Claimed50.P33 (RegisterBasis SubBasis)
open QAlgorithms.Papers.Independent.Information100.P21 (ghzKet)
/-- Theorem 4, PDF p.4: both bounds, including the n-dependent lower bound. -/
theorem alternative_bounds {n : ℕ} (hn : 2 ≤ n) {D : Fin n → Type}
[∀ i, Fintype (D i)] [∀ i, Nonempty (D i)]
(rho : Matrix (RegisterBasis D) (RegisterBasis D) ℂ) (hrho : IsDensityMatrix rho) :
conventionalOn rho Finset.univ - (n - 2 : ℕ) * marginalEntropyBits rho Finset.univ ≤
alternativeOn rho Finset.univ ∧
alternativeOn rho Finset.univ ≤
conventionalOn rho Finset.univ + 2 * marginalEntropyBits rho Finset.univ := by sorry
end QAlgorithms.Papers.Independent.Support50.P43
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , every family of finite nonempty sets indexed by , and every positive semidefinite complex matrix of trace indexed by , let be its marginal on , and set , where is applied by continuous functional calculus. Define and . Then
The local sets may have cardinality , and is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.