Observation 1: corrected nonnegative-coefficient version
OpenQAlgorithms.Papers.Independent.Intakethird100.P09.private_operator_bell_boundAll 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. Let X be an operator on a positive finite bipartite shield with full trace norm one. Suppose sqrt(XX^dagger) and sqrt(X^dagger X) are normalized separable shield states. Define gamma_X exactly by Eq.(7), on the physical key-plus-shield ownership cut. For every nonnegative-coefficient Bell expression,
Here Gamma on X acts only on Bob’s shield. The coefficient is one, without an additional half. This corrected version provides a reusable bound for operator-defined private bits.
The fixed private-bit formula used here is
with the two key qubits and shields regrouped by owner.
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.7, Observation 1, Eq.(A.3), CORRECTED s>=0 and Q(gamma_X) to Q_S(gamma_X).
Both square-root shield states are normalized SEP; X has full trace norm one. -/
theorem private_operator_bell_bound (a b : ℕ+) (S : BellScenario) (s : BellCoefficients S)
(hs : ∀ x y i j, 0 ≤ s x y i j) (X : Op (Fin a × Fin b))
(hX : traceNorm X = 1) (hleft : IsSeparableDensity (cfc Real.sqrt (X * Xᴴ)))
(hright : IsSeparableDensity (cfc Real.sqrt (Xᴴ * X))) :
stateValue s (partyCut (xForm X)) ≤
classicalBound s + quantumBound s * traceNorm (transposeSecond X) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P09
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be positive integers, let a Bell scenario have positive finite input and output sizes, and let be real coefficients. Let be any complex matrix on with , and suppose both and admit finite decompositions with , , and positive semidefinite trace- local matrices . Form on local dimensions by grouping the two binary indices as a key, with blocks , , , and , and all other key blocks zero. Then
where , , is the supremum of over local positive semidefinite measurement effects summing to the identity for each input, , and is the supremum of that measured expression over all positive finite local dimensions, density matrices, and local measurements. Matrix square roots use functional calculus; either or may equal , and itself is not assumed Hermitian or positive.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.