“…where α ∈ R 15 and f α (|ψ ψ| AA ′ BB ′ ) = ∅ =J ⊆{A,B,A ′ ,B ′ } α J S J (each entry of α corresponds to a non-empty subset of {A, B, A ′ , B ′ }), and identify instances which satisfy (1). Quantities of this form are of particular interest, since they often admit operational interpretations, usually in the form of bounds on performance in information theoretic tasks.…”