Tensor additivity of the support bound
OpenQAlgorithms.Papers.Independent.Intakethird100.P90.eta_tensor_additivityAll systems are finite-dimensional complex Hilbert spaces with fixed orthonormal product bases and positive local dimensions. A state is a positive semidefinite operator of trace one. All logarithms are base two and all operational rates are measured in standard Bell pairs (ebits) per input copy, with deterministic operations and error tending to zero. Write for distillable entanglement and entanglement cost under completely PPT-preserving CPTP operations; an explicit LOCC subscript denotes unrestricted two-way local operations and classical communication.
Let on and on be arbitrary normalized states, with independently chosen local dimensions. For a state with support projection , define . Across the product bipartition ,
The product partial transpose acts on both and . This is the additivity needed to retain the support lower bound in the asymptotic regime.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P90
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Intakethird100.P90
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms
open QAlgorithms.Papers.Independent.Dependency50.P36
(relativeEntropy rains target canonicalMatrix allowed pptDistillable)
open QAlgorithms.Papers.Independent.Information100.P04 (gamma copies IsPPT)
open QAlgorithms.Papers.Independent.Next46.P42 (regroupProduct)
open QAlgorithms.Papers.Independent.Information100.P06 (supportProjection)
open QAlgorithms.Papers.Independent.Information100.P21 (FiniteLOCC)
open QAlgorithms.Papers.Independent.Gap48.P32 (antisymmetricQutrit)
/-- arXiv:1606.09421v3, PDF pp.3,6, Proposition 4: independent local dimensions
and a product bipartition AA':BB', with both Bob factors transposed. -/
theorem eta_tensor_additivity {A B C D : Type}
[Fintype A] [Fintype B] [Fintype C] [Fintype D]
[DecidableEq A] [DecidableEq B] [DecidableEq C] [DecidableEq D]
[Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D]
(rho : Matrix (A × B) (A × B) ℂ) (sigma : Matrix (C × D) (C × D) ℂ)
(hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma) :
etaEntanglement (regroupProduct rho sigma) =
etaEntanglement rho + etaEntanglement sigma := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P90
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For arbitrary finite, nonempty types , all equipped with decidable equality, and complex matrices on and on , assume that both matrices are positive semidefinite and each has trace . Define their regrouped product , indexed by , by
Then as an equality of real numbers. For any matrix on a bipartite index set, let transpose its second party, so , and let be the spectral functional calculus of for the function at and elsewhere. The quantity appearing in the equality is defined literally by
where is the operator norm for Euclidean vector norms and , using the total real logarithm with . One-dimensional types are included in the quantification.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.