Let ρB2 be any qubit density matrix. Alice's CJ matrices are ξ(x,a)=41[1+(−1)xσz]A1⊗[1+(−1)aσz]A2 (Eq. (20)). Bob's are η(y,b,b′)=b′η1(y,b)+(b′⊕1)η2(y,b) with η1(y,b)=21[1+(−1)yσz]B1⊗ρB2 and η2(y,b)=41[1+(−1)yσx]B1⊗[1+(−1)b+yσz]B2 (Eqs. (21)–(23)). Then {ξ(x,a)}x and {η(y,b,b′)}y are local instruments (positive semidefinite, with CPTP outcome sums), and with the process matrix W of Eq. (7) the success probability of Eq. (1) is
psucc=42+2.
Preamble
import Mathlib
import Definitions.Def_PeresTerno_kraus_basics
import Definitions.Def_OCB2012_defs
open Matrix
open scoped Kronecker ComplexOrder
O. Oreshkov, F. Costa, Č. Brukner, Quantum correlations with no causal order, Nat. Commun. 3, 1092 (2012), https://arxiv.org/abs/1105.4464v3, p. 5, Eq. (8); Appendix E, Eqs. (20)–(23)
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Statement (OCB2012.protocol_pSucc). Let ρ be any 2×2 complex matrix (rows and columns indexed by {0,1}) that is a density matrix, i.e. ρ is positive semidefinite (Hermitian, with v∗ρv≥0 for every v∈C2) and Trρ=1. There are no other hypotheses. The theorem asserts the conjunction of three claims:
ξ is an Alice instrument;
ηρ is a Bob instrument;
the success probability satisfies, exactly,
psucc(W7,ξ,ηρ)=42+2.
So the value (2+2)/4 is claimed for every density matrix ρ (the same number, independent of ρ). The hypothesis is satisfiable (e.g. ρ=∣0⟩⟨0∣), so the statement is not vacuous. Nothing is asserted about W7 itself (in particular the theorem does not claim W7 is positive semidefinite or a process matrix).
Conventions. Bits are Booleans, encoded false↦0, true↦1; ⊕ is XOR; s(x)=(−1)x (i.e. s(false)=1, s(true)=−1). The qubit basis is ∣0⟩,∣1⟩ (indices of {0,1}). Four qubit systems A1,A2,B1,B2; a 16×16 operator on A1A2B1B2 has rows/columns indexed by ((a1,a2),(b1,b2)), and Kronecker products are taken in that order, (X⊗Y)(i,k),(j,l)=XijYkl. The Pauli matrices are
σx=(0110),σz=(100−1),
and 1 denotes an identity matrix of the appropriate size.
where ∣e0⟩⟨e0∣=21(1111), ∣e1⟩⟨e1∣=21(1−1−11) (the σx eigenprojectors). Note ρ enters only the b′=1 branch.
CPTP Choi condition. For a matrix M on X1X2 (indexed by pairs (i,k)), "M is the CJ matrix of a CPTP map" is defined as: M is positive semidefinite and its partial trace over the second factor is the identity, (TrX2M)ij:=∑kM(i,k),(j,k)=δij.
Claim 1 (Alice instrument) means: for all bits x,a, ξ(x,a) is positive semidefinite; and for every bit a, ∑x∈{0,1}ξ(x,a) is positive semidefinite with TrA2∑xξ(x,a)=1A1 (a 2×2 identity).
Claim 2 (Bob instrument) means: for all bits y,b,b′, ηρ(y,b,b′) is positive semidefinite; and for all bits b,b′, ∑y∈{0,1}ηρ(y,b,b′) is positive semidefinite with TrB2∑yηρ(y,b,b′)=1B1.
Claim 3 (success probability). With P(MA,MB):=Tr[W7(MA⊗MB)]∈C (the 16×16 product, MA on A1A2, MB on B1B2), the real number psucc is defined as
That is: the first half averages over a,b (uniform weight 41) the probability that Alice's guess x equals b when b′=0, summed over Bob's outcome y; the second half averages over a,b the probability that Bob's guess y equals a when b′=1, summed over Alice's outcome x. "Probabilities" here are the real parts of the complex traces (imaginary parts are discarded, not asserted to vanish). The theorem claims this quantity equals (2+2)/4 exactly, where 2 is the positive real square root.
Confirmed by the moderator at approval.