Decomposition into cut relative entropies minus CQMI
ProvedQAlgorithms.Papers.Independent.Support50.P43.alternative_relative_decompositionAll 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
Write for genuine Umegaki relative entropy in bits, with value unless the support of is contained in that of . Each product reference below is regrouped on the original joint Hilbert space. Then
Every relative entropy occurring here is finite for a density input, so the subtraction is well-defined. This supplies a second representation independent of the rejected replicated-space identity.
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)
/-- Equation (13), middle line, PDF p.3: sum of cut relative entropies minus
conventional information. All reference products live on the original joint basis.
The relative entropies here are finite for every density input. -/
theorem alternative_relative_decomposition {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) :
(alternativeOn rho Finset.univ : EReal) =
(∑ i, (QAlgorithms.Papers.Independent.Information100.P60.relativeBits
rho (cutProduct rho {i}) : EReal)) -
(QAlgorithms.Papers.Independent.Information100.P60.relativeBits
rho (singletonProduct rho) : EReal) := 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 trace-one complex matrix indexed by , let be the marginal with entries , and write , where is applied by continuous functional calculus. Define full-register matrices and by
For matrices , let if either matrix is not positive semidefinite of trace ; otherwise let it be if , and, if , let
where both functions are applied by continuous functional calculus and the result lies in . The asserted equality, after embedding these quantities in the extended real numbers, is
The subtraction on the right is extended-real subtraction; the statement does not separately assert that its relative-entropy terms are finite.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.