Application Eq. (21): continuity-based R and R_H bounds
OpenQAlgorithms.Papers.Independent.Intakethird100.P09.continuity_nonlocality_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. Let rho be PPT on local dimensions a,b>=1 and belong to D(epsilon), with 0<epsilon<1/2 and an actual separable witness for that membership. Membership in D(epsilon) means that a normalized separable sigma on the same space satisfies ||rho^Gamma-sigma^Gamma||_1<=epsilon. Write d=ab for TOTAL bipartite dimension and h(epsilon)=-epsilon log_2(epsilon)-(1-epsilon)log_2(1-epsilon). Then
The PPT standing condition is retained from the invoked corollary. This makes both asymptotic measures small near the transposed separable set.
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 p.4, Eq.(21): standing PPT condition retained from Corollary 3.
Dimension is TOTAL bipartite dimension, logs in bits, source constant 4. -/
theorem continuity_nonlocality_bounds (a b : ℕ+) (rho : Op (Fin a × Fin b))
(hppt : (transposeSecond rho).PosSemidef) (epsilon : ℝ)
(hepsilon : 0 < epsilon) (hsmall : epsilon < 1/2) (hnear : rho ∈ nearSep epsilon) :
let bound := ENNReal.ofReal (4 * epsilon * (Real.log ((a : ℝ) * (b : ℝ)) / Real.log 2) +
2 * binEntropy2 epsilon)
asymptoticR false rho ≤ bound ∧ asymptoticRH false rho ≤ bound := 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 , every complex matrix on , and every real , assume that and that is positive semidefinite of trace and admits a separable density matrix satisfying . Here , , and a separable density matrix is a finite convex combination of tensor products of local positive semidefinite trace- matrices. Then
where , with zero contributions at the endpoints, and the bounds are regarded as elements of . The quantities are defined as follows. A Bell experiment applies a map in the closure of finite LOCC maps to positive finite output dimensions, then measures local POVMs in any scenario with positive finite input and output counts; finite LOCC maps are generated by identities and finite complete local Kraus operations with outcome-dependent continuations, summing over the outcomes. Its box is , where each local POVM has positive semidefinite effects summing to the identity. For any box , define , where ranges over nonnegative input distributions summing to , and ranges over finite convex combinations of deterministic boxes . The classical divergence is if some first-distribution entry is positive while the corresponding second-distribution entry is zero; otherwise it is the nonnegative part of . Let be the supremum of over Bell experiments, where is the grouped -fold tensor power. Let instead take the supremum over an experiment and a selected branch of complete finite local Kraus families after : for the branch , with the tensor product of the selected local operators and , its value is if , and otherwise, with the experiment’s measurements applied to the normalized branch. Finally, and , using positive block lengths and limits in .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.