Continuity of the normalized PPT relative-entropy infimum
OpenQAlgorithms.Papers.Independent.Intakethird100.P100.pptEntanglement_continuityLet have positive finite dimensions and set . Let be exactly the trace-one positive semidefinite bipartite matrices whose partial transpose is positive semidefinite. Define , retaining infinity at a support violation.
All logarithms are natural. States are positive semidefinite matrices of trace one, and the distance uses the full trace norm, without a factor of one half. Set , with .
For arbitrary bipartite density matrices with , both infima are finite and
This is the paper's normalized PPT variation. Neither input is required to be PPT.
Formalization Note The accepted entropy infimum is stored in bits. The Lean bound multiplies its absolute real difference by , which gives exactly the natural-logarithm quantity displayed above.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P100
noncomputable section
open Filter
open scoped ENNReal Topology ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
namespace QAlgorithms.Papers.Independent.Intakethird100.P100
open QAlgorithms.Papers.Independent.Dependency50.P15
(relativeDistance relativeDistanceValue positiveOperatorRelativeEntropyBits groupedTensorPower)
open QAlgorithms.Papers.Independent.Information100.P54
(relativeEntropyBits relativeEntanglement)
/-- Remark (i), PDF p.2, and introduction, PDF p.1: the identical bound (3)
for minimization over normalized PPT states, with arbitrary density inputs. -/
theorem pptEntanglement_continuity
{A B : Type*} [Fintype A] [Fintype B] [DecidableEq A] [DecidableEq B]
[Nonempty A] [Nonempty B]
(sigma rho : Matrix (A × B) (A × B) ℂ)
(hsigma : IsDensityMatrix sigma) (hrho : IsDensityMatrix rho)
(hclose : traceNorm (sigma - rho) ≤ 1 / 3) :
pptEntanglement sigma < ⊤ ∧ pptEntanglement rho < ⊤ ∧
Real.log 2 * |(pptEntanglement sigma).toReal -
(pptEntanglement rho).toReal| ≤
2 * (traceNorm (sigma - rho) * Real.log (Fintype.card (A × B)) +
Real.negMulLog (traceNorm (sigma - rho))) + 4 * traceNorm (sigma - rho) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P100
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For any finite, nonempty types with decidable equality and density matrices on , meaning positive semidefinite matrices with trace , put and . If , then
Here in the extended nonnegative reals, where consists of density matrices for which the matrix with entries is positive semidefinite. For density matrices , the minimized quantity is if , and otherwise; it is also if either argument is not a density matrix. Here , and matrix functions use functional calculus with . The subscript denotes conversion to a real number, sending to , though the conclusion asserts finiteness. The cases and are included, with at zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.