Explicit alpha-family estimates and the strict irreversibility chain
OpenQAlgorithms.Papers.Independent.Intakethird100.P90.alpha_family_irreversibilityAll 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 , , , and . With the infimum of over Hermitian , and the support-sandwich lower bound, the explicit estimates are
Moreover,
The decimal endpoints are exact rationals. Below this family need not be antisymmetric.
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.4--5: exact rational parameter interval,
both explicit estimates, the trace-norm evaluation, and the full irreversibility chain. -/
theorem alpha_family_irreversibility (alpha : ℝ)
(hlower : (21/50 : ℝ) ≤ alpha) (hupper : alpha ≤ (1/2 : ℝ)) :
wangDuanBound (alphaState alpha) ≤ Real.logb 2 (1 + Real.sqrt (2*alpha*(1-alpha))) ∧
traceNorm (gamma (alphaState alpha)) = 1 + Real.sqrt (2*alpha*(1-alpha)) ∧
-Real.logb 2 (1-alpha) ≤ etaEntanglement (alphaState alpha) ∧
Real.logb 2 (1 + Real.sqrt (2*alpha*(1-alpha))) < -Real.logb 2 (1-alpha) ∧
pptDistillable (alphaState alpha) ≤ (wangDuanBound (alphaState alpha) : EReal) ∧
wangDuanBound (alphaState alpha) < etaEntanglement (alphaState alpha) ∧
(etaEntanglement (alphaState alpha) : EReal) ≤ asymptoticEntanglementCost false (alphaState alpha) := 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 every real with , let on , where for . Write for the partial transpose with entries , and . Define as the infimum of over Hermitian satisfying . Let be the matrix obtained by applying the scalar function if , and otherwise, to by continuous functional calculus; define as the infimum of over Hermitian with and , and define . Here a PPT channel is a map such that both and admit finite Kraus representations with . Let be the supremum, in the extended real numbers, of nonnegative real rates such that, for every tolerance , all sufficiently large natural admit a PPT channel taking within trace norm of ; let be the extended-real infimum of nonnegative real rates such that, for every , all sufficiently large positive admit a natural and a PPT channel taking within trace norm of . Tensor-power basis indices are relabelled by the specified finite-set bijections, and when and , and is zero otherwise; and rate are allowed. The assertion is
where real quantities in extended-real inequalities are embedded into the extended real numbers.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.