Theorem 3, Eqs. (19)–(20): success-weighted hidden nonlocality
OpenQAlgorithms.Papers.Independent.Intakethird100.P09.hidden_relative_entropy_boundsAll states are normalized finite-dimensional bipartite density matrices. Gamma denotes transposition of Bob in the fixed product basis. The trace norm is the full trace norm. For a finite Bell expression S with real coefficients, C(S) and Q(S) are its largest signed classical value and its supremal signed quantum value over arbitrary finite local dimensions; Q_S(rho) optimizes complete local POVMs on the fixed state.
The quantities R, T^infinity and R_H optimize arbitrary finite Bell scenarios and LOCC preprocessing of independent copies, using limsup per positive copy number. Input laws are arbitrary joint laws. T^infinity takes its innermost infimum over a one-copy separable sigma, comparing the same channel and the same measurements on rho^n and sigma^n. R_H counts the successful local-filter branch with its probability, after normalizing that branch; a zero-probability branch scores zero. E_r is the unregularized relative entropy of entanglement. All relative entropies and logarithms use bits and retain infinity on support failure. For every rho,
For PPT rho, additionally
The filter follows LOCC, is a locally realizable selected product Kraus branch of a complete instrument, and its success weight is counted once. This extends the entropy bound to hidden nonlocality.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P09
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P09
open scoped Matrix ComplexConjugate ComplexOrder ENNReal
open Filter
open QAlgorithms.Entanglement (IsSeparableDensity)
open QAlgorithms.Papers.Independent.Dependency50.P24
(transposeSecond partyCut xForm swapPrivate hidingOne hidingTwo)
open QAlgorithms.Papers.Independent.Dependency50.P42 (dimensionedPower)
open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)
open QAlgorithms.Papers.Independent.Advance50.P47 (Box)
open QAlgorithms.Papers.Independent.Information100.P54 (relativeEntanglement)
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
/-- PDF pp.4,9, Theorem 3, Eqs.(19)--(20): filter AFTER LOCC, normalized successful
branch, and success weight counted once. Includes general chain and conditional PPT bound. -/
theorem hidden_relative_entropy_bounds (a b : ℕ+) (rho : Op (Fin a × Fin b))
(hrho : IsDensityMatrix rho) :
asymptoticRH false rho ≤ asymptoticT false rho ∧
asymptoticT false rho ≤ relativeEntanglement rho ∧
((transposeSecond rho).PosSemidef →
asymptoticRH false rho ≤ relativeEntanglement (transposeSecond rho)) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P09
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all positive integers and every positive semidefinite complex matrix of trace on , the following bounds hold:
Here , and . A separable density matrix means a finite sum , where , , and every is positive semidefinite with trace . The relative entropy of entanglement is , where unless both arguments are density matrices and ; otherwise it is , with , matrix functions interpreted by continuous functional calculus, and the real logarithm taking value at . To define , a Bell experiment consists of a map in the closure of finite LOCC maps, with positive finite output dimensions, followed by local POVMs in a scenario with positive finite numbers of inputs and outputs; each POVM consists of positive semidefinite matrices summing to the identity. Finite LOCC maps are generated by identity maps and finite complete local Kraus operations, followed by outcome-dependent maps of the same form and summed over outcomes; the closure is taken in the topology on these maps. Its measured box on is . For boxes and a nonnegative input distribution summing to , put , where if some , and otherwise equals the nonnegative part of . A finite local box is a finite convex combination of deterministic boxes ; define . Write for the grouped tensor power whose entries are . Let be the supremum over Bell experiments on of . Let be the supremum over such experiments and complete finite local Kraus families, with one selected Kraus operator on each side, of when the selected output branch has trace , and otherwise of , using the experiment’s local POVMs and equal to the tensor product of the selected operators. Then and , with positive block lengths and all these quantities valued in .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.